- ARTIGUES , C. and ROUBELLAT , F. Characterisation of a set of schedules in a job shop with sequence-dependent setup times . CESA'96 Proceedings of the IMACS Multiconference, Computational Engineering in Systems Applications, Symposium on Discrete Events and Manufacturing Systems . Lille. pp. 455 – 460 .
- ARTIGUES , C. and ROUBELLAT , F. 2000 . A Polynomial activity insertion algorithm in a multi-resource schedule with cumulative constraints and resource flexibility . European Journal of Operational Research , 127 (2) : 297 – 316 .
- BILLAUT , J. C. and ROUBELLAT , F. 1996 . A New method for workshop real time scheduling . International Journal of Production Research , 34 (6) : 1555 – 1579 .
- BRUCKER , P. and THIELE , O. 1996 . A Branch and bound method for the general shop problem with sequence-dependent setup-times . OR Spektrum , 18 : 145 – 161 .
- DAUZÈRE-PÉRÈS , S. , Roux , W. and LASSERRE , J.B. 1998 . Multi-resource shop scheduling with resource flexibility . European Journal of Operational Research , 107 (2) : 289 – 305 .
- GUPTA , S. K. 1982 . JV Jobs and m machines job-shop problems with sequence-dependent set-up times . International Journal of Production Research , 20 (5) : 643 – 656 .
- KIM , S. C. and BOBROWSKI , P. M. 1994 . Impact of sequencedependent setup time on job shop scheduling performance . International Journal of Production Research , 32 (7) : 1503 – 1520 .
- MEESTER , G. 1996 . Multi-resource shop-floor scheduling , University of Twente . PhD Thesis
- OVACIK , I. M. and UZSOY , R. 1994 . Exploiting shop floor status information to schedule complex job shops . Journal of Manufacturing Systems , 13 : 73 – 84 .
- ROY , B. and SUSSMAN , B. 1964 . Les problèmes d'ordonnancement avec contraintes disjunctives , Note DS No. 9 bis Paris : SEMA .
- SCHUTTEN , M. 1996 . Shop Floor Scheduling with Setup Times , University of Twente . PhD Thesis
- SOTSKOV , Y. N. , TAUTENHAHN , T. and WERNER , F. 1999 . On The Application of insertion techniques for job shop problems with setup times . RAIRO Operations Research , 33 (2) : 209 – 245 .
An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times
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.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.