Un algorithme de résolution de problèmes d'ordonnancement dynamiques
RAIRO - Operations Research - Recherche Opérationnelle (1982)
- Volume: 16, Issue: 3, page 219-239
- ISSN: 0399-0559
Access Full Article
top
How to cite
topSoubrier, Jean-Paul. "Un algorithme de résolution de problèmes d'ordonnancement dynamiques." RAIRO - Operations Research - Recherche Opérationnelle 16.3 (1982): 219-239. <http://eudml.org/doc/104811>.
@article{Soubrier1982,
author = {Soubrier, Jean-Paul},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {n/m/G/T job-shop scheduling; dynamic scheduling; greedy algorithm; penalty method},
language = {fre},
number = {3},
pages = {219-239},
publisher = {EDP-Sciences},
title = {Un algorithme de résolution de problèmes d'ordonnancement dynamiques},
url = {http://eudml.org/doc/104811},
volume = {16},
year = {1982},
}
TY - JOUR
AU - Soubrier, Jean-Paul
TI - Un algorithme de résolution de problèmes d'ordonnancement dynamiques
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1982
PB - EDP-Sciences
VL - 16
IS - 3
SP - 219
EP - 239
LA - fre
KW - n/m/G/T job-shop scheduling; dynamic scheduling; greedy algorithm; penalty method
UR - http://eudml.org/doc/104811
ER -
References
top- 1. ASHOUR, Sequencing Theory, Springer Verlag, 1972. Zbl0241.90029MR363453
- 2. BALAS, Machine Sequencing via Disjunctive Graphs: an Implicit Enumeration Algorithm, Operations Research, n° 6, 1969. Zbl0202.18503
- 3. CARLIER, Ordonnancement à contraintes disjonctives, R.A.I.R.O., novembre 1978. Zbl0401.90052
- 4. CONWAY/ MAXWELLTheory of Scheduling, Addison Wesley, 1967. Zbl1058.90500
- 5. ELMAGHRABY, The Machine Sequencing Pb, Reviews and Extensions, N.R.L.Q., n° 2, 1968.
- 6. FLORIAN/ BRATLEY/ ROBILLARD, On Sequencing with Earliest Starts and Due-Dateswith Applications to Computing Bounds for the n/m/G/Fmax Problems, N.R.L.Q., vol. 20, 1973. Zbl0256.90027
- 7. IGNALL/ SCHRAGE, Application to the Branch and Bound Technique to Some Flow-Shop Scheduling Problems, Operations Research, mai-juin 1965.
- 8. JACKSON, Some Problems in Queuing with Dynamic Properties, N.R.L.Q., n° 3, 1960. Zbl0115.36101
- 9. LITTLE, A Proof for the Queuing Formula L = ?W, Operations Research, n° 3, mai 1961. Zbl0108.14803MR125644
- 10. MINOUX, Algorithmes Gloutons, E.D.F. Bulletin, 1977.
- 11. NEPOMIASTCHY, Résolution d'un problème d'ordonnancement à ressources variables, R.A.I.R.O., août 1978. Zbl0383.60108
- 12. SOUBRIER, Un modèle de résolution de problèmes d'ordonnancement dynamique, Thèse de Docteur-Ingénieur, U.P.S., Toulouse, 1981.
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.