Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Mathematical Programming Solver, http://www.gurobi.com/.
- 2.
A Mathematical Programming Language, https://ampl.com/.
- 3.
Calculations have been carried out using resources provided by Wroclaw Centre for Networking and Supercomputing (http://wcss.pl), grant No. 096.
References
Bożejko, W.: Solving the flow shop problem by parallel programming. J. Parallel Distrib. Comput. 69(5), 470–481 (2009)
Bożejko, W.: Parallel algorithms of discrete optimization in manufacturing. Academic Publishing House EXIT (2018)
Bożejko, W., Uchroński, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158–166 (2015)
Bożejko, W., Uchroński, M., Wodecki, M.: Parallel metaheuristics for the cyclic flow shop scheduling problem. Comput. Ind. Eng. 95, 156–163 (2016)
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)
Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Reading (1989)
Gupta, J.N.: A search algorithm for the generalized flowshop scheduling problem. Comput. Oper. Res. 2(2), 83–90 (1975)
Gupta, J.N., Darrow, W.P.: The two-machine sequence dependent flowshop scheduling problem. Eur. J. Oper. Res. 24(3), 439–446 (1986)
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)
Ruiz, R., Maroto, C.: A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165(2), 479–494 (2005)
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)
Taillard, E.: Some efficient heuristic methods for the flow shop sequencing problem. Eur. J. Oper. Res. 47(1), 65–74 (1990)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Bożejko, W., Smutnicki, C., Uchroński, M., Wodecki, M. (2020). Cyclic Two Machine Flow Shop with Disjoint Sequence-Dependent Setups. In: Bożejko, W., Bocewicz, G. (eds) Modelling and Performance Analysis of Cyclic Systems. Studies in Systems, Decision and Control, vol 241. Springer, Cham. https://doi.org/10.1007/978-3-030-27652-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-27652-2_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27651-5
Online ISBN: 978-3-030-27652-2
eBook Packages: EngineeringEngineering (R0)