Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints

Cyclic Scheduling in Robotic Cells: An Extension of Basic Models in Machine Scheduling Theory

“…This case has been shown to be polynomial solvable by several researchers independently via different approaches. Representative work on this can be found in the work by Livshits et al (1974), Matsuo et al (1991), Lei (1993), Ioachim and Soumis (1995), Chen et al (1998), Van de Klundert (1996), Levner et al (1996Levner et al ( , 1997, , Crama et al (2000), Lee (2000), Lei and Liu (2001), , Kats et al (2007).…”

“…8. We give the problem description basing on the model developed in Kats et al (2007). The product (part type) processing time at any machine is not fixed, but defined by a pair of minimum and maximum time limits, called the time window constraints.…”

“…Throughout the remaining analysis of this chapter, we shall denote this problem as Q. Problem Q is a further extension of the scheduling problem P introduced and solved in Kats et al (2007). The problem P is the jobshop scheduling problem where technological operations for each product are linked by simple chain-like precedence relations (see Fig.…”

“…Robotic models Lei (1993), Chen et al (1998), , , Kats et al (2007) Remark. For completeness, we might mention three more groups of robotic (non-cyclic) scheduling problems which might be looked at as "atomic elements" of the cyclic problems: Robotic Non-cyclic Flowshop (Kise (1991), Levner et al (1995aLevner et al ( ,1995b, Kogan and Levner 1998), Robotic Non-cyclic Jobshop (Hurink and Knust (2002)), and Robotic Non-cyclic PERT-shop (Levner et al (1995c)).…”

“…Robotic models Kampmeyer (2006), Kats et al (2007) Models with setups negligible, no-robot Romanovskii (1967), Chretienne (1991), Hanen and Munier (1995) …”