Free Access
Issue
RAIRO-Oper. Res.
Volume 28, Number 3, 1994
Page(s) 221 - 253
DOI https://doi.org/10.1051/ro/1994280302211
Published online 06 February 2017
  • 1. T. L. ADAM, K. M. CHANDY, J. R. DICKSON, A comparison of list schedules for parallel processing Systems, Communications of the ACM, 1974, Vol.17, p. 685-690. [Zbl: 0293.68047]
  • 2. J. BRUNO, Deterministic and stochastic scheduling with treelike precedence constraints, in Deterministic and stochastic scheduling, Dempster et al. (eds.), Dordrecht (Hollande), 1982, p. 367-374. [Zbl: 0488.68036]
  • 3. A. A. BULGAK, J. L. SANDERS, Integrating a modified simulated annealing algorithm with the simulation of a manufacturing System to optimize buffer sizes in automatic assembly systems, Proceeding of the 1988Winter Simulation Conference, p. 684-690.
  • 4. J. CARLIER, P. CHRÉTIENNE, Problèmes d'ordonnancement, Masson, Paris, 1988. [Zbl: 0494.90040]
  • 5. K. M. CHANDY, P. F. REYNOLDS, Scheduling partially ordered tasks with probabilistic execution times, in Proceedings of the Fifth Symposium on Operating Systems Principles, 1975, p. 164-177.
  • 6. E. G. COFFMAN, R. L. GRAHAM, Optimal scheduling for two processor Systems, Acta Informatica, 1972, Vol. 1, p. 200-213. [MR: 334913] [Zbl: 0248.68023]
  • 7. E. G. COFFMAN, Computer and jobshop scheduling theory, John Wiley and sons, 1976. [Zbl: 0359.90031]
  • 8. E. G. COFFMAN, Z. LIU, On the optimal stochastic scheduling of out-forests, Operations Research, Jan-Feb. 1992, Vol. 40, Supp. n° 1, p. 567-575. [MR: 1152742] [Zbl: 0764.90042]
  • 9. C. COROYER, Z. LIU, Effectiveness of heuristics and simulated annealing for the scheduling of concurrent tasks - an empirical comparison, Rapport INRIA, n° 1379, Janvier 1991.
  • 10. E. D'HOLLANDER, Computer aided dataflow analysis for the conversion of sequential programs into parallel form, Special topics in supercomputing, Vol. 3 : algorithms and applications on vector and parallel computers), North-Holland, 1987.
  • 11. A. FERRARA, R. MINCIARDI, Resource constrained scheduling via simulated annealing: a discrete event approach, Proceedings of the European Simulation Symposium, Ghent (Belgium), 1990, p. 177-181.
  • 12. G. FLEURY, Résolution de problèmes NP-complets : méthodes déterministes et stochastiques, Thèse d'université, Université Blaise Pascal, Clermont-Ferrand II, 1993.
  • 13. E. FROSTIG, A stochastic scheduling problem with intree precedence constraints, Operations Research, 1988, Vol. 36, p. 937-942. [MR: 973149] [Zbl: 0679.90022]
  • 14. M. R. GAREY, D. S. JOHNSON, Computers and intractability: a guide to the theory of NP-completeness, Freeman, New York, 1983. [MR: 519066] [Zbl: 0411.68039]
  • 15. J. M. GOURGAND, S. NORRE, Design and realization of a Petri Net simulator for program parallelization, Proceedings of the tenth IASTED International Conference, Innsbruck (Austria), p. 83-86, February 1992.
  • 16. J. M. GOURGAND, S. NORRE, Static allocation of tasks on multibus multiprocessor architectures, OPOPAC (International Workshop On Principles Of PArallel Computing), 22-26 Novembre 1993, Lacanau (France), Ed. Hermès. [Zbl: 0817.68030]
  • 17. B. HAJECK, Cooling schedules for optimal annealing, Mathematics of Operations Research, 1988, p. 311-329. [MR: 942621] [Zbl: 0652.65050]
  • 18. T. C. HU, Parallel sequencing and assembly line problem, Operational Research, 1961, Vol. 9, p. 841-843. [MR: 135614]
  • 19. H. KASAHARA, S. NARITA, Practical multiprocessor scheduling algorithms for efficient parallel processing, IEEE Transaction on Computers, 1984, Vol. C33, n° 11, p.1023-1029.
  • 20. T. G. LEWIS, W. H. PAYNE, Generalized feedback shift register pseudo random number algorithm, J. ACM, 1973, Vol. 20, n° 3, p. 456-468. [Zbl: 0266.65009]
  • 21. Z. LIU, E. SANLAVILLE, Stochastically minimizing the makespan of structured jobs, École d'été sur la théorie de l'ordonnancement et ses applications, 28 Sept-2 Oct 1992, Chateau de Bonas (Gers), France, p. 166-184.
  • 22. M. A. MARSAN, G. BALBO, G. CONTE, Performance models of multiprocessor Systems, The MIT Press, USA, 1986.
  • 23. M. K. MOLLOY, Performance analysis using stochastic Petri nets, IEEE Transactions on Computers, 1984, Vol. C31, p. 913-917.
  • 24. S. NORRE, Static allocation of tasks on multiprocessor architectures with interprocessor communication delays, Lecture Notes in Computer Science 694, Arndt Bode-Mike Reeve-Gottfried Wolf (eds), Springer-Verlag, p. 488-499.
  • 25. S. NORRE, Affectation de tâches sur une architecture multiprocesseur - Méthodes stochastiques et évaluation des performances, Thèse de Doctorat, Université de Clermont-Ferrand II, 1993.
  • 26. C. H. PAPADIMITRIOU, M. YANNAKAKIS, Scheduling interval-ordered tasks, Siam. J. Comput., 1979, Vol. 8, n° 3, p. 405-409. [MR: 539257] [Zbl: 0421.68040]
  • 27. M. PINEDO, G. WEISS, Scheduling jobs with exponentially distributed processing times and intree preceding constraints on two parallel machines, Operations Research, 1985, Vol. 33, p. 1381-1388. [MR: 819187] [Zbl: 0581.90036]
  • 28. QNAP2 version 8, manuel de référence, Société Simulog, 1991.
  • 29. P. QUINTON, From specifications to machine code: parallelization methods, Parallel and Distributed Algorithms, M. Cosnard et al. (Editors), North-Holland, 1989, p. 253-256.
  • 30. P. SIARRY, G. DREYFUS, La méthode de recuit simulé : théorie et applications, ISDET, Paris, 1988.
  • 31. N. TAWBI, Parallélisation automatique: estimation des durées d'exécution et allocation statique des processeurs, Thèse de doctorat, Université Paris VI, MASI 91.47, 1991.
  • 32. P. J. M. VAN LAARHOVEN, Simulated annealing: theory and applications, Kluwer Academic Publishors, The Netherlands, 1989. [Zbl: 0643.65028]
  • 33. M. WIDMER, Modèles mathématiques pour une gestion efficace des ateliers flexibles, Thèse d'état, École Polytechnique de Lausanne, 1990.

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.