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

Note on the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks

Author

Listed:
  • Hidri, Lotfi

Abstract

In this note the Hybrid Flowshop Scheduling Problem with Multiprocessor Tasks is addressed. The objective function to be minimized is the maximum completion time or the makespan. The main purpose of this note is to pinpoint an inaccuracy contained in a recent paper while developing a lower bound (Chou: IJPE, 141:137–145 ) and to propose some valid lower bounds.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:proeco:v:182:y:2016:i:c:p:531-534
    DOI: 10.1016/j.ijpe.2016.10.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527316302572
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2016.10.001?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. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.
    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.
    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. Zhi Li & Ray Y. Zhong & Ali Vatankhah Barenji & J. J. Liu & C. X. Yu & George Q. Huang, 2021. "Bi-objective hybrid flow shop scheduling with common due date," Operational Research, Springer, vol. 21(2), pages 1153-1178, June.
    2. 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.

    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. Gerstl, Enrique & Mosheiov, Gur, 2013. "A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines," International Journal of Production Economics, Elsevier, vol. 146(1), pages 161-166.
    2. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    3. 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.
    4. Weiya Zhong & Yun Shi, 2018. "Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 108-125, January.
    5. Pan, Quan-Ke & Gao, Liang & Li, Xin-Yu & Gao, Kai-Zhou, 2017. "Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 303(C), pages 89-112.
    6. A. G. Leeftink & R. J. Boucherie & E. W. Hans & M. A. M. Verdaasdonk & I. M. H. Vliegen & P. J. Diest, 2018. "Batch scheduling in the histopathology laboratory," Flexible Services and Manufacturing Journal, Springer, vol. 30(1), pages 171-197, June.
    7. 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.
    8. Jin Xu & Natarajan Gautam, 2020. "On competitive analysis for polling systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(6), pages 404-419, September.
    9. Perez-Gonzalez, Paz & Framinan, Jose M., 2024. "A review and classification on distributed permutation flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 312(1), pages 1-21.
    10. Alexis Robbes & Yannick Kergosien & Virginie André & Jean-Charles Billaut, 2022. "Efficient heuristics to minimize the total tardiness of chemotherapy drug production and delivery," Flexible Services and Manufacturing Journal, Springer, vol. 34(3), pages 785-820, September.
    11. Fátima Pilar & Eliana Costa e Silva & Ana Borges, 2023. "Optimizing Vehicle Repairs Scheduling Using Mixed Integer Linear Programming: A Case Study in the Portuguese Automobile Sector," Mathematics, MDPI, vol. 11(11), pages 1-23, June.
    12. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1353-1374, December.
    13. Billaut, Jean-Charles & Della Croce, Federico & Grosso, Andrea, 2015. "A single machine scheduling problem with two-dimensional vector packing constraints," European Journal of Operational Research, Elsevier, vol. 243(1), pages 75-81.
    14. Weiwei Wang & Biao Zhang & Baoxian Jia, 2023. "A Multiobjective Optimization Approach for Multiobjective Hybrid Flowshop Green Scheduling with Consistent Sublots," Sustainability, MDPI, vol. 15(3), pages 1-29, February.
    15. Alfaro-Fernández, Pedro & Ruiz, Rubén & Pagnozzi, Federico & Stützle, Thomas, 2020. "Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems," European Journal of Operational Research, Elsevier, vol. 282(3), pages 835-845.
    16. S. M. Mousavi & I. Mahdavi & J. Rezaeian & M. Zandieh, 2018. "An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times," Operational Research, Springer, vol. 18(1), pages 123-158, April.
    17. An, Xiangxin & Si, Guojin & Xia, Tangbin & Wang, Dong & Pan, Ershun & Xi, Lifeng, 2023. "An energy-efficient collaborative strategy of maintenance planning and production scheduling for serial-parallel systems under time-of-use tariffs," Applied Energy, Elsevier, vol. 336(C).
    18. Dayong Han & Qiuhua Tang & Zikai Zhang & Zixiang Li, 2020. "An Improved Migrating Birds Optimization Algorithm for a Hybrid Flow Shop Scheduling within Steel Plants," Mathematics, MDPI, vol. 8(10), pages 1-28, September.
    19. Fan Yang & Roel Leus, 2021. "Scheduling hybrid flow shops with time windows," Journal of Heuristics, Springer, vol. 27(1), pages 133-158, April.
    20. Ruipu Dong & Jinghua Li & Dening Song & Boxin Yang & Lei Zhou, 2024. "A Multi-Objective Non-Dominated Sorting Gravitational Search Algorithm for Assembly Flow-Shop Scheduling of Marine Prefabricated Cabins," Mathematics, MDPI, vol. 12(14), pages 1-32, 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:eee:proeco:v:182:y:2016:i:c:p:531-534. 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.