Journal of Intelligent Manufacturing

, Volume 14, Issue 3–4, pp 323–339 | Cite as

Finding multiple solutions in job shop scheduling by niching genetic algorithms

  • E. Pérez
  • F. Herrera
  • C. Hernández
Article

Abstract

The interest in multimodal optimization methods is increasing in the last years. The objective is to find multiple solutions that allow the expert to choose the solution that better adapts to the actual conditions. Niching methods extend genetic algorithms to domains that require the identification of multiple solutions. There are different niching genetic algorithms: sharing, clearing, crowding and sequential, etc. The aim of this study is to study the applicability and the behavior of several niching genetic algorithms in solving job shop scheduling problems, by establishing a criterion in the use of different methods according to the needs of the expert. We will experiment with different instances of this problem, analyzing the behavior of the algorithms from the efficacy and diversity points of view.

Job shop scheduling problem multimodal optimization genetic algorithms niching methods 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, J., Balas, E. and Zawack, D. (1988) The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391-401.Google Scholar
  2. Balas, E. (1969) Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Operations Research, 17, 941-957.Google Scholar
  3. Baker, J. R. and McMahon, G. B. (1985) Scheduling the general job shop. Management Science, 31, 594-598.Google Scholar
  4. Beasley, D., Bull, D. R. and Martin, R. R. (1993) A sequential niche technique for multimodal function optimization. Evolutionary Computation, 1, 101-125.Google Scholar
  5. Brucker, P. (1997) Scheduling Algorithms, 2nd Edn, Springer-Verlag, Berlin, Germany.Google Scholar
  6. Bruns, R. (1993) Direct chromosome representation and advanced genetic operators for production scheduling. Proceedings of the Fifth International Conference on Genetic Algorithms, Stephanie Forrest (ed.), Kaufmann, San Mateo, California, USA, pp. 352-359.Google Scholar
  7. Carlier, J. and Pinson, E. (1989) An algorithm for solving the job shop problem. Management Science, 35, 164-176.Google Scholar
  8. Cedeño, W., Vemuri, V. R. and Slezak, T. (1995) Multiniche crowding in genetic algorithms and its application to the assembly of DNA restriction-fragments. Evolutionary Computation, 2, 321-345.Google Scholar
  9. Conway, R. W., Maxwell, W. L. and Miller, L. W. (1967) Theory of Scheduling, Addison-Wesley, Massachusetts, USA.Google Scholar
  10. Dell'Amico, M. and Trubian, M. (1993) Applying Tabu search to the job shop scheduling problem. Annals of Operations Research, 41, 231-252.Google Scholar
  11. Della, F., Tadeis, R. and Volta, G. (1995) A genetic algorithm for the job shop problem. Computers and Operations Research, 22, 15-24.Google Scholar
  12. Fang, H., Ross, P. and Corne, D. (1993) A promising genetic algorithm aproach to job shop scheduling, rescheduling, and open shop scheduling problems, in Proceedings of the Fifth International Conference on Genetic Algorithms, Stephanie Forrest (ed.), Kaufmann, San Mateo, California, USA, pp. 375-382.Google Scholar
  13. Fogel, D. B. (ed.) (1998) Evolutionary Computation, The Fossil Record (Selected readings on the history of evolutionary computation), IEEE Press, NY, USA.Google Scholar
  14. French, S. (1982) Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop, Ellis Horwood, Chichester, USA.Google Scholar
  15. Garey, M. and Johnson, D. (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, NY, USA.Google Scholar
  16. Glover, F. and Laguna, M. (1997) Tabu Search, Kluwer Academic, Boston, USA.Google Scholar
  17. Goldberg, D. E. and Richardson, J. (1987) Genetic algorithms with sharing for multimodal function optimization, in Proceedings of the Second International Conference on Genetic Algorithms, pp. 41-49.Google Scholar
  18. Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Massachusetts, USA.Google Scholar
  19. Greenberg, H. (1968) A branch and bound solution to the general scheduling problem. Operations Research, 16, 353-361.Google Scholar
  20. Harik, G. (1995) Finding multiple solutions using restricted tournament selection, in Proceedings of the Sixth International Conference on Genetic Algorithms, Eschelman, L. (ed.), Kaufmann, USA, pp. 24-31.Google Scholar
  21. Kirkpatrick, S., Gelatt, C. D. Jr. and Vecchi, M. P. (1983) Optimization by simulated annealing. Science, 220, 671-680.Google Scholar
  22. Kobayashi, S., Ono, I. and Yamamura, M. (1995) An efficient genetic algorithm for job shop scheduling problems, in Proceedings of the Sixth International Conference on Genetic Algorithms, Eschelman, L. (ed.), Kaufmann, San Francisco, California, USA, pp. 506-511.Google Scholar
  23. Mahfoud, S. W. (1992) Crowding and preselection revisited. Parallel Problem Solving from Nature II, Männer, R. and Manderick, B. (eds), Elsevier, pp. 27-36.Google Scholar
  24. Mattfeld, D. C. (1995) Evolutionary Search and the Job Shop, Investigations on Genetic Algorithms for Production Scheduling, Springer, Berlin, Germany.Google Scholar
  25. McMahon, G. and Florian, M. (1975) On scheduling with ready times and due date to minimize maximum lateness. Operations Research, 23, 475-482.Google Scholar
  26. Michalewicz, Z. (1995) Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, Germany.Google Scholar
  27. Nakano, R. and Yamada, T. (1991) Conventional genetic algorithms for job shop problems, in Proceedings of the Fourth International Conference on Genetic Algorithms, Belew, R. and Booker, L. B. (co-ed.), Kaufmann, San Mateo, California, USA, pp. 474-479.Google Scholar
  28. Nowicki, E. and Smutnicki, C. (1996) A fast tabu search algorithm for the job shop problem. Management Science, 42, 797-813.Google Scholar
  29. Oei, C. K., Goldberg, D. E. and Chang, S. J. (1991) Tournament selection, niching and the preservation of diversity. IlliGAL Report No. 91011, University of Illinois, USA.Google Scholar
  30. Panwalkar, S. S. and Iskander, W. (1977) A survey of scheduling rules. Operations Research, 25, 45-61.Google Scholar
  31. P\'etrowski, A. (1996) Clearing procedure as a niching method for genetic algorithms, in Proc. 1996 IEEE Int. Conf. Evolutionary Computation, Nagoya, Japan, pp. 798-803.Google Scholar
  32. Ramalhinho, H., Marti, O. and Stützle, T. (2000) Iterated local search. Economic Working Papers Series, Universitat Pompeu Fabra (To appear in the Metaheuritics book, Glover, F. and Kochenberger, G. eds.).Google Scholar
  33. Sareni, B. and Krahenbuhl, L. (1998) Fitness sharing and niching methods revised. IEEE Transations on Evolutionary Computation, 2, 97-106.Google Scholar
  34. Stützle, T. (1998) Local Search Algorithms for Combinatorial Problems\3-Analysis, Improvements, and New Applications, PhD. thesis, Computer Science Departmentm Darmstadt University of Technology, Darmstadt, Germany.Google Scholar
  35. Van Laarhoven, P. J. M., Aarts, E. H. L. and Lenstra, J. K. (1992) Job shop scheduling by simulated annealing. Operations Research, 40, 112-129.Google Scholar
  36. Wang, L. and Zheng, D.-Z. (2001) An effective hybrid optimization strategy for job-shop scheduling problems. Computers & Operations Research, 28, 585-596.Google Scholar
  37. Yamada, T. and Nakano, R. (1992) A genetic algorithm applicable to large-scale job shop problems. Parallel Problem Solving from Nature II, Männer, R. and Manderick, B. (eds.), Elsevier Science, Amsterdam, The Netherlands, pp. 281-290.Google Scholar
  38. Yang, S. and Wang, D. (2000) Constraint satisfaction adaptive neural network and heuristics combined approach for generalized job-shop scheduling. IEEE Trans. on Neural Networks 11, pp. 474-486.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • E. Pérez
    • 1
  • F. Herrera
    • 2
  • C. Hernández
    • 1
  1. 1.Industrial Engineering Group, School of Industrial EngineeringUniversity of ValladolidValladolidSpain
  2. 2.Department of Computer Science and Artificial IntelligenceUniversity of GranadaGranadaSpain

Personalised recommendations