IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v201y2018icp26-40.html
   My bibliography  Save this article

Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks

Author

Listed:
  • Wu, Lingxiao
  • Wang, Shuaian

Abstract

This paper studies a special parallel machine scheduling problem where some tasks require more than one machine to process, known as the Parallel Machine Scheduling Problem with Multi-processor Tasks. Two mathematical models and several theoretical properties are proposed for the studied problem. To solve this problem, this paper develops an exact branch and bound algorithm and a heuristic tabu search algorithm. A series of numerical experiments are conducted to test the performance of these solution methods. The computational results show that the solution methods are effective and efficient in solving the problem with different sizes.

Suggested Citation

  • Wu, Lingxiao & Wang, Shuaian, 2018. "Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks," International Journal of Production Economics, Elsevier, vol. 201(C), pages 26-40.
    • Handle: RePEc:eee:proeco:v:201:y:2018:i:c:p:26-40
    DOI: 10.1016/j.ijpe.2018.04.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527318301683
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2018.04.013?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. Hidri, Lotfi, 2016. "Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks," International Journal of Production Economics, Elsevier, vol. 182(C), pages 531-534.
    2. Chou, Fuh-Der, 2013. "Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks," International Journal of Production Economics, Elsevier, vol. 141(1), pages 137-145.
    3. Türkoğulları, Yavuz B. & Taşkın, Z. Caner & Aras, Necati & Altınel, İ. Kuban, 2014. "Optimal berth allocation and time-invariant quay crane assignment in container terminals," European Journal of Operational Research, Elsevier, vol. 235(1), pages 88-101.
    4. Jianer Chen & Chung‐Yee Lee, 1999. "General multiprocessor task scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 57-74, February.
    5. Errol L. Lloyd, 1981. "Concurrent Task Systems," Operations Research, INFORMS, vol. 29(1), pages 189-201, February.
    6. Blazewicz, Jacek & Dell'Olmo, Paolo & Drozdowski, Maciej & Maczka, Przemyslaw, 2003. "Scheduling multiprocessor tasks on parallel processors with limited availability," European Journal of Operational Research, Elsevier, vol. 149(2), pages 377-389, September.
    7. Mensendiek, Arne & Gupta, Jatinder N.D. & Herrmann, Jan, 2015. "Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness," European Journal of Operational Research, Elsevier, vol. 243(2), pages 514-522.
    8. Webster, S. T., 1996. "A general lower bound for the makespan problem," European Journal of Operational Research, Elsevier, vol. 89(3), pages 516-524, March.
    9. Franca, Paulo M. & Gendreau, Michel & Laporte, Gilbert & Muller, Felipe M., 1996. "A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times," International Journal of Production Economics, Elsevier, vol. 43(2-3), pages 79-89, June.
    10. Chung-Yee Lee & Lei Lei & Michael Pinedo, 1997. "Current trends in deterministic scheduling," Annals of Operations Research, Springer, vol. 70(0), pages 1-41, April.
    11. Drozdowski, Maciej, 1996. "Scheduling multiprocessor tasks -- An overview," European Journal of Operational Research, Elsevier, vol. 94(2), pages 215-230, October.
    12. Solimanpur, Maghsud & Elmi, Atabak, 2013. "A tabu search approach for cell scheduling problem with makespan criterion," International Journal of Production Economics, Elsevier, vol. 141(2), pages 639-645.
    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. Wu, Lingxiao & Yang, Dong & Wang, Shuaian & Yuan, Yun, 2020. "Evacuating offshore working barges from a land reclamation site in storm emergencies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 137(C).
    2. Farbod Farhadi & Sina Ansari & Francisco Jara-Moroni, 2023. "Optimization models for patient and technician scheduling in hemodialysis centers," Health Care Management Science, Springer, vol. 26(3), pages 558-582, September.
    3. Huber, Jakob & Stuckenschmidt, Heiner, 2021. "Intraday shelf replenishment decision support for perishable goods," International Journal of Production Economics, Elsevier, vol. 231(C).

    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. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2021. "Scheduling Human-Robot Teams in collaborative working cells," International Journal of Production Economics, Elsevier, vol. 235(C).
    2. Oguz, C. & Fikret Ercan, M. & Edwin Cheng, T. C. & Fung, Y. F., 2003. "Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop," European Journal of Operational Research, Elsevier, vol. 149(2), pages 390-403, September.
    3. Oguz, Ceyda & Zinder, Yakov & Ha Do, Van & Janiak, Adam & Lichtenstein, Maciej, 2004. "Hybrid flow-shop scheduling problems with multiprocessor task systems," European Journal of Operational Research, Elsevier, vol. 152(1), pages 115-131, January.
    4. F Sivrikaya şerifoğlu & G Ulusoy, 2004. "Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(5), pages 504-512, May.
    5. Liao, Lu-Wen & Sheen, Gwo-Ji, 2008. "Parallel machine scheduling with machine availability and eligibility constraints," European Journal of Operational Research, Elsevier, vol. 184(2), pages 458-467, January.
    6. Keqin Li, 1999. "Analysis of the List Scheduling Algorithm for Precedence Constrained Parallel Tasks," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 73-88, July.
    7. Dolgui, Alexandre & Kovalev, Sergey & Kovalyov, Mikhail Y. & Malyutin, Sergey & Soukhal, Ameur, 2018. "Optimal workforce assignment to operations of a paced assembly line," European Journal of Operational Research, Elsevier, vol. 264(1), pages 200-211.
    8. Jingui Huang & Jianer Chen & Songqiao Chen & Jianxin Wang, 2007. "A simple linear time approximation algorithm for multi-processor job scheduling on four processors," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 33-45, January.
    9. Levitin, Gregory & Xie, Min & Zhang, Tieling, 2007. "Reliability of fault-tolerant systems with parallel task processing," European Journal of Operational Research, Elsevier, vol. 177(1), pages 420-430, February.
    10. Sun, Zeyi & Li, Lin & Bego, Andres & Dababneh, Fadwa, 2015. "Customer-side electricity load management for sustainable manufacturing systems utilizing combined heat and power generation system," International Journal of Production Economics, Elsevier, vol. 165(C), pages 112-119.
    11. Fatma-Zohra Baatout & Mhand Hifi, 2023. "A two-phase hybrid evolutionary algorithm for solving the bi-objective scheduling multiprocessor tasks on two dedicated processors," Journal of Heuristics, Springer, vol. 29(2), pages 229-267, June.
    12. Iris, Çağatay & Pacino, Dario & Ropke, Stefan & Larsen, Allan, 2015. "Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 75-97.
    13. Zhen, Lu & Zhuge, Dan & Wang, Shuaian & Wang, Kai, 2022. "Integrated berth and yard space allocation under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 1-27.
    14. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.
    15. Wang, Shuaian, 2015. "Optimal sequence of container ships in a string," European Journal of Operational Research, Elsevier, vol. 246(3), pages 850-857.
    16. T.C.E. Cheng & B.M.T. Lin & A. Toker, 2000. "Makespan minimization in the two‐machine flowshop batch scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(2), pages 128-144, March.
    17. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
    18. Xufeng Tang & Chang Liu & Xinqi Li & Ying Ji, 2023. "Distributionally Robust Programming of Berth-Allocation-with-Crane-Allocation Problem with Uncertain Quay-Crane-Handling Efficiency," Sustainability, MDPI, vol. 15(18), pages 1-27, September.
    19. Sung Won Cho & Hyun Ji Park & Chulung Lee, 2021. "An integrated method for berth allocation and quay crane assignment to allow for reassignment of vessels to other terminals," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 23(1), pages 123-153, March.
    20. Huo, Yumei & Zhao, Hairong, 2015. "Total completion time minimization on multiple machines subject to machine availability and makespan constraints," European Journal of Operational Research, Elsevier, vol. 243(2), pages 547-554.

    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:eee:proeco:v:201:y:2018:i:c:p:26-40. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.