IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v30y2015i2d10.1007_s10878-014-9727-z.html
   My bibliography  Save this article

Single-server parallel-machine scheduling with loading and unloading times

Author

Listed:
  • Yiwei Jiang

    (Zhejiang Sci-Tech University)

  • Qinghui Zhang

    (Zhejiang Sci-Tech University)

  • Jueliang Hu

    (Zhejiang Sci-Tech University)

  • Jianming Dong

    (Zhejiang Sci-Tech University)

  • Min Ji

    (Zhejiang Gongshang University)

Abstract

We consider a scheduling problem in which jobs are processed on two identical parallel machines that share a common server that loads and unloads jobs on them. Each job has to be loaded by the server before being processed on one of the machines and unloaded immediately by the server after its processing. The goal is to minimize the makespan. We study non-preemptive variants of the problem where the loading and unloading times are both equal to one time unit. Since the non-preemptive variant of the problem is NP-hard, we apply two classical heuristics, namely list scheduling (LS) and longest processing time (LPT),to tackle the problem. We show that LS and LPT have tight worst-case ratios of 12/7 and 4/3, respectively.

Suggested Citation

  • Yiwei Jiang & Qinghui Zhang & Jueliang Hu & Jianming Dong & Min Ji, 2015. "Single-server parallel-machine scheduling with loading and unloading times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 201-213, August.
    • Handle: RePEc:spr:jcomop:v:30:y:2015:i:2:d:10.1007_s10878-014-9727-z
    DOI: 10.1007/s10878-014-9727-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9727-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-014-9727-z?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.

    References listed on IDEAS

    as
    1. Chunjie Su, 2013. "Online LPT algorithms for parallel machines scheduling with a single server," Journal of Combinatorial Optimization, Springer, vol. 26(3), pages 480-488, October.
    2. Tharma Ganesharajah & Nicholas Hall & Chelliah Sriskandarajah, 1998. "Design and operational issues in AGV-served manufacturing systems," Annals of Operations Research, Springer, vol. 76(0), pages 109-154, January.
    3. Brucker, Peter & Knust, Sigrid & Wang, Guoqing, 2005. "Complexity results for flow-shop problems with a single server," European Journal of Operational Research, Elsevier, vol. 165(2), pages 398-407, September.
    4. Guoqing Wang & T C Edwin Cheng, 2001. "An approximation algorithm for parallel machine scheduling with a common server," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(2), pages 234-237, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Dalila B. M. M. Fontes & S. Mahdi Homayouni & Mauricio G. C. Resende, 2022. "Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1284-1322, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. David Füßler & Stefan Fedtke & Nils Boysen, 2019. "The cafeteria problem: order sequencing and picker routing in on-the-line picking systems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 727-756, September.
    2. Haiyan Wang & Chung‐Yee Lee, 2005. "Production and transport logistics scheduling with two transport mode choices," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 796-809, December.
    3. Jun-Ho Lee & Hyun-Jung Kim, 2021. "A heuristic algorithm for identical parallel machine scheduling: splitting jobs, sequence-dependent setup times, and limited setup operators," Flexible Services and Manufacturing Journal, Springer, vol. 33(4), pages 992-1026, December.
    4. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.
    5. Chang, Yung-Chia & Lee, Chung-Yee, 2004. "Machine scheduling with job delivery coordination," European Journal of Operational Research, Elsevier, vol. 158(2), pages 470-487, October.
    6. Asef-Vaziri, Ardavan & Kazemi, Morteza & Eshghi, Kourosh & Lahmar, Maher, 2010. "An ant colony system for enhanced loop-based aisle-network design," European Journal of Operational Research, Elsevier, vol. 207(1), pages 110-120, November.
    7. Giuseppe Fragapane & Dmitry Ivanov & Mirco Peron & Fabio Sgarbossa & Jan Ola Strandhagen, 2022. "Increasing flexibility and productivity in Industry 4.0 production networks with autonomous mobile robots and smart intralogistics," Annals of Operations Research, Springer, vol. 308(1), pages 125-143, January.
    8. Bojovic, Nebojsa J., 2002. "A general system theory approach to rail freight car fleet sizing," European Journal of Operational Research, Elsevier, vol. 136(1), pages 136-172, January.
    9. Amogh Bhosekar & Sandra Ekşioğlu & Tuğçe Işık & Robert Allen, 2023. "A discrete event simulation model for coordinating inventory management and material handling in hospitals," Annals of Operations Research, Springer, vol. 320(2), pages 603-630, January.
    10. Caricato, Pierpaolo & Ghiani, Gianpaolo & Grieco, Antonio & Musmanno, Roberto, 2007. "Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design," European Journal of Operational Research, Elsevier, vol. 178(1), pages 85-91, April.
    11. Asef-Vaziri, Ardavan & Laporte, Gilbert & Ortiz, Robert, 2007. "Exact and heuristic procedures for the material handling circular flow path design problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 707-726, January.
    12. Hichem Kamoun & Nicholas G. Hall & Chelliah Sriskandarajah, 1999. "Scheduling in Robotic Cells: Heuristics and Cell Design," Operations Research, INFORMS, vol. 47(6), pages 821-835, December.
    13. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    14. Abdelhak Elidrissi & Rachid Benmansour & Nicolas Zufferey & Mohammed Benbrahim & David Duvivier, 2024. "Minimization of maximum lateness on parallel machines with a single server and job release dates," 4OR, Springer, vol. 22(3), pages 351-385, September.
    15. Aziez, Imadeddine & Côté, Jean-François & Coelho, Leandro C., 2022. "Fleet sizing and routing of healthcare automated guided vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    16. Carlier, Jacques & Haouari, Mohamed & Kharbeche, Mohamed & Moukrim, Aziz, 2010. "An optimization-based heuristic for the robotic cell problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 636-645, May.
    17. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    18. Caumond, A. & Lacomme, P. & Moukrim, A. & Tchernev, N., 2009. "An MILP for scheduling problems in an FMS with one vehicle," European Journal of Operational Research, Elsevier, vol. 199(3), pages 706-722, December.
    19. Mengshi Lu & Zhihao Chen & Siqian Shen, 2018. "Optimizing the Profitability and Quality of Service in Carshare Systems Under Demand Uncertainty," Manufacturing & Service Operations Management, INFORMS, vol. 20(2), pages 162-180, May.
    20. Asef-Vaziri, Ardavan & Laporte, Gilbert, 2005. "Loop based facility planning and material handling," European Journal of Operational Research, Elsevier, vol. 164(1), pages 1-11, July.

    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:spr:jcomop:v:30:y:2015:i:2:d:10.1007_s10878-014-9727-z. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.