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

Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment

Author

Listed:
  • Min Ji
  • Wenya Zhang
  • Lijuan Liao
  • T. C. E. Cheng
  • Yuanyuan Tan

Abstract

We consider the problem of parallel-machine scheduling with machine-dependent slack (SLK) due-window assignment in the multitasking environment, which exists in various application domains such as Internet services, project management, and manufacturing. Motivated by practical observations, we extend the original model of multitasking to a more general model where each job’s interruption proportion depends on the job itself and its processing position. In the light of individualised service, we consider SLK due-window assignment. Our objective is to minimise the total cost that comprises the earliness, tardiness, and due-window-related costs. Finding that an optimal schedule exists when each machine is occupied by at least one job, we show that the problem is polynomially solvable. We provide a more efficient solution algorithm for a special case of the problem. Finally, we present numerical examples to illustrate the application of the theoretical results and working of the solution algorithms.

Suggested Citation

  • Min Ji & Wenya Zhang & Lijuan Liao & T. C. E. Cheng & Yuanyuan Tan, 2019. "Multitasking parallel-machine scheduling with machine-dependent slack due-window assignment," International Journal of Production Research, Taylor & Francis Journals, vol. 57(6), pages 1667-1684, March.
  • Handle: RePEc:taf:tprsxx:v:57:y:2019:i:6:p:1667-1684
    DOI: 10.1080/00207543.2018.1497312
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2018.1497312
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2018.1497312?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. Baruch Mor, 2022. "Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 79-97, January.
    2. Min Ji & Yingchun Zhang & Yuan Zhang & T. C. E. Cheng & Yiwei Jiang, 2022. "Single-machine multitasking scheduling with job efficiency promotion," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 446-479, August.
    3. Yongjian Yang & Guangqiang Yin & Chunyu Wang & Yunqiang Yin, 0. "Due date assignment and two-agent scheduling under multitasking environment," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-17.
    4. Yongjian Yang & Guangqiang Yin & Chunyu Wang & Yunqiang Yin, 2022. "Due date assignment and two-agent scheduling under multitasking environment," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2207-2223, November.
    5. Xiaoyun Xiong & Peng Zhou & Yunqiang Yin & T. C. E. Cheng & Dengfeng Li, 2019. "An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 502-516, September.

    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:57:y:2019:i:6:p:1667-1684. 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.