Ordonnancements à contraintes disjonctives

Jacques Carlier

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

  • Volume: 12, Issue: 4, page 333-350
  • ISSN: 0399-0559

How to cite

top

Carlier, Jacques. "Ordonnancements à contraintes disjonctives." RAIRO - Operations Research - Recherche Opérationnelle 12.4 (1978): 333-350. <http://eudml.org/doc/104705>.

@article{Carlier1978,
author = {Carlier, Jacques},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {Branch and Bound Method; M Machines; Minimization of Makespan; Job-Shop Scheduling},
language = {fre},
number = {4},
pages = {333-350},
publisher = {EDP-Sciences},
title = {Ordonnancements à contraintes disjonctives},
url = {http://eudml.org/doc/104705},
volume = {12},
year = {1978},
}

TY - JOUR
AU - Carlier, Jacques
TI - Ordonnancements à contraintes disjonctives
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1978
PB - EDP-Sciences
VL - 12
IS - 4
SP - 333
EP - 350
LA - fre
KW - Branch and Bound Method; M Machines; Minimization of Makespan; Job-Shop Scheduling
UR - http://eudml.org/doc/104705
ER -

References

top
  1. 1. E. BALAS, Machine sequencing : disjunctive graph and degree constrained subgraphs, IBM. New York Scientific Center Technical Report, n° 320-2971, April 1969. MR272657
  2. 2. E. BALAS, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Operations Research, 17, n° 6, 1969. Zbl0183.49404MR250770
  3. 3. P. BRATLEY, M. FLORIAN and P. ROBILLARD, On sequencing with earliest start and due dates with application to Computing bounds for the (n, m, G/Fmax), Problem. N.L.R.Q., 20, 57, 1973. Zbl0256.90027MR411599
  4. 4. J. CARLIER, Disjonctions dans les ordonnancements. R.A.I.R.O., vol 2, 1975. Zbl0339.90031
  5. 5. J. CARLIER, Thèse de troisième cycle, Paris VI, juin 1975. 
  6. 6. M. FLORIAN, P. TREPANT and G. MC-MAHON, An implicit enumeration algorithm for the machine sequencing problems. Management Science, 17, 782; August 1971. Zbl0224.90047MR304077
  7. 7. M. FLORIAN, C. TILQUIN and G. TILQUIN, An implicit enumeration algorithm for complex scheduling problems. International Journal of Production Research 13, 1975, 1 (Jan), p. 25-40. Zbl0322.90029
  8. 8. S.-B. JOHNSON, Discussion : sequencing n jobs on two machines with arbitrary time lags. Management Science, vol. 5, n° 3, 1960, p. 299. Zbl0995.90537MR101165
  9. 9. J.-F. RAIMOND, Minimaximal paths on disjunctive graphs by direct search. IBM Journal of research and development, vol. 13, n° 4, July 1969. Zbl0251.90049MR243934
  10. 10. AHG RINNOOY KAN, Machine scheduling problem. Classification complexityand computations, Nijhoff, The Hague, 1976. 
  11. 11. B. ROY, Cheminement et connexité dans les graphes ; applications aux problèmes d'ordonnancement. METRA, série spéciale, n° 1, 1962. 
  12. 12. B. ROY, Prise en compte des contraintes disjonctives dans la méthode du chemin critique. R.A.I.R.O., n° 38, 1966, p. 68-84. 
  13. 13. B. ROY, Algèbre moderne et théorie des graphes. Tome II, Dunod, 1970. Zbl0238.90073MR260413
  14. 14. Y. TABOURIER, Problèmes d'ordonnancement à contraintes purement disjonctives. R.A.I.R.O., Série verte, n° 3, 1969. 
  15. 15. J. F. MUTH and G. L. THOMPSON, Industrial Scheduling, Englewoods Cliffs New Jersey, Prentice Hall. 

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.