A Hybrid Approach to Scheduling with Earliness and Tardiness Costs

A hybrid technique using constraint programming and linear programming is applied to the problem of scheduling with earliness and tardiness costs. The linear model maintains a set of relaxed optimal start times which are used to guide the constraint programming search heuristic. In addition, the constraint programming problem model employs the strong constraint propagation techniques responsible for many of the advances in constraint programming for scheduling in the past few years. Empirical results validate our approach and show, in particular, that creating and solving a subproblem containing only the activities with direct impact on the cost function and then using this solution in the main search, significantly increases the number of problems that can be solved to optimality while significantly decreasing the search time.

[1]  Alexander Bockmayr,et al.  Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming , 1998, INFORMS J. Comput..

[2]  Mark Wallace,et al.  A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems , 1998, CP.

[3]  Stephen F. Smith,et al.  Slack-Based Heuristics for Constraint Satisfaction Scheduling , 1993, AAAI.

[4]  J. Christopher Beck,et al.  Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling , 1999 .

[5]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[6]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

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

[8]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[9]  J. Christopher Beck,et al.  Constraint-directed techniques for scheduling alternative activities , 2000, Artif. Intell..

[10]  Stephen F. Smith,et al.  A Constraint-Based Method for Project Scheduling with Time Windows , 2002, J. Heuristics.

[11]  Philippe Refalo,et al.  Linear Formulation of Constraint Programming Models and Hybrid Solvers , 2000, CP.

[12]  Stephen F. Smith,et al.  An Iterative Sampling Procedure for Resource Constrained Project Scheduling with Time Windows , 1999, IJCAI.

[13]  John N. Hooker,et al.  Optimization and , 2000 .

[14]  J. Christopher Beck,et al.  Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics , 2000, Artif. Intell..

[15]  Philippe Refalo.  Tight Cooperation and Its Application in Piecewise Linear Optimization , 1999, CP.

[16]  J. Christopher Beck,et al.  THE ODO PROJECT: TOWARD A UNIFIED BASIS FOR CONSTRAINT-DIRECTED SCHEDULING , 1998 .

[17]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[18]  Mark Wallace,et al.  Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling , 2000, Constraints.

[19]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[20]  Stephen F. Smith,et al.  Profile-Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems , 1998, AIPS.

[21]  Philippe Baptiste,et al.  Constraint-based scheduling , 2001 .

[22]  Henri Beringer,et al.  Combinatorial Problem Solving in Constraint Logic Programming with Cooperating Solvers , 1995, Logic Programming: Formal Methods and Practical Applications.

[23]  L. Darrell Whitley,et al.  Problem difficulty for tabu search in job-shop scheduling , 2003, Artif. Intell..

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

[25]  L. Darrell Whitley,et al.  A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem , 2000, PPSN.

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

[27]  L. Darrell Whitley,et al.  Algorithm Performance and Problem Structure for Flow-shop Scheduling , 1999, AAAI/IAAI.