IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v59y2021i12p3633-3663.html
   My bibliography  Save this article

Multi-agent scheduling problems under multitasking

Author

Listed:
  • Dujuan Wang
  • Yugang Yu
  • Yunqiang Yin
  • Tai Chiu Edwin Cheng

Abstract

We consider a multitasking scheduling model with multiple agents, each of which has a set of tasks to perform on a cloud manufacturing platform on a competitive basis. Each agent wishes to minimise its desirable objective function related to the completion times of its own tasks only. However, the cloud manufacturing platform wishes to minimise the objective of one agent (being long-term critical agent), while keeping the objective of each of the other agents (being short-term one-off agents) within a given limit. The objective functions considered are the maximum of a regular function (associated with each task), the total completion time, and the weighted number of late jobs. Cloud manufacturing enables multitasking scheduling, under which the processing of a selected task may be interrupted by other tasks that are available but unfinished. We ascertain the computational complexity status of each of the problems we consider and devise solution procedures, if viable, for them. We also conduct numerical studies to generate insights into the effects of multitasking on scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking.

Suggested Citation

  • Dujuan Wang & Yugang Yu & Yunqiang Yin & Tai Chiu Edwin Cheng, 2021. "Multi-agent scheduling problems under multitasking," International Journal of Production Research, Taylor & Francis Journals, vol. 59(12), pages 3633-3663, June.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:12:p:3633-3663
    DOI: 10.1080/00207543.2020.1748908
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1748908
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1748908?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Li-Han Zhang & Dan-Yang Lv & Ji-Bo Wang, 2023. "Two-Agent Slack Due-Date Assignment Scheduling with Resource Allocations and Deteriorating Jobs," Mathematics, MDPI, vol. 11(12), pages 1-12, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:59:y:2021:i:12:p:3633-3663. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.