Advanced search techniques for the job shop problem : a comparison
RAIRO - Operations Research - Recherche Opérationnelle, Volume 29 (1995) no. 2, p. 179-194
@article{RO_1995__29_2_179_0,
     author = {Tadei, R. and Della Croce, F. and Menga, G.},
     title = {Advanced search techniques for the job shop problem : a comparison},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     publisher = {EDP-Sciences},
     volume = {29},
     number = {2},
     year = {1995},
     pages = {179-194},
     zbl = {0831.90076},
     mrnumber = {1337888},
     language = {en},
     url = {http://www.numdam.org/item/RO_1995__29_2_179_0}
}
Tadei, R.; Della Croce, F.; Menga, G. Advanced search techniques for the job shop problem : a comparison. RAIRO - Operations Research - Recherche Opérationnelle, Volume 29 (1995) no. 2, pp. 179-194. http://www.numdam.org/item/RO_1995__29_2_179_0/

1. J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science, 1988, 34, pp. 391-401. | MR 938771 | Zbl 0637.90051

2. J. Carlier, The one-machine sequencing problem, European Journal of Operational Research, 1982, 11, pp. 42-47. | MR 671798 | Zbl 0482.90045

3. C. Chu, A Branch-And-Bound algorithm to minimize Total Tardiness with Different Release Dates, Naval Research Logistics, 1992, 39, pp. 265-283. | MR 1178859 | Zbl 0762.90035

4. F. Della Croce, G. Menga, R. Tadei, M. Cavalotto and L. Petri, Cellular control of manufacturing Systems, European Journal of Operational Research, 1993, 69, pp. 498-509. | Zbl 0784.90034

5. F. Della Croce, R. Tadei and G. Volta, A genetic algorithm for the job shop problem, to appear on Computers and Operations Research, 1994, 8. | Zbl 0816.90081

6. M. Dell'Amico and M. Trubian, Applying tabu search to the job shop scheduling problem, Annals of Operations Research, 1993, 41, pp. 231-252. | Zbl 0771.90056

7. E. Falkenauer and S. Bouffoix, A Genetic Algorithm for Job Shop, Proceedings of the 1991 IEEE International Conference on Robotics and Automation, 1991, pp. 824-829.

8. T. D. Fry, R. D. Armstrong and J. H Blackstone, Minimizing Weighted Absolute Deviation in Single Machine Scheduling, IIE Transactions, 1987, 4, vol. 19, pp. 445-450.

9. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, SanFrancisco, 1979. | MR 519066 | Zbl 0411.68039

10. M. R. Garey, R. E. Tarjan and G. T. Wilfgong, One-processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Operations Research, 1988, 13, pp. 330-348. | MR 942622 | Zbl 0671.90033

11. F. Glover, Tabu Search, Part I, Orsa Journal on Computing, 1989, 1, 3, pp. 190-206. | Zbl 0753.90054

12. F. Glover, Tabu Search, Part II, Orsa Journal on Computing, 1990, 2, 1, pp. 4-32. | Zbl 0771.90084

13. D. J. Horromt, P. B Luh and K. R. Pattipati, A practical approach to job shop scheduling problems, IEEE Transactions on Robotics and Automation, 1993, 1, vol 9, pp. 1-13.

14. S. Lawrence, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, GSIA Carnegie Mellon University, 1984.

15. S. R. Lawrence and T. E. Morton, Resource-constrained Multi-project Scheduling with Tardy Costs: Comparing Myopic, Bottleneck and Resource Pricing heuristics, European Journal of Operational Research, 1993, 2, vol. 64, pp. 168-187. | Zbl 0769.90050

16. M. Minoux, Mathematical Programming: Theory and Algorithms, Wiley & Sons, 1986. | MR 868279 | Zbl 0602.90090

17. T. E. Morton, S. Kekre, S. R. Lawrence and S. Rajagopalan, SCHED-STAR: A Price Based Shop Scheduling Module, Journal of Manufacturing and Operations Management, 1988, 1, pp. 131-181.

18. T. E. Morton and D. W. Pentico, Heuristic Scheduling Systems, Wiley & Sons, 1993.

19. R. Nakano and T. Yamada, Conventional Genetic Algorithm for Job Shop Problems, Proceedings of the 4th International Conference on Genetic Algorithms, San Diego, California, July 13-16, 1991, pp. 474-479.

20. E. Nowicki and C. Smutnicki, A fast Taboo Search algorithm for the Job Shop Problem, Internal Report, Polytechnic Institute of Wroclaw, Poland, 1993. | Zbl 0880.90079

21. S. S. Panwalker and W. Iskander, A Survey of scheduling rules, Operations Research, 1977, 25, pp. 45-61. | MR 443969 | Zbl 0369.90054

22. D. A. Pierre and M. J. Lowe, Mathematical Programming via Augmented Lagrangians, Addison-Wesley, 1975. | Zbl 0347.90048

23. B. Roy and B. Sussmann, Les Problèmes d'Ordonnancement avec Constraintes disjonctives, Note DS n. 9 bis, 1964, SEMA, Montrouge.

24. P. J. M. Van Laarhoven, E. H. L. Aarts and J. K. Lenstra, Job Shop Scheduling by Simulated Annealing, Operations Research, 1992, 40, pp.113-125. | MR 1152731 | Zbl 0751.90039

25. F. Werner and A. Winkler, Insertion Techniques for the heuristic solution of the Job Shop Problem, Internal Report, Technical University Otto von Guericke, Magdeburg, Germany, 1992. | Zbl 0833.90073