Branch and bound crossed with GA to solve hybrid flowshops

European Journal of Operational Research

Volumn 107, Issue 2, 1998, Pages 389-400

  Portmann, M C ^a   Vignier, A ^b,c   Dardilhac, D ^b   Dezalay, D ^b  

^a CNRS   (France)

^b Laboratoire d'Informatique   (France)

^c LORIA   (France)

Author keywords

Branch and bound; Genetic algorithm; Hybrid flowshop

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION MAKING; GENETIC ALGORITHMS; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING; TREES (MATHEMATICS);

BRANCH AND BOUND METHOD; HYBRID FLOW SHOP PROBLEM;

PRODUCTION ENGINEERING;

EID: 0032098627     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00333-0     Document Type: Article

References (14)

1. J.N.D. Gupta, Two-stage hybrid flowshop scheduling problem, Operational Research Society 39 (4) (1988) 359-364.
2. J.A. Hoogeveen, J.K. Lenstra, B. Veltman, Minimizing the makespan in a multiprocessor flowshop is strongly NP-Hard, European Journal of Operational Research (to appear).
3. A. Vignier, J.-C. Billaut, C. Proust, Les problèmes d'ordonnancement de type flow-shop hybride: état de l'art, in: Journées d'études: "Affectation et Ordonnancement", CNRS/GdR Automatique/Pôle SED/GT3, pp. 7-47, Tours, September 1995 CNRS/GdR Automatique/pôle SED/GT3. To appear in RAIRO-RO/Op. Res.
4. S.A. Brah, J.L. Hunsucker, Branch and bound algorithm for the flow shop with multiple processors, European Journal of Operations Research 51 (1991) 88-99.
5. C. Rajendran, D. Chaudhuri, A multi-stage parallel processor flowshop problem with minimum flowtime, European Journal of Operational Research 57 (1992) 111-122.
6. C. Rajendran, D. Chaudhuri, Scheduling in n-jobs, m stage flowshop with parallel processors to minimize makespan, International Journal of Production Economics 27 (1992) 137-143.
7. Ph. Fortemps, Ch. Ost, M. Pirlot, J. Teghem, D. Tuyttens, A production scheduling case study in a chemical firm using metaheuristics, European Journal of Operations Research (1996) (submitted).
8. R.J. Paul, A production scheduling problem in the glass-container industry, Operations Research 27 (2) (1979) 290-302.
9. E.H. Aghezzaf, A. Artiba, O. Moursli, C. Tahon, Hybrid flowshop problems, a decomposition based heuristic approach, in: Proceedings of International Conference on Industrial Engineering and Production Management (IEPM'95), pp. 43-56, Marrakech (Maroc), 1995. FUCAM/IFIP/INRIA.
10. S. Bagchi, S. Uckun, Y. Miyabe, K. Kawamura, Exploring problem-specific recombination operators for job shop scheduling, in: Morgan Kaufmann (Ed.), Proceedings of the Fourth Internationnal Conference on Genetic Algorithms, pp. 10-17, San Mateo, California, 1991.
11. M.-C. Portmann, F. Ghedjati, Méthodes approchées pour le problème d'ordonnancement avec machines non identiques en parallèles et contraintes de précédence, in: Actes de AGI'94, Poitiers (France), June 1994.
12. S. Uckun, S. Bagchi, K. Kawamura, Managing genetic search in job shop scheduling, IEEE Expert 8 (5) (1993) 15-24.
13. L. Davis (Ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
14. L. Djerid, M.-C. Portmann, P. Villon, Performance analysis of permutation cross-over genetic operators, Journal of Decision Systems 5 (1/2) (1996) 157-177.