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

On scheduling multiple parallel two-stage flowshops with Johnson’s Rule

Author

Listed:
  • Guangwei Wu

    (Central South University of Forestry and Technology
    Central South University)

  • Fu Zuo

    (Central South University of Forestry and Technology)

  • Feng Shi

    (Central South University
    Xiangjiang Laboratory)

  • Jianxin Wang

    (Central South University)

Abstract

It is well-known that the classical Johnson’s Rule leads to optimal schedules on a two-stage flowshop. However, it is still unclear how Johnson’s Rule would help in approximation algorithms for scheduling an arbitrary number of parallel two-stage flowshops with the objective of minimizing the makespan. Thus within the paper, we study the problem and propose a new efficient algorithm that incorporates Johnson’s Rule applied on each individual flowshop with a carefully designed job assignment process to flowshops. The algorithm is successfully shown to have a runtime $$O(n \log n)$$ O ( n log n ) and an approximation ratio 7/3, where n is the number of jobs. Compared with the recent PTAS result for the problem (Dong et al. in Eur J Oper Res 218(1):16–24, 2020), our algorithm has a larger approximation ratio, but it is more efficient in practice from the perspective of runtime.

Suggested Citation

  • Guangwei Wu & Fu Zuo & Feng Shi & Jianxin Wang, 2024. "On scheduling multiple parallel two-stage flowshops with Johnson’s Rule," Journal of Combinatorial Optimization, Springer, vol. 47(2), pages 1-20, March.
    • Handle: RePEc:spr:jcomop:v:47:y:2024:i:2:d:10.1007_s10878-024-01107-z
    DOI: 10.1007/s10878-024-01107-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01107-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-024-01107-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. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    2. Dong, Jianming & Jin, Ruyan & Luo, Taibo & Tong, Weitian, 2020. "A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops," European Journal of Operational Research, Elsevier, vol. 281(1), pages 16-24.
    3. Zhang, Xiandong & van de Velde, Steef, 2012. "Approximation algorithms for the parallel flow shop problem," European Journal of Operational Research, Elsevier, vol. 216(3), pages 544-552.
    4. Artiba, A. & Tahon, C., 1992. "Production planning knowledge-based system for pharmaceutical manufacturing lines," European Journal of Operational Research, Elsevier, vol. 61(1-2), pages 18-29, August.
    5. S. M. Johnson, 1954. "Optimal two‐ and three‐stage production schedules with setup times included," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 1(1), pages 61-68, March.
    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. Reyner Pérez-Campdesuñer & Alexander Sánchez-Rodríguez & Margarita De Miguel-Guzmán & Gelmar García-Vidal & Rodobaldo Martínez-Vivar, 2025. "Improving Scheduling Efficiency: A Mathematical Approach to Multi-Operation Optimization in MSMEs," Mathematics, MDPI, vol. 13(9), pages 1-19, April.

    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. Brammer, Janis & Lutz, Bernhard & Neumann, Dirk, 2022. "Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning," European Journal of Operational Research, Elsevier, vol. 299(1), pages 75-86.
    2. 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.
    3. Li, Wei & Nault, Barrie R. & Ye, Honghan, 2019. "Trade-off balancing in scheduling for flow shop production and perioperative processes," European Journal of Operational Research, Elsevier, vol. 273(3), pages 817-830.
    4. Bo Liu & Ling Wang & Ying Liu & Shouyang Wang, 2011. "A unified framework for population-based metaheuristics," Annals of Operations Research, Springer, vol. 186(1), pages 231-262, June.
    5. Mingyang Gong & Guohui Lin & Eiji Miyano & Bing Su & Weitian Tong, 2024. "A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops," Annals of Operations Research, Springer, vol. 335(1), pages 185-204, April.
    6. Humyun Fuad Rahman & Tom Servranckx & Ripon K. Chakrabortty & Mario Vanhoucke & Sondoss El Sawah, 2025. "Synchronizing production and delivery in flow shops with time-of-use electricity pricing," Annals of Operations Research, Springer, vol. 345(1), pages 371-403, February.
    7. S. S. Panwalkar & Christos Koulamas, 2019. "The evolution of schematic representations of flow shop scheduling problems," Journal of Scheduling, Springer, vol. 22(4), pages 379-391, August.
    8. Martín Ravetti & Carlos Riveros & Alexandre Mendes & Mauricio Resende & Panos Pardalos, 2012. "Parallel hybrid heuristics for the permutation flow shop problem," Annals of Operations Research, Springer, vol. 199(1), pages 269-284, October.
    9. Li, Guo & Li, Na & Sambandam, Narayanasamy & Sethi, Suresh P. & Zhang, Faping, 2018. "Flow shop scheduling with jobs arriving at different times," International Journal of Production Economics, Elsevier, vol. 206(C), pages 250-260.
    10. Ruiz, Rubén & Pan, Quan-Ke & Naderi, Bahman, 2019. "Iterated Greedy methods for the distributed permutation flowshop scheduling problem," Omega, Elsevier, vol. 83(C), pages 213-222.
    11. Mehravaran, Yasaman & Logendran, Rasaratnam, 2012. "Non-permutation flowshop scheduling in a supply chain with sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 135(2), pages 953-963.
    12. Wlodzimierz Szwarc & Jatinder N. D. Gupta, 1987. "A flow‐shop problem with sequence‐dependent additive setup times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 619-627, October.
    13. Liqi Zhang & Lingfa Lu & Shisheng Li, 2016. "New results on two-machine flow-shop scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1493-1504, May.
    14. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    15. Vincent T’kindt & Federico Della Croce & Mathieu Liedloff, 2022. "Moderate exponential-time algorithms for scheduling problems," 4OR, Springer, vol. 20(4), pages 533-566, December.
    16. Jerzy Kamburowski, 2003. "On the unknown contribution of Stefan Chanas to the stochastic flow shop analysis," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 13(4), pages 75-83.
    17. Vineet Jain & Tilak Raj, 2018. "An adaptive neuro-fuzzy inference system for makespan estimation of flexible manufacturing system assembly shop: a case study," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(6), pages 1302-1314, December.
    18. Golpîra, Hêriş, 2020. "Smart Energy-Aware Manufacturing Plant Scheduling under Uncertainty: A Risk-Based Multi-Objective Robust Optimization Approach," Energy, Elsevier, vol. 209(C).
    19. Alexander Grigoriev & Martijn Holthuijsen & Joris van de Klundert, 2005. "Basic scheduling problems with raw material constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(6), pages 527-535, September.
    20. Fernandez-Viagas, Victor & Talens, Carla & Prata, Bruno de Athayde, 2025. "A speed-up procedure and new heuristics for the classical job shop scheduling problem: A computational evaluation," European Journal of Operational Research, Elsevier, vol. 322(3), pages 783-794.

    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:47:y:2024:i:2:d:10.1007_s10878-024-01107-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.