Skip to main content

Advertisement

SpringerLink
Log in

A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

The Flexible Job-Shop Scheduling Problem is concerned with the determination of a sequence of jobs, consisting of many operations, on different machines, satisfying several parallel goals. We introduce a Memetic Algorithm, based on the NSGAII (Non-Dominated Sorting Genetic Algorithm II) acting on two chromosomes, to solve this problem. The algorithm adds, to the genetic stage, a local search procedure (Simulated Annealing). We have assessed its efficiency by running the algorithm on multiple objective instances of the problem. We draw statistics from those runs, which indicate that this Memetic Algorithm yields good and low-cost solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job-shop scheduling. Management Science, 34(3), 391–401.

    Article  Google Scholar 

  • Armentano, V. A., & Scrich, C. R. (2000). Tabu search for minimizing total tardiness in a job-shop. International Journal of Production Economics, 63, 131–140.

    Article  Google Scholar 

  • Binato, S., Hery, W. J., Loewenstern, D. M., & Resende, M. G. C. (2001). A GRASP for job-shop scheduling. In Ribeiro, C. C., & Hansen, P. (Eds.), Essays and surveys in meta-heuristics (pp. 59–80). Boston: Kluwer Academic.

    Google Scholar 

  • Bolat, A., & Yano, C. (1992). Scheduling algorithms to minimize utility work at a single station on paced assembly line. Production Planning and Control, 3(4), 393–405.

    Article  Google Scholar 

  • Cheng, C. C., & Smith, S. F. (1997). Applyng constraint satisfaction techniques to job-shop scheduling. Annals of Operations Research, 70, 327–357.

    Article  Google Scholar 

  • Cheng, R., Gen, M., & Tsujimura, Y. (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms. Part I: representation. Computers and Industrial Engineering, 30(4), 983–997.

    Article  Google Scholar 

  • Coello Coello, C. A., Van Veldhuizen, D. A., & Lamont, G. B. (2002). Evolutionary algorithms for solving multi-objective problems. New York: Kluwer Academic.

    Google Scholar 

  • Cortés Rivera, D., Coello Coello, C. A., & Cortés, N. C. (2003). Use of an artificial immune system for job-shop scheduling. In Lecture notes in computer science: Vol. 2787. Proceeding second international conference on artificial immune systems. (pp. 1–10). Berlin: Springer.

    Google Scholar 

  • Cortés Rivera, D., Coello Coello, C. A., & Cortés, N. C. (2004). Job-shop scheduling using the clonal selection principle. In ACDM’2004, UK.

  • Crawford, J. M., & Baker, A. B. (1994). Experimental results on the application of satisfiability algorithms to scheduling problems. Computational Intelligence Research Laboratory.

  • Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multi-objective genetic algorithm: NSGAII. IEEE Transactions on Evolutionary Computation, 6(2), 182–197.

    Article  Google Scholar 

  • Dawkins, R. (2006). The selfish gene, 3rd edn. Oxford: Oxford University Press.

    Google Scholar 

  • Dowsland, K. A. (1993). In C. R. Reeves (Ed.), Simulated annealing, modern heuristic techniques for combinatorial problems. Oxford: Blackwell Sci..

    Google Scholar 

  • Frutos, M., & Olivera, A. C. (2008). Job shop scheduling problem: desarrollo de un procedimiento eficiente. In Proceeding XIV congreso Latino-Ibero-Americano en investigación de operaciones, Colombia.

  • Frutos, M., & Tohmé, F. (2009). Desarrollo de un procedimiento genético diseñado para programar la producción en un sistema de manufactura tipo job-shop. In Proceeding VI congreso español sobre meta-heurísticas, algoritmos evolutivos y bioinspirados, Málaga.

  • Gelatt, C. D., Kirkpatrick, S., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671–680.

    Article  Google Scholar 

  • Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Readings: Addison-Wesley.

    Google Scholar 

  • Heinonen, J., & Pettersson, F. (2007). Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem. Applied Mathematics and Computation, 187(2), 989–998.

    Article  Google Scholar 

  • Ishibuchi, H., Yoshida, T., & Murata, T. (2003). Balance between genetic search and local search in memetic algorithms for multiobjective permutation flow-shop scheduling. IEEE Transactions on Evolutionary Computation, 7(2), 204–223.

    Article  Google Scholar 

  • Jaszkiewicz, A. (2004). A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm. Annals of Operations Research, 131(14), 135–158.

    Article  Google Scholar 

  • Kacem, I., Hammadi, S., & Borne, P. (2001). Approach by localization and genetic manipulations algorithm for flexible job-shop problems. In Proceedings of the international IEEE conference on systems, man, and cybernetics. Tucson, AZ, USA (pp. 599–2604).

  • Kacem, I., Hammadi, S., & Borne, P. (2002). Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems Man and Cybernetics, 32, 1–13.

    Article  Google Scholar 

  • Larrazábal, M. C. (2003). Configuración de sistemas de producción, optimización basada en simulación. Memoria de Título, Universidad de Concepción, Chile.

  • Merkle, D., & Middendorf, M. (2001). A new approach to solve permutation scheduling problems with ant colony optimization. In Applications of evolutionary computing (Vol. 2037, pp. 484–494), EvoWorkshops 2001, proceedings.

  • Mollaghasemi, M., Le-Croy, K., & Georgiopoulus, M. (1998). Application of neural networks and simulation. Modeling in Manufacturing System Design. Interfaces, 28, 322–326.

    Google Scholar 

  • Papadimitriou, C. H. (1994). Computational complexity. Readings: Addison-Wesley.

    Google Scholar 

  • Park, B. J., Choi, H. R., & Kim, H. S. A. (2003). Hybrid genetic algorithm for the job-shop scheduling problems. Computers and Industrial Engineering, 45(4), 597–613.

    Article  Google Scholar 

  • Pinedo, M. (1995). Scheduling theory, algorithms and systems. New York: Prentice Hall.

    Google Scholar 

  • Sadeh, N. M., & Fox, M. S. (1995). Variable and value ordering heuristics for the job-shop scheduling constraint satisfaction problem. Technical report CMU-RI-TR-95-39. Appear in the Artificial Intelligence Journal.

  • Storer, R. H., Wu, S. D., & Vaccari, R. (1992). New search spaces for sequencing instances with application to job-shop scheduling. Management Science, 38, 1495–1509.

    Article  Google Scholar 

  • Tsai, C. F., & Lin, F. C. (2003). A new hybrid heuristic technique for solving job-shop scheduling problem. In Intelligent data acquisition and advanced computing systems: technology and applications. Second IEEE international workshop.

  • Ullman, J. D. (1975). Np-complete scheduling problems. Journal of Computer System Sciences, 10, 384–393.

    Article  Google Scholar 

  • Wu, C. G., Xing, X.L., Lee, H. P., Zhou, C. G., & Liang, Y. C. (2004). Genetic algorithm application on the job-shop scheduling problem. In Machine learning and cybernetics (Vol. 4, pp. 2102–2106). Proceedings of 2004 international conference.

  • Zalzala, A. M. S., & Flemming, P. J. (1997). Genetic algorithms in engineering systems. London: London Institution of Electrical Engineers.

    Google Scholar 

  • Zitzler, E., Deb, K., Thiele, L., Coello Coello, C. A., & Corne, D. (2001). Evolutionary multi-criterion optimization. Lecture notes in computer science: Vol. 1993. Berlin: Springer.

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Engineering, CONICET, Universidad Nacional del Sur, Av. Alem 1253, Bahía Blanca, B8000CPB, Argentina

    Mariano Frutos

  2. Department of Computer Science & Engineering, CONICET, Universidad Nacional del Sur, Av. Alem 1253, Bahía Blanca, B8000CPB, Argentina

    Ana Carolina Olivera

  3. Department of Economics, CONICET, Universidad Nacional del Sur, 12 de Octubre y San Juan, Bahía Blanca, B8000CPB, Argentina

    Fernando Tohmé

Authors
  1. Mariano Frutos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ana Carolina Olivera
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernando Tohmé
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mariano Frutos.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Frutos, M., Olivera, A.C. & Tohmé, F. A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem. Ann Oper Res 181, 745–765 (2010). https://doi.org/10.1007/s10479-010-0751-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-010-0751-9

Keywords

Search

Navigation