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.
@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://www.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://www.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://www.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://www.numdam.org/item/RO_1999__33_2_209_0/

1. J. Adams, E. Balas and D. Zawack, The Shifting Bottleneck Procedure for Job Shop Scheduling, Management Sci., 1988, 34, p.391-401. | MR | Zbl

2. S. Albers and P. Brucker, The Complexity of One-Machine Batching Problems, Discrete Appl. Math., 1993, 47, p. 87-107. | MR | Zbl

3. J. D. Allison, Combining Petrov's Heuristic and the CDS Heuristic in Group Scheduling problems, Computers Ind. Engng., 1990, 19, p. 457-461.

4. D. Applegate and W. Cook, A Computational Study of The Job-Shop Scheduling Problem, ORSA J. Computing, 1991, 3, p. 149-156. | Zbl

5. K. R. Baker, Scheduling The Production of Components at a Common Facility, IEE Transactions, 1988, 20, p. 32-35.

6. J. N. Blackstone, D. T. Philips and C. L. Hogg, A State-of-the-Art Survey of Manufacturing Job Shop Operations, International Journal of Production Research, 1982, 20, p. 27-45.

7. H. Brasel, T. Tautenhahn and F. Werner, Constructive Heuristic Algorithms for the Open Shop Problem, Computing, 1993, 51, p. 95-110. | Zbl

8. P. BruckerB. Jurisch and B. Sievers, A Branch and Bound Algorithm for the Job-Shop Problem, Discrete Appl Math., 1994, 49, p. 107-127. | MR | Zbl

9. P. Brucker and O. Thiele, A Branch and Bound Method for the General-Shop Problem with Sequence-Dependent Setup-Times, OR Spektrum, 1996 (to appear). | MR | Zbl

10. J. Carlier and E. Pinson, An Algorithm for Solving the Job-Shop Problem, Management Sci., 1989, 35, p. 164-176. | MR | Zbl

11. G. Dobson, U. S. Kamarkar and J. L. Rummel, Batching to Minimize Flow Times on One Machine, Management Sci., 1987, 33, p. 784-799. | Zbl

12. M. R. GareyR. Tarjan and G. Wilfong, One Machine Processor Scheduling with Symmetric Earliness and Tardiness Penalties, Mathematics of Operations Research, 1988, 13, p. 330-348. | MR | Zbl

13. J. N. D. Gupta, Single Facility Scheduling with Multiple Job Classes, European J. Oper. Res., 1988, 33, p. 42-45. | Zbl

14. W. S. Gere, Heuristics in Job Shop Scheduling, Management Sci., 1996, 13, p. 167-190.

15. R. E. Graham, E. L. Lawler and J. K. Lenstra, A. H. G. Rinnooy Kan, Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey, Annals Discr. Math., 1979, 5, p. 287-326. | MR | Zbl

16. R. Haupt, A Survey of Scheduling Rules, Operations Research, 1989, 25, p. 45-61. | MR

17. N. Ishii and J. T. Talavage, A Mixed Dispatching Rule Approach in FMS Scheduling, International J. Flexible Manufacturing Systems, 1994, p. 69-87.

18. U. Kleinau, Two-Machine Shop Scheduling Problems with Batch Processing, Math. Comput. Modelling, 1993, 17, p. 55-63. | MR | Zbl

19. R. Kuik, M. Salomon and L. Van Wassenhove, Batching Decisions: Structure and Models, European J. Oper. Res., 1994, 75, p. 243-263.

20. P. J. M. Van LaarhovenE. H. L. Aarts and J. K. Lenstra, Job Shop Scheduling by Simulated Annealing, Operations Res., 1992, 40, p. 113-125. | MR | Zbl

21. J. K. Lenstra, A. H. G. Rinnooy Kan and P. Brucker, Complexity of Machine Scheduling Problems, Annals of Discrete Mathematics, 1977, 1, p. 343-362 | MR | Zbl

22. B. L. Maccarthy and J. Liu, 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.

23. C. L. Monma, C. N. Potts, On the Complexity of Scheduling with Batch Setup Times, Operations Research, 1989, 37, p. 788-803. | MR | Zbl

24. J. F. Muth and G. L. Thompson, Industrial Scheduling, Prentice Hall, Englewood Cliffs, NJ, 1963.

25. N. Naddef and C. Santos, One-Pass Batching Algorithms for the One-Machine Problem, Discrete Appl. Math., 1988, 21, p. 133-145. | MR | Zbl

26. M. Nawaz, E. E. Enscore and I. Ham, A Heuristic Algorithm for the m-Machine, n-Job Flow Shop Sequencing Problem, OMEGA, 1983, 11, p. 91-95.

27. E. Nowicki and C. Smutnicki, A Fast Taboo Search Algorithm for the Job Shop Problem, TU Wroclav, Preprint 8/93, 1993. | Zbl

28. P. S. Ow and T. E. Morton, The Single Machine Early/Tardy Problem, Management Sci., 1989, 5, p. 177-191. | MR | Zbl

29. E. Pesch, Machine Learning by Schedule Decomposition, University of Limburg, 1993.

30. S. S. Panwalkar and W. Iskander, A Survey of Scheduling Rules, Operations Res., 1977, 25, p. 25-61. | MR | Zbl

31. C. Santos and M. Magazine, Batching in Single Operation Manufacturing Systems, Operations Research Letters, 1985, 4, p. 99-103. | Zbl

32. Y. N. Sotskov, T. Tautenhahn and F. Werner, Heuristics for Permutation Flow Shop Scheduling with Batch Setup Times, OR Spektrum, 1996, 18, p. 67-80. | Zbl

33. E. Taillard, Benchmarks for Basic Scheduling Problems, European J. Oper, Res., 1993, 64, p. 278-285. | Zbl

34. A. J. Vakharia and Y.-L. Chang, A Simulated Annealing Approach to Scheduling a Manufacturing Cell, Naval Res. Log. Quart., 1990, 37, p. 559-577. | MR | Zbl

35. L. Van Wassenhove and C. N. Potts, Integrating Scheduling with Batching and Lot Sizing: A Review of Algorithms and Complexity, Journal. Oper. Res. Soc., 1992, 43, p. 395-406. | MR | Zbl

36. S. Webster and K. R. Baker, Scheduling Groups of Jobs on a Single Machine, Operations Research, 1995, 4, p. 692-703. | MR | Zbl

37. F. Werner and A. Winkler, Insertion Techniques for the Heuristic Solution of the Job Shop Problem, Discrete Appl. Math., 1995, 58, p. 191-211. | MR | Zbl