193
Views
3
CrossRef citations to date
0
Altmetric
Original Articles

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

, &
Pages 4785-4801 | Received 01 Mar 2007, Published online: 18 Jul 2008

References

  • Adams , J , Balas , E and Zawack , D . 1988 . The shifting bottleneck procedure for job shop scheduling . Manage. Sci. , 34 : 391 – 401 .
  • Aytug , H , Kempf , K and Uzsoy , R . 2002 . Measures of subproblem criticality in decomposition algorithms for shop scheduling . Int. J. Prod. Res. , 41 : 865 – 882 .
  • Balas , E , Lenstra , JK and Vazacopoulos , A . 1995 . The one machine scheduling with delayed precedence constraints . Manage. Sci. , 41 : 94 – 109 .
  • Brucker , P , Jurisch , B and Sievers , B . 1994 . A branch and bound algorithm for the job-shop scheduling problems . Discrete Appl. Math. , 49 : 107 – 127 .
  • Carlier , J . 1982 . The one-machine sequecing problem . Eur. J. Oper. Res. , 11 : 42 – 47 .
  • Carlier , J and Pinson , E . 1989 . An algorithm for solving the job-shop problem . Manage. Sci. , 35 : 164 – 175 .
  • Dauzere-Peres , S and Lasserre , JB . 1993 . A modified shifting bottleneck procedure for job-shop scheduling . Int. J. Prod. Res. , 31 : 923 – 932 .
  • Demeulemeester , EL and Herroelen , WS . 1996 . Modelling setup times, process batches and transfer batches using activity network logic . Eur. J. Oper. Res. , 89 : 355 – 365 .
  • Demirkol , E , Mehta , S and Uzsoy , R . 1997 . A computational study of shifting bottleneck procedures for shop scheduling problems . J. Heuristic , 3 : 111 – 137 .
  • Glassey , CR and Resende , MGC . 1988 . Closed-loop job release control for VLSI circuit manufacturing . IEEE Trans. Semiconduct. Manuf. , 1 : 36 – 46 .
  • Goldratt , EM and Cox , J . 1984 . The Goal: A Process of Ongoing Improvement , Croton-on-Hudson, NY : North River Press .
  • Goldratt , EM and Fox , RE . 1986 . The Race , Croton-on-Hudson, NY : North River Press .
  • Goldratt , EM . 1990 . Shifting Information Out of the Data Ocean: The Haystack Syndrome , Croton-on-Hudson, NY : North River Press .
  • Ivens , P and Lambrecht , M . 1996 . Extending the shifting bottleneck procedure to real-life applications . Eur. J. Oper. Res. , 90 : 252 – 268 .
  • Mason , SJ and Oey , K . 2003 . Scheduling complex job shops using disjunctive graphs: a cycle elimination procedure . Int. J. Prod. Res. , 41 : 981 – 994 .
  • Mason , SJ , Jin , S and Wessels , CM . 2004 . Rescheduling strategies for minimizing total weighted tardiness in complex job shops . Int. J. Prod. Res. , 42 : 613 – 628 .
  • Ovacik , IM and Uzsoy , R . 1997 . Decomposition Methods for Complex Factory Scheduling Problems , Massachusetts : Kluwer Academic Publishers .
  • Pinedo , M . 1995 . Scheduling: Theory, Algorithms, and Systems , Englewood Cliffs, NJ : Prentice Hall .
  • Pinedo , M and Singer , M . 1999 . A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop . Naval Res. Logi. , 46 : 1 – 17 .
  • Simons Jr , JV , Simpson III , WP , Carlson , BJ , James , SW , Lettiere , CA and Mediate Jr , BA . 1996 . Formulation and solution of the drum-buffer-rope constraint scheduling problem (DBRCSP) . Int. J. Prod. Res. , 34 : 2405 – 2420 .
  • Simons Jr , JV and Simpson III , WP . 1997 . An exposition of multiple constraint scheduling as implemented in the goal system (formerly DISASTER™) . Prod. Oper. Manage. , 6 : 3 – 22 .
  • Simons Jr , JV , Stephens , MD and Simpson III , WP . 1999 . Simultaneous versus sequential scheduling of multiple resources which constrain system throughput . Int. J. Prod. Res. , 37 : 21 – 33 .
  • Spearman , ML . 1997 . On the theory of constraints and the goal system . Prod. Oper. Manage. , 6 : 28 – 33 .
  • Umble , MM and Srikanth , ML . 1990 . Synchronous Manufacturing: Principles for World Class Excellence , Cincinnati, OH : South-Western .
  • Uzsoy , R and Wang , CS . 2000 . Performance of decomposition procedures for job shop scheduling problems with bottleneck machines . Int. J. Prod. Res. , 38 : 1271 – 1286 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.