A Hybrid Method for the Planning and Scheduling

Authors:
J. N. Hooker
Affiliations:
Tepper School of Business, Carnegie Mellon University, Pittsburgh, USA
Venue:
Constraints
Year:
2005

Citing 6
Cited 13

Constraint-Based Scheduling

Constraint-Based Scheduling
Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Hybrid Benders Decomposition Algorithms in Constraint Logic Programming

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

INFORMS Journal on Computing
A scheme for unifying optimization and constraint satisfaction methods

The Knowledge Engineering Review
Inference-based constraint satisfaction supports explanation

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

An Integrated Method for Planning and Scheduling to Minimize Tardiness

Constraints
Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound

Computers and Operations Research
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

INFORMS Journal on Computing
An Integrated Solver for Optimization Problems

Operations Research
Hybrid algorithms in constraint programming

CSCLP'06 Proceedings of the constraint solving and contraint logic programming 11th annual ERCIM international conference on Recent advances in constraints
Solving a location-allocation problem with logic-based Benders' decomposition

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip

Journal of Scheduling
Checking-up on branch-and-check

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Optimal methods for resource allocation and scheduling: a cross-disciplinary survey

Constraints
Duality in optimization and constraint satisfaction

CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Single-Facility scheduling over long time horizons by logic-based benders decomposition

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Using Logic-Based Benders Decomposition to Solve the Capacity-and Distance-Constrained Plant Location Problem

INFORMS Journal on Computing
Scheduling a dynamic aircraft repair shop with limited repair resources

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and scheduled using CP, and the two are linked via logic-based Benders decomposition. Tasks assigned to a facility may run in parallel subject to resource constraints (cumulative scheduling). We solve minimum cost problems, as well as minimum makespan problems in which all tasks have the same release date and deadline. We obtain computational speedups of several orders of magnitude relative to the state of the art in both MILP and CP.