论文信息 - A Constraint-Based Branch-and-Bound Algorithm for Preemptive Job-Shop Scheduling

A Constraint-Based Branch-and-Bound Algorithm for Preemptive Job-Shop Scheduling

This paper is dedicated to the preemptive job shop scheduling problem (PJSSP), the variant of the job shop scheduling problem (JSSP) in which all activities are preemptable. More precisely, one is given a set of jobs and a set of machines. Each job consists of a set of activities to be processed in a given order. Each activity is given an integer processing time and a machine on which it has to be processed. A machine can process at most one activity at a time.

Philippe Baptiste | Claude Le Pape

[1] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[2] Eric Pinson,et al. A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[3] Wpm Wim Nuijten,et al. Time and resource constrained scheduling : a constraint satisfaction approach , 1994 .

[4] David B. Shmoys,et al. A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[5] Philippe Baptiste,et al. A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling , 1995, IJCAI.

[6] J. Erschler,et al. Ordonnancement de tâches sous contraintes: une approche énergetique , 1992 .

[7] J. Carlier,et al. Adjustment of heads and tails for the job-shop problem , 1994 .

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9] Philippe Baptiste,et al. Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case , 1996, ECAI.

[10] François Laburthe,et al. Disjunctive Scheduling with Task Intervals , 1995 .

[11] Claude Le Pape. Des systèmes d'ordonnancement flexibles et opportunistes , 1988 .