Advanced search techniques for the job shop problem : a comparison

R. Tadei; F. Della Croce; G. Menga

RAIRO - Operations Research - Recherche Opérationnelle (1995)

  • Volume: 29, Issue: 2, page 179-194
  • ISSN: 0399-0559

How to cite

top

Tadei, R., Della Croce, F., and Menga, G.. "Advanced search techniques for the job shop problem : a comparison." RAIRO - Operations Research - Recherche Opérationnelle 29.2 (1995): 179-194. <http://eudml.org/doc/105103>.

@article{Tadei1995,
author = {Tadei, R., Della Croce, F., Menga, G.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {tabu search; heuristic search techniques; random oriented local search techniques; Lagrangian relaxation},
language = {eng},
number = {2},
pages = {179-194},
publisher = {EDP-Sciences},
title = {Advanced search techniques for the job shop problem : a comparison},
url = {http://eudml.org/doc/105103},
volume = {29},
year = {1995},
}

TY - JOUR
AU - Tadei, R.
AU - Della Croce, F.
AU - Menga, G.
TI - Advanced search techniques for the job shop problem : a comparison
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1995
PB - EDP-Sciences
VL - 29
IS - 2
SP - 179
EP - 194
LA - eng
KW - tabu search; heuristic search techniques; random oriented local search techniques; Lagrangian relaxation
UR - http://eudml.org/doc/105103
ER -

References

top
  1. 1. J. ADAMS, E. BALAS and D. ZAWACK, The shifting bottleneck procedure for job shop scheduling, Management Science, 1988, 34, pp. 391-401. Zbl0637.90051MR938771
  2. 2. J. CARLIER, The one-machine sequencing problem, European Journal of Operational Research, 1982, 11, pp. 42-47. Zbl0482.90045MR671798
  3. 3. C. CHU, A Branch-And-Bound algorithm to minimize Total Tardiness with Different Release Dates, Naval Research Logistics, 1992, 39, pp. 265-283. Zbl0762.90035MR1178859
  4. 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. Zbl0784.90034
  5. 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. Zbl0816.90081
  6. 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. Zbl0771.90056
  7. 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. 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. 9. M. R. GAREY and D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, SanFrancisco, 1979. Zbl0411.68039MR519066
  10. 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. Zbl0671.90033MR942622
  11. 11. F. GLOVER, Tabu Search, Part I, Orsa Journal on Computing, 1989, 1, 3, pp. 190-206. Zbl0753.90054
  12. 12. F. GLOVER, Tabu Search, Part II, Orsa Journal on Computing, 1990, 2, 1, pp. 4-32. Zbl0771.90084
  13. 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. 14. S. LAWRENCE, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques, GSIA Carnegie Mellon University, 1984. 
  15. 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. Zbl0769.90050
  16. 16. M. MINOUX, Mathematical Programming: Theory and Algorithms, Wiley & Sons, 1986. Zbl0602.90090MR868279
  17. 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. 18. T. E. MORTON and D. W. PENTICO, Heuristic Scheduling Systems, Wiley & Sons, 1993. 
  19. 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. 20. E. NOWICKI and C. SMUTNICKI, A fast Taboo Search algorithm for the Job Shop Problem, Internal Report, Polytechnic Institute of Wroclaw, Poland, 1993. Zbl0880.90079
  21. 21. S. S. PANWALKER and W. ISKANDER, A Survey of scheduling rules, Operations Research, 1977, 25, pp. 45-61. Zbl0369.90054MR443969
  22. 22. D. A. PIERRE and M. J. LOWE, Mathematical Programming via Augmented Lagrangians, Addison-Wesley, 1975. Zbl0347.90048
  23. 23. B. ROY and B. SUSSMANN, Les Problèmes d'Ordonnancement avec Constraintes disjonctives, Note DS n. 9 bis, 1964, SEMA, Montrouge. 
  24. 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. Zbl0751.90039MR1152731
  25. 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. Zbl0833.90073

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.