Metaheuristics for group shop scheduling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2439, Issue , 2002, Pages 631-640

  Sampels, Michael ^a   Blum, Christian ^a   Mastrolilli, Monaldo ^b   Rossi Doria, Olivia ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA   (Switzerland)

^c EDINBURGH NAPIER UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; PROBLEM ORIENTED LANGUAGES; PROGRAM COMPILERS; SCHEDULING; SIMULATED ANNEALING; TABU SEARCH;

COMPLETION TIME; GROUP SHOPS; ITERATED LOCAL SEARCH; JOB SHOP; META HEURISTICS; META-HEURISTIC APPROACH; OPEN SHOP SCHEDULING PROBLEM; SEARCH SPACES;

JOB SHOP SCHEDULING;

EID: 9544242862     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45712-7_61     Document Type: Conference Paper

References (18)

1. E. H. L. Aarts and J. K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley & Sons, Chichester, 1997.
2. J. Błażewicz, W. Domschke, and E. Pesch. The job shop scheduling problem: Conventional and new solution techniques. European Journal of Operational Research, 93:1-33, 1996.
3. C. Blum. ACO applied to Group Shop Scheduling: A case study on Intensification and Diversification. In Proceedings of the 3rd International Workshop on Ant Algorithms (ANTS 2002) (to appear), 2002. Also available as technical report TR/IRIDIA/2002-08, IRIDIA, Université Libre de Bruxelles.
4. C. Blum, A. Roli, and M. Dorigo. HC-ACO: The hyper-cube framework for Ant Colony Optimization. In Proceedings of the 4th Meta-heuristics International Conference (MIC 2001), volume 2, pages 399-403, 2001.
5. C. Blum and M. Sampels. Ant colony optimization for FOP shop scheduling: A case study on different pheromone representations. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC 2002), volume 2, pages 1558-1563, 2002.
6. P. Brucker, B. Jurisch, and B. Sievers. A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49:107-127, 1994.
7. J. Carlier and E. Pinson. An algorithm for solving the job-shop problem. Management Science, pages 164-176, 1989.
8. M. Dorigo and G. Di Caro. The Ant Colony Optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization. McGraw-Hill, 1999.
9. H. Fisher and G. L. Thompson. Probabilistic learning combinations of local jobshop scheduling rules. In J. F. Muth and G. L. Thompson, editors, Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ, 1963.
10. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, Boston et al., 1998.
11. T. Gonzalez and S. Sahni. Open shop scheduling to minimize finish time. Journal of the ACM, 23(4):665-679, Oct. 1976.
12. J. K. Lenstra, A. H. G. Rinnooy Kan, and P. Brucker. Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1:343-362, 1977.
13. E. Nowicki and C. Smutnicki. A fast taboo search algorithm for the job shop problem. Management Science, 42(6):797-813, June 1996.
14. M. Sampels, C. Blum, M. Mastrolilli, and O. Rossi-Doria. Metaheuristics for Group Shop scheduling. Technical Report TR/IRIDIA/2002-07, IRIDIA, Université Libre de Bruxelles, 2002.
15. T. Stützle. Local Search Algorithms for Combinatorial Problems-Analysis, Improvements, and New Applications. PhD thesis, TU Darmstadt, Germany, 1998.
16. E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operational Research, 64:278-285, 1993.
17. S. P. Wright. Adjusted p-values and simultaneous inference. Biometrics, 48:1005-1013, 1992.
18. http://www.win.tue.nl/whizzkids/1997.