Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources

Alix Munier

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

  • Volume: 25, Issue: 2, page 161-182
  • ISSN: 0399-0559

How to cite

top

Munier, Alix. "Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources." RAIRO - Operations Research - Recherche Opérationnelle 25.2 (1991): 161-182. <http://eudml.org/doc/105008>.

@article{Munier1991,
author = {Munier, Alix},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {cyclic scheduling; finite set of generic tasks; resource or precedence constraints; frequency of the task occurrences; polynomial algorithm},
language = {fre},
number = {2},
pages = {161-182},
publisher = {EDP-Sciences},
title = {Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources},
url = {http://eudml.org/doc/105008},
volume = {25},
year = {1991},
}

TY - JOUR
AU - Munier, Alix
TI - Résolution d'un problème d'ordonnancement cyclique à itérations indépendantes et contraintes de ressources
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1991
PB - EDP-Sciences
VL - 25
IS - 2
SP - 161
EP - 182
LA - fre
KW - cyclic scheduling; finite set of generic tasks; resource or precedence constraints; frequency of the task occurrences; polynomial algorithm
UR - http://eudml.org/doc/105008
ER -

References

top
  1. [1] J. CARLIER et Ph. CHRETIENNE, Problèmes d'ordonnancement : modélisation, complexité, algorithmes. Masson, Paris, Collection Et. et Rech en Informatique. 
  2. [2] G. COHEN, D. DUBOIS, J. P. QUADRAT et M. VIOT, A Linear System Theoric View of Discrete Events Processes and its Use for Performance Evaluation in Manufacturing, IEEE Trans on Aut Control, 1985, AC 30, p. 210-220. Zbl0557.93005MR778424
  3. [3] S. C GRAVES, H. C. MEAL, D. STEFEK et A. H. ZEGHMI, Scheduling of Re-Entrant Flow Shops, Journal of Operations Management, August 1983. 
  4. [4] C. HANEN, Problèmes d'ordonnancement des architectures pipelines : modélisation, optimisation, algorithmes, Thèse d'université, Rapport MASI n° 193, Université Paris-VI, September 1987. 
  5. [5] H. HILLION et J. M. PROTH, Performance Evaluation of Job-Shop Systems Using Timed Event Graphs, IEEE Trans on Aut Control, 1989, AC 1, p.3-9. Zbl0656.90054MR970927
  6. [6] P. M. KOGGE, The Architecture of Pipelined Computers, New York, McGraw Hill, 1981. Zbl0476.68004
  7. [7] H. MATSUO, Cyclic Sequencing Problems in the two-Machine Permutation Flowshop: Complexity, Worst Case and Average Case Analysis, Graduate School of Business at the University of Texas at Austin, Technical Report, January 1988. Zbl0731.90041
  8. [8] R. ROUNDY, Cyclic Shedules for Job Shops with Identical Jobs, School of operations research and industrial engineering, Cornell University, Technical Report No. 766, July 1988. Zbl0770.90036

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.