Genetic algorithm for the factory scheduling problems with parallel machines

37th International Conference on Computers and Industrial Engineering 2007

Volumn 3, Issue , 2007, Pages 2138-2149

  Ghedjati, Fatima ^a  

^a IUT de Troyes   (France)

Author keywords

Generalized Job shop; Genetic algorithm; Hybrid flow shop; Parallel machines; Process routings; Scheduling

Indexed keywords

FLOW-SHOPS; INDUSTRIAL SIZE; JOB-SHOP; PARALLEL MACHINE; PARALLEL MACHINES SCHEDULING PROBLEM; RESOLUTION METHODS; ROUTINGS; SCHEDULING PROBLEM;

GENETIC ALGORITHMS; INDUSTRIAL ENGINEERING; SCHEDULING;

PROBLEM SOLVING;

EID: 84886018795     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (38)

1. Aarts, E. H. L., Van Laarhoven, P. J. M., (1987), "Simulated Annealing : Theory and Application", D. Reided Publishing Company, Dodrecht, Holland.
2. Bagchi, S., Uckun, S., Miyabe, Y., Kawamura, K., (1991), "Exploring problem-specific recombination operators for job-shop scheduling", Peoceedings of the Fourth International Conference on Genetic Algorithms and their Applications, pp. 10-17.
3. Baker, K. R., (1974), "Introduction to Sequencing and Scheduling", John Wiley and Sons, New-York. Balas, E., (1969), "Machine sequencing via disjunctive graphs: an implicit enumeration algorithm", Operation Research, Vol. 17, N 6.
4. Barker, K. R., McMahon, G. B., (1985), "Scheduling the general job-shop", Man. Sci., Vol. 31, pp. 594-598.
5. Besbes, W., Loukil, T., Teghem, J., (2006), "Using Genetic Algorithm in the Multiprocessor Flow Shop to Minimize the Makespan", International Conference on Systems and Service Management, pp. 1228-1233.
6. Blazewicz, J., Ecker, K. H., Schmidt, G., Weglarz, J., (1994), "Scheduling in Computer and Manufacturing Systems", Second, Revised Edition, Springer-Verlag.
7. Blum, C., Samples, M., (2004), "An Ant Colony Optimization Algorithm for Shop Scheduling Problems", Journal of Mathematical Modelling and Algorithms, Vol. 3, pp. 285-308.
8. Carlier, J., Néron, E., (2000), "An exact method for solving the multi-processor flow-shop"; RAIRO Rech. Opér., Vol. 34, N 1, pp. 1-25.
9. Carlier, J., Pinson, E., (1989), " An Algorithm for solving the job-shop problem", Man. Sci., Vol. 35, pp. 164-176.
10. Darmoul, S., Pierreval, H., Hajri Gabouj, S., (2006), "Scheduling Using Artificial Immune System Metaphors: A Review", International Conference on Systems and Service Management, pp. 1150-1155.
11. Davis, L., (1991), "Job shop scheduling with genetic algorithms", Proceedings of the First International Conference on Genetic Algorithms and their Applications, pp. 136-140.
12. Engin, O., Döyen, A., (2004), "A new approach to solve hybrid flow shop scheduling problems by artificial immune system", Future Generation Computer Systems, Vol. 20, pp. 1083-1095.
13. Garey, M. R., Johnson, D. S., (1979), "Computer and Interactability: A guide to the Theory of NPcompleteness", Freeman and Co.
14. Ghedjati, F., (1999), "Genetic Algorithm for the Job-shop Scheduling Problem with unrelated parallel machines and precedence constraints: heuristic mixing method", Computers & Industrial Engineering, Vol. 37, pp. 39-42.
15. Ghedjati, F., Pomerol, J.-C., (2000a), "Résolution par des heuristiques dynamiques du problème d'ordonnancement job-shop avec machines en parallèle et contraintes de précédence", Journal Européen des Systèmes Automatisés, Vol. 34, N 5, 623-645.
16. Ghedjati, F., Pomerol, J.-C., (2000b), "Amélioration des solutions heuristiques du problème d'ordonnancement de type job-shop généralisé par les algorithmes géné tiques", Actes de FRANCORO II, pp. 135-148.
17. Glover, F., (1987), "Tabu Search Methods in Artificial Intelligence and Operations Research", ORSA, Artificial Intelligence Newletter, Vol. 1, N 2.
18. Goldberg, D. E., (1989), "Genetic Algorithm in Search, Optimisation and Machine Learning", Addison-Wesley Publishing Company, Inc.
19. Graham, R. L., Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., (1979), "Optimisation and Approximation in deterministic sequencing and scheduling: A survey", Annals of Discrete Mathematics, Vol. 5, pp. 287-326.
20. Gupta, J. N. D., (1988), "Two Stage Hybrid Flow-shop Scheduling Problem", Journal of Operational Research Society, Vol. 39, N 4, pp. 359-364.
21. Hoogeveen, J. A., Lenstra, J. K., Veltman, B., (1996), "Preemptive Scheduling in a two-stage multiprocessor flow-shop is NP-hard", EJOR, Vol. 89, pp. 172-175.
22. Hopfield, J., Tank, J., (1985), "Neural Computation of Decisions in Optimisation Problems", Biological Cybernetics, Vol. 52, pp. 141-152.
23. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., (1982), "Recent Developments in deterministic sequencing and scheduling: A survey", In M. A. H. Dempster, J. K. Lenstra, and A. H. G. Rinnoy Kan, editors, Deterministic and stochastic scheduling, pp. 35-73, Dordrecht, The Netherlands, 1982.
24. NATO Advanced Study and Research Institute, D. Reidel Publishing Company. Linn, R., Zhang, W., (1999), "Hybrid flow-shop scheduling: A survey", Computers and Industrial Engineering, Vol. 37, pp. 57-61.
25. McMahon, G., Florian, M., (1975), "On scheduling with ready times due dates to minimize maximum lateness", Opns., Vol. 23, pp. 475-482.
26. Muth, J. F., Thompson, G. L., (1963), "Industrial Scheduling", Prentice-Hall, Englewood Cliffs, NJ.
27. Néron, E., Baptis, P., Gupta, J. N. P, (2001), "Solving hybrid flow shop problem using energetic reasoning and global operations", Omega, Vol. 29, pp. 501-511.
28. Ogüz, C., Ercan, M. F., (2005), "A genetic Algorithm for hybrid flow-shop scheduling with multiprocessor tasks", Journal of scheduling, Vol. 8, N 4, pp. 323-351.
29. Pinson, E, (1988), "Le problème de job-shop", PHD Thesis, Université Pierre and Marie Curie, juin.
30. Portmann, M.-C., Vignier, A., Dardilhac, D., Dezalay, D., (1998), "Branch and bound crossed with GA to solve hybrid flowshops", European Journal of Operational Research, Vol. 107, pp. 389-400.
31. Rinnooy Kan, A. H. G., (1976), "Machine Scheduling Problems: classification, complexity and computation", Nijhoff, The Hague.
32. Ruiz, R., Maroto, C., (2006), "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility", European Journal of Operational Research, Vol. 169, N 3, pp. 781-800.
33. Starkweather, T., McDaniel, S., Mathias, K., Whitley, D., (1991), "A comparison of genetic sequencing operators", Proceeding of the Fourth International Conference on Genetic Algorithms and their Applications, pp. 69-76.
34. Syswerda, G., (1989), "Uniform Crossover in Genetic Algorithms", Proceedings of the Third International Conference on Genetic Algorithms and their Applications, pp. 2-9.
35. Uchun, S., Bagchi, S., Kawamura, K., (1993), "Managing genetic search in job-shop scheduling", IEEE Expert, Vol. 8, N 5, pp. 15-24.
36. Van de Velde, S. L., (1991), "Machine scheduling and lagrangien relaxation", Doctoral thesis, CWI, Amsterdam.
37. Van de Velde, S. L., (1993), "Duality-based algorithms for scheduling unrelated parallel machines", ORSA Journal on Computing, Vol. 5, N 2, pp. 192-205.
38. Vignier, A., Billaut, J.-C., Proust, C., (1999), "Hybrid flow shop scheduling problems: State of the art", Rairo-Recherche Operationnelle-Operations Research, Vol. 33, N 2, pp. 117-183.