Scheduling hybrid flow shop problem with non-fixed availability constraints

European Journal of Industrial Engineering

Volumn 4, Issue 4, 2010, Pages 413-433

  Besbes, Walid ^a   Teghem, Jacques ^b   Loukil, Taïcir ^a  

^a UNIVERSITY OF SFAX   (Tunisia)

^b FACULTÉ POLYTECHNIQUE DE MONS   (Belgium)

Author keywords

Availability constraint; Genetic algorithm; Hybrid flow shop; Industrial engineering; Scheduling

Indexed keywords

AVAILABILITY; GENETIC ALGORITHMS; INDUSTRIAL ENGINEERING; MACHINE SHOP PRACTICE; SCHEDULING;

APPROXIMATE SOLUTION; AVAILABILITY CONSTRAINTS; COMPUTATIONAL EXPERIMENT; CORRELATION FUNCTION; HYBRID FLOW SHOP; HYBRID FLOW SHOP PROBLEM; HYBRID FLOW SHOP SCHEDULING; MAKESPAN MINIMISATION;

PREVENTIVE MAINTENANCE;

EID: 77958468455     PISSN: 17515254     EISSN: 17515262     Source Type: Journal    
DOI: 10.1504/EJIE.2010.035652     Document Type: Article

References (27)

1. Aggoune, R. (2004) 'Minimizing the makespan for the flow shop scheduling problem with availability constraints', European Journal of Operational Research, Vol. 153, pp.534-543.
2. Allaoui, H. and Artiba, A. (2004) 'Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints', Computers & Industrial Engineering, Vol. 47, pp.431-450.
3. Allaoui, H. and Artiba, A. (2006) 'Scheduling two-stage hybrid flow shop with availability constraints', Computers & Operations Research, Vol. 33, pp.1399-1419.
4. Besbes, W., Loukil, T. and Teghem, J. (2006) 'Using genetic algorithm in the multiprocessor flow shop to minimize the makespan', Services Systems and Service Management IEEE International Conference ICSSSM, Troyes-France, Vol. 2, pp.1228-1233.
5. Besbes, W., Loukil, T. and Teghem, J. (2008) 'Maintenance prédictive avec des dates de début flexibles dans un flow shop hybride', 7e Conférence Internationale de MOdélisation et SIMulation MOSIM'08, du 31 mars au 2 avril 2008, Paris, France, Modélisation, Optimisation et Simulation des Systèmes: Communication, Coopération et Coordination.
6. Blazewicz, J., Breit, J., Formanowicz, P., Kubiak, W. and Schmidt, G. (2001) 'Heuristic algorithms for the two-machine flow shop problem with limited machine availability', Omega, Vol. 29, pp.599-608.
7. Espinouse, M.L., Formanowicz, P. and Penz, B. (1999) 'Minimizing the makespan in the twomachine no-wait flow-shop', Computers and Industrial Engineering, Vol. 37, pp.497-500.
8. Gao, J., Gen, M. and Sun, L. (2006) 'Scheduling jobs and maintenance in flexible job shop with hybrid genetic algorithm', Journal of Intelligent Manufacturing, Vol. 17, pp.493-507.
9. Gilmore, P.C. and Gomory, R.E. (1964) 'Sequencing a one state-variable machine: a solvable case of the traveling salesman problem', Operations Research, Vol. 12, pp.655-679.
10. Graham, R.L. (1966) 'Bounds for certain multiprocessing anomalies', The Bell System Technical Journal, Vol. 45, pp.1563-1581.
11. Gupta, J.N.D. (1988) 'Two stage hybrid flow shop scheduling problem', Journal of Operational Research Society, Vol. 39, pp.359-364.
12. Hoogeveen, J.A., Lenstra, J.K. and Veltman, B. (1996) 'Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard', European Journal of Operational Research, Vol. 89, pp.172-175.
13. Karp, R.M. (1972) 'Reducibility among combinatorial problems', in Miller, R.E. and Thatcher, J.W. (Eds.): Complexity of Computers Computations, pp.85-103, Plenum Press, New York.
14. Kubiak, W., Blazewicz, J., Formanowicz, P., Breit, J. and Schmidt, G. (2002) 'Two-machine flow shop with limited machine availability', European Journal of Operational Research, Vol. 136, pp.528-540.
15. Lee, C.Y. (1996) 'Machine scheduling with an availability constraint', Special issue on Optimization on Scheduling Applications, Journal of Global Optimization, Vol. 9, pp.395-416.
16. Lee, C.Y. (1997) 'Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint', Operations Research Letters, Vol. 20, pp.129-139.
17. Lee, C.Y. (1999) 'Two-machine flowshop scheduling with availability constraints', European Journal of Operational Research, Vol. 114, pp.129-139.
18. Lee, C.Y. and Vairaktarakis, G.L. (1994) 'Minimizing makespan in hybrid flowshops', Operational Research Letters, Vol. 16, pp.149-158.
19. Liao, C.J., Shyur, D.L. and Lin, C.H. (2005) 'Makespan minimization for two parallel machines with an availability constraint', European Journal of Operational Research, Vol. 160, pp.445-456.
20. Linn, R. and Zhang, W. (1999) 'Hybrid flowshop scheduling: a survey', Computers and Industrial Engineering, Vol. 37, pp.57-61.
21. Nawaz, J., Enscore, E.E. and Ham, I. (1983) 'A heuristic algorithm for the m-machine, n-job flowshop sequencing problem', Omega, Vol. 11, pp.91-95.
22. Ogüz, C. and Ercan, M.F. (2005) 'A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks', Journal of Scheduling, Vol. 8, pp.323-351.
23. Ruiz, R. and Maroto, C. (2006) 'A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility', European Journal of Operational Research, Vol. 169, pp.781-800.
24. Ruiz, R., Garcia-Diaz, J.C. and Maroto, C. (2007) 'Considering scheduling and preventive maintenance in the flowshop sequencing problem', Computers & Operations Research, Vol. 34, pp.3314-3330.
25. Schmidt, G. (2000) 'Scheduling with limited machine availability', European Journal of Operational Research, Vol. 121, pp.1-15.
26. Vignier, A., Billaut, J.C. and Proust, C. (1999) 'Les problèmes d'ordonnancement de type flowshop hybride: état de l'art', RAIRO Rech. Opér., Vol. 33, pp.177-183.
27. Xie, J. and Wang, X. (2005) 'Complexity and algorithms for two-stage flexible flowshops scheduling with limited machine availability constraints', Computers and Mathematics Applications, Vol. 50, pp.1629-1638.