Hybrid genetic algorithm for the flexible job-shop problem under maintenance constraints

Lecture Notes in Computer Science

Volumn 3612, Issue PART III, 2005, Pages 259-268

  Zribi, Nozha ^a   Borne, Pierre ^a  

^a ECOLE CENTRALE DE LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; MAINTENANCE; SCHEDULING;

JOB-SHOP SCHEDULING; MACHINE MAINTENANCE; MAINTENANCE PERIODS; SEARCH PROCEDURE;

GENETIC ALGORITHMS;

EID: 26844532556     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539902_31     Document Type: Conference Paper

References (18)

1. Adiri I., Bruno J., Frostig E., and Rinnooy Kan A. H. G. : Single machine flow-time with a single breakdown. Acta Informatica, 26, 679-696.
2. Aggoune, R.: Ordonnancement d'Ateliers sous Contraintes de Disponibilit des Machines(2002) Ph.D. Thesis, Universit de Metz, France.
3. Blazewicz J., Breit J., Formanowicz P., Kubiak W., Schmidt G.: Heuristic algorithms for the two-machine flowshop problem with limited machine availability. Omega Journal (2001), 29, 599-608.
4. Jurisch B.: Scheduling Jobs in Shops with Multi Purpose Machines (1992) Ph.D Thesis, Universitt Osnabrck.
5. Kubiak W., Blazewicz J., Formanowicz P., Breit J., Schmidt G.: Two-machine flow shops with lim-ited machine availability. European Journal of Opera-tional Research (2002) 136: 528-540.
6. Lee C.Y.: Machine scheduling with an availability constraint. Journal of Global Optimization(1996) 9: 395-416.
7. Glover F., Laguna M.: Tabu search, Kluwer Publish- ers, Boston 1997.
8. Lee C.Y.: Minimizing the mazkespan in two-machine flows-hop scheduling with availability constraint. Operations research letters (1997), 20: 129-139.
9. Lee C.Y.: Two-machine flowshop scheduling with availability constraints. European Journal of Opera-tional Research (1999), 114: 420-429.
10. Lee KM., Yamakawa T.: A Genetic algorithm for general machine scheduling problems. Int.Conf. on Conventional and knowledge-Based Electronics Systems, Vol 2 pp60-66 Australia, 1998.
11. Nowicki E., Smutnicki C.: A Fast Taboo Search Algorithm for the Job-Shop Problem, Management Science (1996), Vol. 42, No. 6, pp. 797-813.
12. Schmidt G.: Scheduling on semi identical processors. Z. Oper.Res. 1984, A28, 153-162. ,
13. Schmidt G.: Scheduling independent tasks with deadlines on semi-identical processors. Journal of Operational research society, 39, 271-277, 1988.
14. [29] Roy B., Sussmann B.: Les probl'emes dordonnancement avec contraintes disjonctives (in French). Technical Report 9 bis, SEMA, Paris (France), December 1964.
15. Leon V. J., Wu S. D.: On scheduling with ready-times, due-dates and vacations. Naval Research Logistics, 39:5365, 1992.
16. Schmidt G.: Scheduling with limited machine availability. European Journal of Operational Research(2000), 121, 1-15.
17. Mauguiere Ph., Billaut J-C., Bouquard J-L.: New single machine and job-shop scheduling problems with availability constraints. Journal of Scheduling, 2004.
18. Zribi N., Kacem I., EL Kamel A.: Hierarchical Optimization for the Flexible Job-shops Scheduling Problem. INCOM'04, Brazil 5-7 April 2004.