A GRASP and branch-and-bound metaheuristic for the job-shop scheduling

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

Volumn 4446 LNCS, Issue , 2007, Pages 60-71

  Fernandes, Susana ^a   Lourenço, Helena R ^b  

^a UNIVERSITY OF ALGARVE   (Portugal)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; PROBLEM SOLVING;

BRANCH-AND-BOUND EXACT METHOD; JOB-SHOP SCHEDULING;

JOB ANALYSIS;

EID: 38049031676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71615-0_6     Document Type: Conference Paper

References (28)

1. Adams, J., E. Balas and D. Zawack (1988). "The Shifting Bottleneck Procedure for Job Shop Scheduling." Management Science, vol. 34(3): pp. 391-401.
2. Aiex, R. M., S. Binato and M. G. C. Resende (2003). "Parallel GRASP with path-relinking for job shop scheduling." Parallel Computing, vol. 29(4): pp. 393-430.
3. Applegate, D. and W. Cook (1991). "A Computational Study of the Job-Shop Scheduling Problem." ORSA Journal on Computing, vol. 3(2): pp. 149-156.
4. Balas, E. and A. Vazacopoulos (1998). "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling." Management Science, vol. 44(2): pp. 262-275.
5. Binato, S., W. J. Hery, D. M. Loewenstern and M. G. C. Resende (2001). "A GRASP for Job Shop Scheduling." In C.C. Ribeiro and P. Hansen, editors, Essays and surveys on metaheuristics, pp. 59-79. Kluwer Academic Publishers.
6. Carlier, J. (1982). "The one-machine sequencing problem." European Journal of Operational Research, vol. 11: pp. 42-47.
7. Caseau, Y. and F. Laburthe (1995), "Disjunctive scheduling with task intervals", Technical Report LIENS, 95-25, Ecole Normale Superieure Paris.
8. Chen, S., S. Talukdar and N. Sadeh (1993). "Job-shop-scheduling by a team of asynchronous agentes", Proceedings of the IJCAI-93 Workshop on Knowledge-Based Production, Scheduling and Control. Chambery France.
9. Danna, E., E. Rothberg and C. L. Pape (2005). "Exploring relaxation induced neighborhoods to improve MIP solutions." Mathematical Programming, Ser. A, vol. 102: pp. 71-90.
10. Dell'Amico, M. and M. Trubian (1993). "Applying Tabu-Search to the Job-Shop Scheduling Problem."
11. Denzinger, J. and T. Offermann (1999). "On Cooperation between Evolutionary Algorithms and other Search Paradigms", Proceedings of the 1999 Congress on Evolutionary Computational.
12. Feo, T. and M. Resende (1995). "Greedy Randomized Adaptive Search Procedures." Journal of Global Optimization, vol. 6: pp. 109-133.
13. Fernandes, S. and H.R. Lourenço (2006), "Optimized Search methods", Working paper, Universitat Pompeu Fabra, Barcelona, Spain.
14. Fisher, H. and G. L. Thompson (1963). Probabilistic learning combinations of local job-shop scheduling rules. In J. F. Muth and G. L. Thompson eds. Industrial Scheduling, pp. 225-251. Prentice Hall, Englewood Cliffs.
15. Garey, M. R. and D. S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, Freeman.
16. Jain, A. S. and S. Meeran (1999). "Deterministic job shop scheduling: Past, present and future." European Journal of Operational Research, vol. 133: pp. 390-434.
17. Lawrence, S. (1984), "Resource Constrained Project Scheduling: an Experimental Investigation of Heuristic Scheduling techniques", Graduate School of Industrial Administration, Carnegie-Mellon University.
18. Lourenço, H. R. (1995). "Job-shop scheduling: Computational study of local search and large-step optimization methods." European Journal of Operational Research, vol. 83: pp. 347-367.
19. Lourenço, H. R. and M. Zwijnenburg (1996). Combining large-step optimization with tabu-search: Application to the job-shop scheduling problem. In I. H. Osman and J. P. Kelly eds. Meta-heuristics: Theory & Applications. Kluwer Academic Publishers.
20. Nowicki, E. and C. Smutnicki (2005). "An Advanced Tabu Search Algorithm for the Job Shop Problem." Journal of Scheduling, vol. 8: pp. 145-159.
21. Nowicki, E. and C. Smutniki (1996). "A Fast Taboo Search Algorithm for the Job Shop Problem." Management Science, vol. 42(6): pp. 797-813.
22. Roy, B. and B. Sussman (1964), "Les probèms d'ordonnancement avec constraintes disjonctives", Note DS 9 bis, SEMA, Paris.
23. Schrage, L. (1970). "Solving resource-constrained network problems by implicit enumeration: Non pre-emptive case." Operations Research, vol. 18: pp. 263-278.
24. Storer, R. H., S. D. Wu and R. Vaccari (1992). "New search spaces for sequencing problems with application to job shop scheduling." Management Science, vol. 38(10): pp. 1495-1509.
25. Taillard, E. D. (1993). "Benchmarks for Basic Scheduling Problems." European Journal of Operational Research, vol. 64(2): pp. 278-285.
26. Taillard, É. D. (1994). "Parallel Taboo Search Techniques for the Job Shop Scheduling Problem." ORSA Journal on Computing, vol. 6(2): pp. 108-117.
27. Tamura, H., A. Hirahara, I. Hatono and M. Umano (1994). "An approximate solution method for combinatorial optimisation." Transactions of the Society of Instrument and Control Engineers, vol. 130: pp. 329-336.
28. Yamada, T. and R. Nakano (1992). A genetic algorithm applicable to large-scale job-shop problems. In R. Manner and B. Manderick eds. Parallel Problem Solving from Nature 2. pp. 281-290. Elsevier Science.