An exact method for solving the multi-processor flow-shop

Jacques Carlier; Emmanuel Néron

RAIRO - Operations Research - Recherche Opérationnelle (2000)

  • Volume: 34, Issue: 1, page 1-25
  • ISSN: 0399-0559

How to cite

top

Carlier, Jacques, and Néron, Emmanuel. "An exact method for solving the multi-processor flow-shop." RAIRO - Operations Research - Recherche Opérationnelle 34.1 (2000): 1-25. <http://eudml.org/doc/105206>.

@article{Carlier2000,
author = {Carlier, Jacques, Néron, Emmanuel},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {multi-processor flow-shop; inputs and selection; -machine problems; branch and bound method},
language = {eng},
number = {1},
pages = {1-25},
publisher = {EDP-Sciences},
title = {An exact method for solving the multi-processor flow-shop},
url = {http://eudml.org/doc/105206},
volume = {34},
year = {2000},
}

TY - JOUR
AU - Carlier, Jacques
AU - Néron, Emmanuel
TI - An exact method for solving the multi-processor flow-shop
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 2000
PB - EDP-Sciences
VL - 34
IS - 1
SP - 1
EP - 25
LA - eng
KW - multi-processor flow-shop; inputs and selection; -machine problems; branch and bound method
UR - http://eudml.org/doc/105206
ER -

References

top
  1. [Baptiste et al., 98] P. BAPTISTE, C. LE PAPE and W. NUIJTEN, Satisfiability tests and time-bound adjustments for cumulative scheduling problems, Technical Report 98-97, Université de Technologie de Compiègne, to appear in Ann. Oper. Res. Zbl0958.90037MR1730749
  2. [Brah and Hunsucker, 91] S. A. BRAH and J. L. HUNSUCKER, Branch and bound method for the flow shop with multiple processors. European J. Oper. Res., 1991, 51, p. 88-89. Zbl0732.90040
  3. [Carlier, 84] J. CARLIER, Problèmes d'ordonnancement à contraintes de ressources: algorithmes et complexité, Thèse d'État, MASI. 1984. 
  4. [Carlier and Pinson, 98] J. CARLIER and E. PINSON, Jackson pseudo preemptive schedule for the Pm/ri, qi/Cmax problem, Ann. Oper. Res., 1998, 83, p. 41-58. Zbl0911.90203MR1661675
  5. [Demeulemeester and Herroelen, 92] E. L. DEMEULEMEESTER and W. S. HERROELEN, A Branch and Bound procedure for the multiple resource-constrained project scheduling problem, Management Science, 1992, 38, p. 1803-1818. Zbl0761.90059
  6. [Gupta, 88] J. N. D. GUPTA, Two stages hybril flowshop scheduling problem, Operational Research Society, 1988, 4, p. 359-364. Zbl0639.90049
  7. [Perregaard, 95] M. PERREGAARD, Branch and bound methods for the multiprocessor jobshop and flowshop scheduling problems, Datalogisk Institut Kobenhavns Universitet - Master Thesis, 1995. 
  8. [Portmann et al, 98] M. C. PORTMANN, A. VIGNIER, D. DARDILHAC and D. DEZALAY, Branch and bound crossed with G.A to solve hybrid flowshops, European J. Oper. Res., 1998, 107, p. 339-400. Zbl0943.90038
  9. [Sprecher, 94] A. SPRECHER, Resource-Constrained Project Scheduling - Exact Methods for the Multi-Mode case, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, 1994. Zbl0809.90084MR1281144
  10. [Vandevelde, 94] A. VANDEVELDE, Minimizing the makespan in a multiprocessor flow shop, Eindhoven University of Technology - Master Thesis, 1994. 
  11. [Vignier, 97] A. VIGNIER, Contribution à la résolution des problèmes d'ordonnancement de type monogamme, multimachines ("flow-shop hybride"), PhD Thesis, 1997. 

NotesEmbed ?

top

You must be logged in to post comments.