IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v196y2009i2p450-456.html
   My bibliography  Save this article

The flow shop problem with no-idle constraints: A review and approximation

Author

Listed:
  • Goncharov, Yaroslav
  • Sevastyanov, Sergey

Abstract

The makespan minimization problem in flow shops with no-idle constraints on machines is considered. The latter means that each machine, once started, must process all its operations without intermediate idle time until all those operations are completed. The problem is known to be strongly NP-hard already for three machines. While being based on a geometrical approach, we propose several polynomial time heuristics (for the general case and for special cases of 3 and 4 machines) which provide asymptotically optimal solutions for the increasing number of jobs. A comprehensive review of relevant results is also presented.

Suggested Citation

  • Goncharov, Yaroslav & Sevastyanov, Sergey, 2009. "The flow shop problem with no-idle constraints: A review and approximation," European Journal of Operational Research, Elsevier, vol. 196(2), pages 450-456, July.
  • Handle: RePEc:eee:ejores:v:196:y:2009:i:2:p:450-456
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00340-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Saadani, Nour El Houda & Guinet, Alain & Moalla, Mohamed, 2005. "A travelling salesman approach to solve the F/no-idle/Cmax problem," European Journal of Operational Research, Elsevier, vol. 161(1), pages 11-20, February.
    2. M. R. Garey & D. S. Johnson & Ravi Sethi, 1976. "The Complexity of Flowshop and Jobshop Scheduling," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 117-129, May.
    3. C. A. Glass & J. N. D. Gupta & C. N. Potts, 1999. "Two-Machine No-Wait Flow Shop Scheduling with Missing Operations," Mathematics of Operations Research, INFORMS, vol. 24(4), pages 911-924, November.
    4. Sergey Sevastianov, 1998. "Nonstrict vector summationin multi-operation scheduling," Annals of Operations Research, Springer, vol. 83(0), pages 179-212, October.
    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. Guo-Sheng Liu & Jin-Jin Li & Ying-Si Tang, 2018. "Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(06), pages 1-19, December.
    2. S. S. Panwalkar & Christos Koulamas, 2020. "Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines," Journal of Scheduling, Springer, vol. 23(1), pages 145-154, February.
    3. Bailin Wang & Kai Huang & Tieke Li, 2018. "Two-stage hybrid flowshop scheduling with simultaneous processing machines," Journal of Scheduling, Springer, vol. 21(4), pages 387-411, August.
    4. Tolga Bektaş & Alper Hamzadayı & Rubén Ruiz, 2020. "Benders decomposition for the mixed no-idle permutation flowshop scheduling problem," Journal of Scheduling, Springer, vol. 23(4), pages 513-523, August.
    5. Federico Della Croce & Andrea Grosso & Fabio Salassa, 2021. "Minimizing total completion time in the two-machine no-idle no-wait flow shop problem," Journal of Heuristics, Springer, vol. 27(1), pages 159-173, April.
    6. J.-C. Billaut & F. Della Croce & F. Salassa & V. T’kindt, 2019. "No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths," Journal of Scheduling, Springer, vol. 22(1), pages 59-68, February.

    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. Pan, Quan-Ke & Ruiz, Rubén, 2014. "An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem," Omega, Elsevier, vol. 44(C), pages 41-50.
    2. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    3. 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.
    4. Zhengcai Cao & Lijie Zhou & Biao Hu & Chengran Lin, 2019. "An Adaptive Scheduling Algorithm for Dynamic Jobs for Dealing with the Flexible Job Shop Scheduling Problem," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 61(3), pages 299-309, June.
    5. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    6. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    7. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    8. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    9. P J Kalczynski & J Kamburowski, 2004. "Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1358-1362, December.
    10. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    11. 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.
    12. Jean-Paul Watson & Laura Barbulescu & L. Darrell Whitley & Adele E. Howe, 2002. "Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance," INFORMS Journal on Computing, INFORMS, vol. 14(2), pages 98-123, May.
    13. Paulli, Jan, 1995. "A hierarchical approach for the FMS scheduling problem," European Journal of Operational Research, Elsevier, vol. 86(1), pages 32-42, October.
    14. 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.
    15. Ho, Johnny C., 1995. "Flowshop sequencing with mean flowtime objective," European Journal of Operational Research, Elsevier, vol. 81(3), pages 571-578, March.
    16. 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.
    17. Sheikh, Shaya & Komaki, G.M. & Kayvanfar, Vahid & Teymourian, Ehsan, 2019. "Multi-Stage assembly flow shop with setup time and release time," Operations Research Perspectives, Elsevier, vol. 6(C).
    18. Celia A. Glass & Yakov M. Shafransky & Vitaly A. Strusevich, 2000. "Scheduling for parallel dedicated machines with a single server," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(4), pages 304-328, June.
    19. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
    20. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.

    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:ejores:v:196:y:2009:i:2:p:450-456. 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/eor .

    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.