@article{RO_1999__33_2_209_0, author = {Sotskov, Yuri N. and Tautenhahn, Thomas and Werner, Frank}, title = {On the application of insertion techniques for job shop problems with setup times}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {209--245}, publisher = {EDP-Sciences}, volume = {33}, number = {2}, year = {1999}, mrnumber = {1717025}, zbl = {0960.90040}, language = {en}, url = {http://archive.numdam.org/item/RO_1999__33_2_209_0/} }
TY - JOUR AU - Sotskov, Yuri N. AU - Tautenhahn, Thomas AU - Werner, Frank TI - On the application of insertion techniques for job shop problems with setup times JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 1999 SP - 209 EP - 245 VL - 33 IS - 2 PB - EDP-Sciences UR - http://archive.numdam.org/item/RO_1999__33_2_209_0/ LA - en ID - RO_1999__33_2_209_0 ER -
%0 Journal Article %A Sotskov, Yuri N. %A Tautenhahn, Thomas %A Werner, Frank %T On the application of insertion techniques for job shop problems with setup times %J RAIRO - Operations Research - Recherche Opérationnelle %D 1999 %P 209-245 %V 33 %N 2 %I EDP-Sciences %U http://archive.numdam.org/item/RO_1999__33_2_209_0/ %G en %F RO_1999__33_2_209_0
Sotskov, Yuri N.; Tautenhahn, Thomas; Werner, Frank. On the application of insertion techniques for job shop problems with setup times. RAIRO - Operations Research - Recherche Opérationnelle, Tome 33 (1999) no. 2, pp. 209-245. http://archive.numdam.org/item/RO_1999__33_2_209_0/
1. The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Sci., 1988, 34, p.391-401. | MR | Zbl
, and ,2. The Complexity of One-Machine Batching Problems, Discrete Appl. Math., 1993, 47, p. 87-107. | MR | Zbl
and ,3. Combining Petrov's Heuristic and the CDS Heuristic in Group Scheduling problems, Computers Ind. Engng., 1990, 19, p. 457-461.
,4. A Computational Study of The Job-Shop Scheduling Problem, ORSA J. Computing, 1991, 3, p. 149-156. | Zbl
and ,5. Scheduling The Production of Components at a Common Facility, IEE Transactions, 1988, 20, p. 32-35.
,6. A State-of-the-Art Survey of Manufacturing Job Shop Operations, International Journal of Production Research, 1982, 20, p. 27-45.
, and ,7. Constructive Heuristic Algorithms for the Open Shop Problem, Computing, 1993, 51, p. 95-110. | Zbl
, and ,8. A Branch and Bound Algorithm for the Job-Shop Problem, Discrete Appl Math., 1994, 49, p. 107-127. | MR | Zbl
and ,9. A Branch and Bound Method for the General-Shop Problem with Sequence-Dependent Setup-Times, OR Spektrum, 1996 (to appear). | MR | Zbl
and ,10. An Algorithm for Solving the Job-Shop Problem, Management Sci., 1989, 35, p. 164-176. | MR | Zbl
and ,11. Batching to Minimize Flow Times on One Machine, Management Sci., 1987, 33, p. 784-799. | Zbl
, and ,12. One Machine Processor Scheduling with Symmetric Earliness and Tardiness Penalties, Mathematics of Operations Research, 1988, 13, p. 330-348. | MR | Zbl
and ,13. Single Facility Scheduling with Multiple Job Classes, European J. Oper. Res., 1988, 33, p. 42-45. | Zbl
,14. Heuristics in Job Shop Scheduling, Management Sci., 1996, 13, p. 167-190.
,15. Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Annals Discr. Math., 1979, 5, p. 287-326. | MR | Zbl
, and , ,16. A Survey of Scheduling Rules, Operations Research, 1989, 25, p. 45-61. | MR
,17. A Mixed Dispatching Rule Approach in FMS Scheduling, International J. Flexible Manufacturing Systems, 1994, p. 69-87.
and ,18. Two-Machine Shop Scheduling Problems with Batch Processing, Math. Comput. Modelling, 1993, 17, p. 55-63. | MR | Zbl
,19. Batching Decisions: Structure and Models, European J. Oper. Res., 1994, 75, p. 243-263.
, and ,20. Job Shop Scheduling by Simulated Annealing, Operations Res., 1992, 40, p. 113-125. | MR | Zbl
and ,21. Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, 1977, 1, p. 343-362 | MR | Zbl
, and ,22. Adressing the Gap in Scheduling Research: A Review of Optimization and Heuristic Methods in Production Research, International J. Production Research, 1993, 31, p. 59-79.
and ,23. On the Complexity of Scheduling with Batch Setup Times, Operations Research, 1989, 37, p. 788-803. | MR | Zbl
, ,24. Industrial Scheduling, Prentice Hall, Englewood Cliffs, NJ, 1963.
and ,25. One-Pass Batching Algorithms for the One-Machine Problem, Discrete Appl. Math., 1988, 21, p. 133-145. | MR | Zbl
and ,26. A Heuristic Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem, OMEGA, 1983, 11, p. 91-95.
, and ,27. A Fast Taboo Search Algorithm for the Job Shop Problem, TU Wroclav, Preprint 8/93, 1993. | Zbl
and ,28. The Single Machine Early/Tardy Problem, Management Sci., 1989, 5, p. 177-191. | MR | Zbl
and ,29. Machine Learning by Schedule Decomposition, University of Limburg, 1993.
,30. A Survey of Scheduling Rules, Operations Res., 1977, 25, p. 25-61. | MR | Zbl
and ,31. Batching in Single Operation Manufacturing Systems, Operations Research Letters, 1985, 4, p. 99-103. | Zbl
and ,32. Heuristics for Permutation Flow Shop Scheduling with Batch Setup Times, OR Spektrum, 1996, 18, p. 67-80. | Zbl
, and ,33. Benchmarks for Basic Scheduling Problems, European J. Oper, Res., 1993, 64, p. 278-285. | Zbl
,34. A Simulated Annealing Approach to Scheduling a Manufacturing Cell, Naval Res. Log. Quart., 1990, 37, p. 559-577. | MR | Zbl
and ,35. Integrating Scheduling with Batching and Lot Sizing: A Review of Algorithms and Complexity, Journal. Oper. Res. Soc., 1992, 43, p. 395-406. | MR | Zbl
and ,36. Scheduling Groups of Jobs on a Single Machine, Operations Research, 1995, 4, p. 692-703. | MR | Zbl
and ,37. Insertion Techniques for the Heuristic Solution of the Job Shop Problem, Discrete Appl. Math., 1995, 58, p. 191-211. | MR | Zbl
and ,