Local search genetic algorithms for the job shop scheduling problem

Applied Intelligence

Volumn 21, Issue 1, 2004, Pages 99-109

  Ombuki, Beatrice M ^a   Ventresca, Mario ^a  

^a BROCK UNIVERSITY   (Canada)

Author keywords

Combinatorial optimization; Genetic algorithms; Job shop scheduling; Local search; Tabu search

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; SIMULATED ANNEALING;

COMBINATORIAL OPTIMIZATION; JOB SHOP SCHEDULING; LOCAL SEARCH; TABU SEARCH;

SCHEDULING;

EID: 3543085004     PISSN: 0924669X     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:APIN.0000027769.48098.91     Document Type: Article

References (29)

1. M.R. Garey and D.S. Johnson, Computers and Intractability, A Guide to The Theory of NP-Completeness, W.H. Freeman and Company, 1979.
2. S. Binato, W.J. Hery, D.M. Loewenstern, and M.G.C. Resende, "A GRASP for job shop scheduling," in Essays and Surveys on Metaheuristics, edited by C.C. Ribeiro and P. Hansen, Kluwer Academic Publishers, 2002, pp. 58-79.
3. H. Fisher and L. Thompson, "Probabilistic learning combinations of local job-shop scheduling rules," Industrial Scheduling, Prentice Hall: Englewood Cliffs, NJ, 1963.
4. D. Applegate and W. Cook, "A computational study of job shop scheduling problem," ORSA Journal of Computing, vol. 3, pp. 149-156, 1991.
5. P. Bucker, B. Jurisch, and B. Sievers, "A branch and bound algorithm for the job-shop scheduling problem," Discrete Applied Mathematics, vol. 49, pp. 105-127, 1994.
6. J. Carlier and F. Pinson, "An algorithm for solving the job-shop problem," Management Science, vol. 35, no. 2, pp. 164-176, 1989.
7. J. Carlier and F. Pinson, "A practical use of Jackson's preemptive schedule for solving the job-shop scheduling problem," Annals of Operations Research, vol. 26, pp. 269-287, 1990.
8. A.S. Jain and S. Meeran, "Deterministic job shop scheduling: Past, present," Future European Journal of Operation Research, Elsevier Science, vol. 113, pp. 390-434, 1999.
9. S. Bagchi, S. Uckun, Y. Miyage, and K. Kawamura, "Exploring problem specific recombination operators for job shop scheduling," in Proceedings of The Fourth International Conference on Genetic Algorithms, 1991, pp. 10-17.
10. R. Nakano and T. Yamada, "Conventional genetic algorithm for job shop problems," in Proceedings of The Fourth International Conference on Genetic Algorithms, 1991, pp. 474-479.
11. R. Bruns, "Direct chromosome representation and advanced genetic operators for production scheduling," in Proceedings of the Fifth International Conference on Genetic Algorithms, 1993, pp. 352-359.
12. S. Kobayashi, I. Ono, and M. Yamamura, "An efficient genetic algorithm for job shop scheduling problems," in Proceedings of the Sixth International Conference on Genetic Algorithms, 1995, pp. 506-511.
13. L. Davis, "Job shop scheduling with genetic algorithms," in Proceedings of the 1st International Conference on Genetic Algorithms, 1985, pp. 136-140.
14. H. Fang, P. Ross, and D. Corne, "A promising genetic algorithm approach to job-shop scheduling, rescheduling; and open-shop scheduling problems," in Proceedings of the 5th International Conference on Genetic Algoriths, 1993, pp. 375-382.
15. B. Ombuki, M. Nakamura, and K. Onaga, "An evolutionary scheduling scheme based on gkGA approach for the job shop scheduling problem," IEICE Transactions on Fundamentals of Elecronics, Communications and Computer Science, vol. E81-A, no. 6, 1998.
16. T. Yamadaand R. Nukano, "Job-shop scheduling," Genetic Algorithms in Engineering Systems, Chap. 7, IEE control Engineering Series, vol. 55, pp. 134-160, 1997.
17. D.E. Goldenberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
18. C. Bierwirth, D.C. Mattfeld, and H. Kopfer, "On permutation representations for scheduling problems," Parallel Problem Solving from Nature IV, Springer-Verlag, 1996, pp. 310-318.
19. P.J.M. Van Laarhoven, E.H. Aarts, and J.K. Lenstra, "Job shop scheduling by simulated annealing," Operations Research, vol. 40, no. 1, pp. 113-125, 1992.
20. H.R. Lourenco, "Local optimization and the job-shop scheduling problem," European Journal of Operations Research, vol. 83, pp. 347-364, 1995.
21. H.R. Lourenco and M. Zwijnenburg, "Combining the large-step optimization with tabu-search: Application to the job-shop scheduling problem," Meta-Heuristics: Theory and Applications, Kluwer Academic Publishers, 1996, pp. 219-236.
22. E. Nowicki and C. Smutnicki, "A fast taboo search algorithm for the job shop scheduling problem," Management Science, vol. 42, pp. 797-813, 1996.
23. E.D. Taillard, "Parallel taboo search techniques for the job shop scheduling problem," ORSA Journal on Computing, vol. 6, pp. 108-117, 1994.
24. F. Glover, "Tabu search - Part II," ORSA Journal on Computing, vol.2, no. 1, pp. 4-32, 1990.
25. M. Dorigo, V. Maniezzso, and A. Comi, "The ant system: Optimization by a colony of cooperating agents," IEEE Transactions on Systems, Man and Cybematics, Part-B, vol. 26, no. 1, pp. 1-13, 1996.
26. M. Dorigo and G. Di Caro, "The ant colony optimization metaheuristic," IRIDIA Chap. 2, 1996.
27. J. Adams, E. Balas, and Zawack, "The shifting bottleneck procedure for the job shop scheduling," Management Science, vol. 34, pp. 391-401, 1998.
28. R.J.M. Vaessens, E.H.L Aarts, and J.K. Lenstra, "Job shop scheduling by local search," INFORMS Journal on Computing, vol. 8, pp. 302-317, 1996.
29. OR Library, URL http://mscmga.ms.ic.ac.uk.