Meta-heuristics for the deterministic hybrid flow shop problem

Journal Europeen des Systemes Automatises

Volumn 34, Issue 9, 2000, Pages 1107-1135

  Gourgand, Michel ^a   Grangeon, Nathalie ^a   Norre, Sylvie ^a  

^a UNIVERSITÉ CLERMONT AUVERGNE   (France)

Author keywords

Hybrid Flow Shop; Metaheuristics; Neighbouring systems; Predictive approach; Resource assignment; Scheduling; Stochastic algorithms

Indexed keywords

EID: 0041780055     PISSN: 12696935     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (43)

1. BELKHITER M., Contribution à la modélisation et à l'optimisation des systèmes de production manufacturiers, Université Blaise Pascal, Clermont-Ferrand, Ph. D. Thesis, 1998.
2. BONNEMOY C., HAMMA S.B., « La méthode du recuit simulé : optimisation globale dans Rn », RAIRO APII, Vol. 25(5), 1991.
3. BRAH S.A., HUNSUCKER J.L., « Branch and bound algorithm for the flowshop with multiple processor », European Journal of Operational Research, Vol. 51, 1991, pp. 88-99.
4. BRAH S.A., « Complexity of the flow shop with multiple processors scheduling problem, and some dominance conditions », Phua. K.H. et al. (Ed.), Optimization : Techniques and Applications, Vol. 1, World Scientific, Singapore, 1992, pp. 538-545.
5. BRAH S.A., « A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors », Production Planning and Control, Vol. 7(4), 1996, pp. 362-373.
6. BRAH S.A., WHEELER G.E., « Comparison of scheduling rules in a flow shop with multiple processors : a simulation », Simulation, Vol. 71(5), 1998, pp. 302-311.
7. BRAH S.A., LOO L.L., « Heuristics for scheduling in a flow shop with multiple processors », European Journal of Operational Research, Vol. 113, 1999, pp. 113-122.
8. CHEN B., « Analysis of classes of heuristics for scheduling two stage flow-shop with parallel machines at one stase », The Journal of the Operational Research Society, Vol. 46(2), 1995, pp. 234-244.
9. DEAL D.E., HUNSUCKER J.L., « The two-stage flow-shop problem with m machines at each stage », Journal of Information and Optimization Sciences, Vol. 12, 1991, pp. 407-417.
10. DESSOUKY M.M., DESSOUKY M., VERMA S.K., « Flowshop scheduling with identical jobs and uniform parallel machines », European Journal of Operational Research, Vol. 109, 1998, pp. 620-631.
11. FLEURY G., Méthodes stochastiques et déterministes pour les problèmes NP-difficiles, Université Blaise Pascal, Clermont-Ferrand, Ph. D. Thesis, 1993.
12. GRANGEON N., Heuristiques et algorithmes stochastiques pour le problème du flow shop hybride, Rapport de DEA, Université Blaise Pascal, Clermont-Ferrand, 1998.
13. th International Conference on Computers and Industrial Engineering, Vol. 37, 1999, pp. 207-210.
14. GUINET A., SOLOMON M.M., KEDIA P.K., DUSSAUCHOY A., « A computational study of heuristics for two-stage flexible flow-shops », International Journal of Production Research, Vol. 34(5), 1996, pp. 1399-1416.
15. GUINET A., SOLOMON M.M , « Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time », International Journal of Production Research, Vol. 34(6), 1996, pp 1643-1654.
16. GUPTA J.N.D., « Two stage hybrid flow shop scheduling problem », Journal of Operations Research Society, Vol. 39(4), 1998, pp. 359-364.
17. GUPTA J.N.D., TUNC E.A. « Schedules for a two stage hybrid flow shop with parallel machines at the second stage », International Journal of Production Research, Vol. 29(7), 1991, pp. 1489-1502.
18. GUPTA J.N.D. TUNC E.A. « Scheduling a two-stage hybrid flowshop with separable set-up and removal times », European Journal of Operational Research, Vol. 77, 1994, pp. 415-428.
19. HAOUARI M., M'HALLAH R., « Heuristic algorithms for the two stage hybrid flow shop », Operation Research Letters, Vol. 21(1), 1997, pp. 43-53.
20. HAO J.K., GALINIER P., HABIB M., « Métaheuristiques pour l'optimisation combinatoire et l'affectation sous contraintes », to appear in Revue d'Intelligence Artificielle.
21. HUNSUCKER J.L., SHAH J R., « Performance of priority rules in a due date flow shop », OMEGA. Vol. 20, 1992, pp. 73-89.
22. HUNSUCKER J.L., SHAH J.R., « Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment », European Journal of Operational Research, Vol. 72, 1994, pp. 102-114.
23. IGNALL A., SCHRÄGE L. « Application of the branch and bound technique to some flow-shop scheduling problems », Operations Research, Vol. 13(3), 1965, pp. 400-412.
24. VAN LAARHOVEN P.J.M., AARTS A.H.L., « Simulated Annealing: Theory and Applications », Operations Research, Kluwer Academic Publishers, 1987.
25. LEE C.Y., VAIRAKTARAKIS G.L., « Minimizing makespan in hybrid flow-shops », Operations Research Letters, Vol. 16(3), 1994, pp. 149-158.
26. LI S., « A hybrid two stage flow shop with part family, bath production, major and minor set ups », European Journal of Operational Research, Vol. 102, 1997, pp. 142-156.
27. METROPOLIS N., ROSENBLUTH A.W., ROSENBLUTH M.W., TELLER A.H.,TELLER E., « Equation of state calculations by fast computing machines », Journal of Chemical Physics, Vol. 21, 1953, pp. 1087-1091.
28. MOURSLI O., Scheduling the hybrid flow shop : branch and bound algorithm, Université catholique de Louvain, Ph. D. Thesis, 1998.
29. NARASIMHAN S.L., MANGIAMELI P.M., « A comparison of sequencing rules for two stage hybrid flow shop », Decision Sciences, Vol. 18, 1987, pp. 250-265.
30. NERON E., CARLIER J., « An exact Method for Solving The Multi-Processor Flowshop », International Conference on Industrial Engineering and Production Management, Proc. 1, Lyon (France), 1997, pp. 593-600.
31. NOWICKI E., SMUTNICKI C., « The flow shop with parallel machines : a Tabu search approach », European Journal of Operational Research, Vol. 106, 1998, pp. 226-253.
32. PORTMANN M.C., VIGNIER A., DARDILHAC D., DEZALAY D., « Branch and bound crossed with GA to solve hybrid flow shops », European Journal of Operational Research, Vol. 107, 1998, pp. 389-400.
33. QUERE A., Gestion et optimisation des flux matières dans les systèmes de production de type flow shop hybride. Université Blaise Pascal, Clermont-Ferrand, Ph. D. Thesis, 1998.
34. RAJENDRAN C., CHAUDHURI D., « Scheduling in n-job, m-stage flow-shop with parallel processors to minimize makespan », International Journal of Production Research, Vol. 27, 1992, pp. 137-143.
35. RAJENDRAN C., CHAUDHURI D., « A multi-stage parallel-processors flowshop problem with minimum flowtime », European Journal of Operational Research, Vol. 57, 1992, pp. 111-122.
36. RIANE F., « A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan », European Journal of Operational Research, Vol. 109, 1998, pp. 321-329.
37. RIANE F., Scheduling hybrid flow shops and applications. Facultés Universitaires Catholiques de Mons, Ph. D. Thesis, 1998.
38. SALVADOR M.S., « A solution to special class of flowshop scheduling problems », Proceedings of the Symposium on the Theory of Scheduling and its applications, Springer Verlag, Berlin, pp. 83-91.
39. SANTOS D.L., HUNSUCKER J.L., DEAL D.E., « Global lower bound for flow shops with multiple processors », European Journal of Operational Research, Vol. 80, 1995, pp. 112-120.
40. SRISKANDARAJAH C., SETHI S.P., « Scheduling algorithms for flexible flowshops: Worst and average case performance », European Journal of Operational Research, Vol. 43, 1989, pp. 143-160.
41. SRIDHAR J., RAJENDRAN C., « Scheduling in a cellular manufacturing system - a simulated annealing approach», International Journal of Production Research, Vol. 31, 1993, pp. 2927-2945.
42. VIGNIER A., Contribution à la résolution de problèmes d'ordonnancement de type monogamme, multimachines (Flow shop hybride), Université de Tours, Ph. D. Thesis, 1997.
43. VIGNIER A., BILLAUT J.C., PROUST C., « Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art », RAIRO, vol.33(2), 1999, pp. 117-183.