Abstract
The job-shop scheduling problem is one of hardest problem (NP-complete problem). In lots of cases, the combination of goals and resources has exponentially increasing search space, the generation of consistently good scheduling is particularly difficult because we have very large combinatorial search space and precedence constraints between operations. So this paper shows the cooperation of two methods for the solving of job shop scheduling problems; Genetic Algorithms (GAs) and Constraint Logic Programming (CLP). CLP is a concept based on Operational Research (OR) and Artificial Intelligence (AI). It tends to rid itself of their drawbacks and to regroup their advantages. The GAs are searching algorithms based on the mechanics of natural selection, they employ a probabilistic search for locating the globally optimal solution. That starts with a population of randomly generated chromosomes, but the difficulty resides in the creation of initial population. This paper explains how to use the CLP to generate a first population and we apply the (GAs) to provide a job shop scheduling minimizing a makespan (Cmax) of the jobs.
Chapter PDF
Similar content being viewed by others
Keywords
References
Boronad-Thierry C. (1993) Planification et ordonnancement multi-site: une approche par satisfaction de contraintes, Thèse de doctorat, Université Paul SABATIER, Toulouse.
Carlier, J and Chretienne, P. (1988) Problèmes d’ordonnancement: Modélisation/complexité/algorithmes. Masson, Paris
Esquirol, P., Lopez, P. (1995) Programmation logique avec contraintes et ordonnancement: Automatique-Productique-Informatique Industrielle, Hermès, Vol. 29, n°4–5, pp 379–407.
Fron A. (1994) Programmation par contraintes, Addison-Wesley.
Goldberg, D. E. (1989) Genetic algorithms in search, optimization, and machine learning. Addison-wesley.
Hammadi, S.Castelin, E. Borne, P. (1991) Efficient and feasible job-shop scheduling in flexible manufacturing systems: IMACS international symposium, Toulouse, France, March 13–15.
LLIA (1991) La programmation par contraintes, LLIA, n°73, July-august.
Mesghouni, K. Hammadi, S. Borne, P (1996). Production job-shop scheduling using Genetic Algorithms. proceedings of IEEE /SMC Conference, Beijing, China, Vol 2, October 14–17,. 1519–1524.
Mesghouni, K. Hammadi, S. Borne, P (1997), Parallel Genetic Operators For flexible Job-Shop Scheduling, to appear in 1 s International Conference on Engineering Design And Automation, Bangkok, Thailand, March 18–21.
Michalewicz, Z. (1992) Genetic Algorithms + Data Structures = Evolution programs: Springer Verlag.
Syswerda, G. (1990) Schedule optimization using genetic algorithm: in handbook of genetic algorithm (ed. Van Nostrand Reinhold), New-York.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Mesghouni, K., Pesin, P., Hammadi, S., Tahon, C., Borne, P. (1997). Genetic Algorithms — Constraint Logic Programming. Hybrid Method for Job Shop Scheduling. In: Camarinha-Matos, L.M. (eds) Re-engineering for Sustainable Industrial Production. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35086-8_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-35086-8_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-6385-0
Online ISBN: 978-0-387-35086-8
eBook Packages: Springer Book Archive