Formulation and solution of the drum-buffer-rope constraint scheduling problem ( DBRCSP)

Simultaneous versus sequential scheduling of multiple resources which constrain system throughput

“…Other authors have discussed the heuristic nature of the Goldratt approach to constraint identi® cation (Luebbe andFinch 1992, Plenert 1993). However, with the exception of Simons et al (1996) and Simons and Simpson (1997), we are aware of no research on the DBR approach to the case of multiple constraints.…”

“…Since it builds schedules only for constraint resources, the GS 1.0 algorithm allows time for non-constraint operations by building in time lags referred to as batch rods and time rods (Simons et al 1996, Simons andSimpson 1997). Batch rods are time lags inserted into a schedule to permit time for non-constraint operations which must occur between visits of the same job to the same constraint resource for di erent operations.…”

“…The multiple constraint scheduling problem was formulated in Simons et al (1996). In Simons and Simpson (1997), we described how the GS (version 1.0) algorithm solves this problem.…”

“…In Simons et al (1996), the authors described the multiple constraint scheduling problem, generated a set of test problems, and evaluated the quality of GS schedules with respect to two tardiness measures. In Simons and Simpson (1997), the authors described the GS scheduling algorithm in detail and compared its logic to that of alternative scheduling methods.…”

Study on constraint scheduling algorithm for job shop problems with multiple constraint machines

“…Simons et al (1996) constructed a formulation for the DBR constraint scheduling problem (DBRCSP). A goal system (GS) method (GS1.0) was proposed to solve it (Simons et al, 1996, Simons andSimpson 1997). In this method, the constraint machines are scheduled sequentially.…”