Advertisement

OR Spectrum

, Volume 40, Issue 3, pp 809–829 | Cite as

Flow shop scheduling with flexible processing times

  • Matthias Bultmann
  • Sigrid Knust
  • Stefan Waldherr
Regular Article
  • 209 Downloads

Abstract

In numerous flow shop variants, the processing times of the operations are not fixed in advance, but may be distributed with some flexibility among the machines. In this paper, we introduce a general model which is expressive enough to cover several models from the literature. While in most cases it is \(\mathcal {NP}\)-hard to find a job permutation and a corresponding distribution of processing times minimizing the makespan, we show that for a fixed job permutation a best processing time distribution can be calculated in polynomial time by linear programming. Based on this, we propose a tabu search procedure using the set of all job permutations as search space. In a computational study, we show the power of the new model. Besides the classical permutation flow shop environment, we study variants with blocking, no-wait and synchronous movement constraints.

Keywords

Scheduling Flow shop Flexible processing times Processing time redistribution 

Notes

Acknowledgements

This work was supported by the Deutsche Forschungsgemeinschaft, KN 512/7-1. The work of Stefan Waldherr was supported by the TUM Institute for Advanced Study through a Hans Fischer Senior Fellowship. The authors would like to thank two anonymous referees for their constructive comments.

References

  1. Bolat A (1994) Sequencing jobs on an automobile assembly line: objectives and procedures. Int J Prod Res 32(5):1219–1236CrossRefGoogle Scholar
  2. Burdett RL, Kozan E (2001) Sequencing and scheduling in flowshops with task redistribution. J Oper Res Soc 52(12):1379–1389CrossRefGoogle Scholar
  3. Emmons H, Vairaktarakis G (2012) Flow shop scheduling: theoretical results, algorithms, and applications, vol 182. Springer, New YorkGoogle Scholar
  4. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):117–129CrossRefGoogle Scholar
  5. Gilmore PC, Gomory RE (1964) Sequencing a one state-variable machine: a solvable case of the traveling salesman problem. Oper Res 12(5):655–679CrossRefGoogle Scholar
  6. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5(2):287–326CrossRefGoogle Scholar
  7. Gupta JND, Stafford EF (2006) Flowshop scheduling research after five decades. Eur J Oper Res 169:699–711CrossRefGoogle Scholar
  8. Gupta JND, Koulamas CP, Kyparisis GJ, Potts CN, Strusevich VA (2004) Scheduling three-operation jobs in a two-machine flow shop to minimize makespan. Ann Oper Res 129(1–4):171–185CrossRefGoogle Scholar
  9. Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44(3):510–525CrossRefGoogle Scholar
  10. Huang K-L (2008) Flow shop scheduling with synchronous and asynchronous transportation times. Ph.D. thesis, The Pennsylvania State UniversityGoogle Scholar
  11. Janiak A (1988) General flow-shop scheduling with resource constraints. Int J Prod Res 26(6):1089–1103CrossRefGoogle Scholar
  12. Johnson SM (1954) Optimal two-and three-stage production schedules with setup times included. Nav Res Logist Q 1(1):61–68CrossRefGoogle Scholar
  13. Knust S, Shakhlevich NV, Waldherr S, Weiß C (2017) Shop scheduling problems with pliable jobs. Technical report, University of OsnabrückGoogle Scholar
  14. Kouvelis P, Karabati S (1999) Cyclic scheduling in synchronous production lines. IIE Trans 31(8):709–719Google Scholar
  15. Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the \(m\)-machine, \(n\)-job flow-shop sequencing problem. Omega 11(1):91–95CrossRefGoogle Scholar
  16. Néron E, Tercinet F, Eloudou Biloa A (2000) An exact method for a farming problem. In: Informs conference, San Antonio, Texas (USA)Google Scholar
  17. Nowicki E, Zdrzałka S (1988) A two-machine flow shop scheduling problem with controllable job processing times. Eur J Oper Res 34(2):208–220CrossRefGoogle Scholar
  18. Nowicki E, Zdrzałka S (1990) A survey of results for sequencing problems with controllable processing times. Discrete Appl Math 26(2):271–287CrossRefGoogle Scholar
  19. Röck H (1984) The three-machine no-wait flow shop is NP-complete. J ACM 31(2):336–345CrossRefGoogle Scholar
  20. Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155(13):1643–1666CrossRefGoogle Scholar
  21. Soylu B, Kirca Ö, Azizoğlu M (2007) Flow shop-sequencing problem with synchronous transfers and makespan minimization. Int J Prod Res 45(15):3311–3331CrossRefGoogle Scholar
  22. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278–285CrossRefGoogle Scholar
  23. Waldherr S (2015) Scheduling of flow shops with synchronous movement. Ph.D. thesis, Department of Mathematics and Computer Science, University of OsnabrückGoogle Scholar
  24. Waldherr S, Knust S (2015) Complexity results for flow shop problems with synchronous movement. Eur J Oper Res 242(1):34–44CrossRefGoogle Scholar
  25. Yenisey MM, Yagmahan B (2014) Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends. Omega 45:119–135CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Institute of Computer ScienceUniversity of OsnabrückOsnabrückGermany
  2. 2.Department of InformaticsTechnical University of MunichMunichGermany

Personalised recommendations