Simultaneous versus sequential scheduling of multiple resources which constrain system throughput

Simons, Jacob V.; Stephens, Michael; Simpson, Wendell P.

doi:10.1080/002075499191896

Cited by 7 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this method, the constraint machines are scheduled sequentially. Simons et al (1999) then improved the GS method (GS2.2) by scheduling the multiple constraint machines simultaneously.…”

Section: Introductionmentioning

confidence: 99%

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

Zuo¹,

Gu²,

Xi³

2008

International Journal of Production Research

View full text Add to dashboard Cite

This paper focuses on a job-shop scheduling problem with multiple constraint machines (JSPMC). A constraint scheduling method for the JSPMC is proposed. It divides the machines in the shop into constraint and non-constraint machines based on a new identification method, and formulates a reduced problem only for constraint machines while replacing the operations of non-constraint machines with time lags. The constraint machines are scheduled explicitly by solving the reduced problem with an efficient heuristic, while the non-constraint machines are scheduled by the earliest operation due date (EODD) dispatching rule. Extensive computational results indicate that the proposed constraint scheduling algorithm can obtain a better trade-off between solution quality and computation time compared with various versions of the shifting bottleneck (SB) methods for the JSPMC.

show abstract

“…In this method, the constraint machines are scheduled sequentially. Simons et al (1999) then improved the GS method (GS2.2) by scheduling the multiple constraint machines simultaneously.…”

Section: Introductionmentioning

confidence: 99%