Cyclic Two Machine Flow Shop with Disjoint Sequence-Dependent Setups
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.
- 2.Bożejko, W.: Parallel algorithms of discrete optimization in manufacturing. Academic Publishing House EXIT (2018)Google Scholar
- 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