Un domaine très ouvert : les problèmes d'ordonnancement

This publication has 23 references indexed in Scilit:

• Potentiels sur un graphe non conjonctif et analyse d'un problème d'ordonnancement à moyens limites
  Rairo-Operations Research, 1979
• Ordonnancements à contraintes disjonctives
  Rairo-Operations Research, 1978
• Scheduling independent tasks to reduce mean finishing time
  Communications of the ACM, 1974
• Sequencing with due‐dates and early start times to minimize maximum tardiness
  Naval Research Logistics Quarterly, 1974
• On sequencing with earliest starts and due dates with application to computing bounds for the (n/m/G/F_max) problem
  Naval Research Logistics Quarterly, 1973
• Optimal scheduling for two-processor systems
  Acta Informatica, 1972
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
  SIAM Journal on Applied Mathematics, 1972
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
  Operations Research, 1969
• Bounds on Multiprocessing Timing Anomalies
  SIAM Journal on Applied Mathematics, 1969
• Bounds for Certain Multiprocessing Anomalies
  Bell System Technical Journal, 1966