Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
J. Erschler; G. Fontan; C. Merce
RAIRO - Operations Research - Recherche Opérationnelle (1985)
- Volume: 19, Issue: 1, page 15-26
- ISSN: 0399-0559
Access Full Article
top
How to cite
topErschler, J., Fontan, G., and Merce, C.. "Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine." RAIRO - Operations Research - Recherche Opérationnelle 19.1 (1985): 15-26. <http://eudml.org/doc/104866>.
@article{Erschler1985,
author = {Erschler, J., Fontan, G., Merce, C.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {deterministic job shop scheduling; dominance; feasibility of job sequences; limit times; single machine; tardiness optimization; branch and bound},
language = {fre},
number = {1},
pages = {15-26},
publisher = {EDP-Sciences},
title = {Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine},
url = {http://eudml.org/doc/104866},
volume = {19},
year = {1985},
}
TY - JOUR
AU - Erschler, J.
AU - Fontan, G.
AU - Merce, C.
TI - Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1985
PB - EDP-Sciences
VL - 19
IS - 1
SP - 15
EP - 26
LA - fre
KW - deterministic job shop scheduling; dominance; feasibility of job sequences; limit times; single machine; tardiness optimization; branch and bound
UR - http://eudml.org/doc/104866
ER -
References
top- 1. K. R. BAKER, Sequencing and Scheduling, John Wiley, New York, 1974.
- 2. K. R. BAKER et Z. Su, Sequencing with Due Dates and Early Start Times to Minimize Maximum Tardiness, Naval Res. Logist. Quart., vol. 21, 1974, p. 171-176. Zbl0277.90044MR343892
- 3. P. BRATLEY, M. FLORIAN et P. ROBILLARD, On Sequencing with Earliest Starts and Due Dates with Application to Computing Bounds for the (n/m/G/Fmax) Problem, Naval Res. Logist. Quart., vol. 20, 1973, p. 57-67. Zbl0256.90027MR411599
- 4. J. CARLIER et P. CHRÉTIENNE, Un domaine très ouvert : les problèmes d'ordonnancement, R.A.I.R.O.-Rech. Op., vol. 16, n° 3, 1982, p. 175-217. Zbl0494.90040
- 5. J. CARLIER, The One-machine Sequencing Problem, European Journal of Operational Research, vol. 11, 1982, p. 42-47. Zbl0482.90045MR671798
- 6. R. W. CONWAY, W. L. MAXWELL et L. W. MILLER, Theory of Scheduling, Addison-Wesley, New York, 1967. Zbl1058.90500MR389180
- 7. J. ERSCHLER, G. FONTAN, C. MERCE et F. ROUBELLAT, A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates, Operations Res., vol. 31, n° 1, 1983. Zbl0495.90046
- 8. G. FONTAN, Notion de dominance et son application à l étude de certains problèmes d'ordonnancement, Thèse de Doctorat ès-Sciences, 1980, Université de Toulouse.
- 9. B. J. LAGEWEG, J. K. LENSTRA et A. H. G. RINNOY KAN, Minimizing Maximum Lateness one One Machine : Computational Experience and Some Applications, Statistica Neerlandica, vol. 30, n° 1, 1976, p. 25-41. Zbl0336.90029MR434397
- 10. J. K. LENSTRA et A. H. G. RINNOY KAN, Complexity of Machine Scheduling Problem, Ann. Discrete Math., vol. 1, 1977, p. 343, 362. Zbl0353.68067MR456421
- 11. G. MCMAHON et M. FLORIAN, On scheduling with Ready Times and Due Dates to Minimize Maximum Lateness, Operations Research, vol. 23, n° 3, 1975, p. 475-482. Zbl0301.90024
- 12. B. ROY, Algèbre moderne et théorie des graphes, tome 2, Éditions Dunod, Paris, 1970. Zbl0238.90073MR260413
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.