Cyclic Two Machine Flow Shop with Disjoint Sequence-Dependent Setups

  • Wojciech BożejkoEmail author
  • Czesław Smutnicki
  • Mariusz Uchroński
  • Mieczysław Wodecki
Part of the Studies in Systems, Decision and Control book series (SSDC, volume 241)


The chapter considers the problem of cyclical jobs scheduling on two machines with resource constraints often encountered in practice, and concerning a number of teams that can perform setups of machines between jobs performed. We are considering a fundamental and most restrictive case with only one setup team. This limitation significantly impedes the considered issue because the solution is represented here not only by the order of performing jobs, but also by the route of the setup team, i.e. the order in which the team makes setups of machines.


  1. 1.
    Bożejko, W.: Solving the flow shop problem by parallel programming. J. Parallel Distrib. Comput. 69(5), 470–481 (2009)CrossRefGoogle Scholar
  2. 2.
    Bożejko, W.: Parallel algorithms of discrete optimization in manufacturing. Academic Publishing House EXIT (2018)Google Scholar
  3. 3.
    Bożejko, W., Uchroński, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158–166 (2015)CrossRefGoogle Scholar
  4. 4.
    Bożejko, W., Uchroński, M., Wodecki, M.: Parallel metaheuristics for the cyclic flow shop scheduling problem. Comput. Ind. Eng. 95, 156–163 (2016)CrossRefGoogle Scholar
  5. 5.
    Corwin, B.D., Esogbue, A.O.: Two machine flow shop scheduling problems with sequence dependent setup times: a dynamic programming approach. Nav. Res. Logist. Q. 21(3), 515–524 (1974)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Reading (1989)CrossRefGoogle Scholar
  7. 7.
    Gupta, J.N.: A search algorithm for the generalized flowshop scheduling problem. Comput. Oper. Res. 2(2), 83–90 (1975)CrossRefGoogle Scholar
  8. 8.
    Gupta, J.N., Darrow, W.P.: The two-machine sequence dependent flowshop scheduling problem. Eur. J. Oper. Res. 24(3), 439–446 (1986)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. In: Proceedings of the 1961 16th ACM National Meeting, ACM ’61, pp. 71.201–71.204. ACM, New York (1961)Google Scholar
  10. 10.
    Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165(2), 479–494 (2005)CrossRefGoogle Scholar
  11. 11.
    Ruiz, R., Stützle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187(3), 1143–1159 (2008)CrossRefGoogle Scholar
  12. 12.
    Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. 47(1), 65–74 (1990)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Department of Control Systems and Mechatronics, Faculty of ElectronicsWrocław University of Science and TechnologyWrocławPoland
  2. 2.Department of Computer Engineering, Faculty of ElectronicsWrocław University of Science and TechnologyWrocławPoland
  3. 3.Department of Telecommunications and Teleinformatics, Faculty of ElectronicsWrocław University of Science and TechnologyWrocławPoland

Personalised recommendations