Constraint-Based Scheduling
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Framework for Constraint Programming Based Column Generation
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Solving Parallel Machine Scheduling Problems by Column Generation
INFORMS Journal on Computing
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
INFORMS Journal on Computing
A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
INFORMS Journal on Computing
Multi-stage benders decomposition for optimizing multicore architectures
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Checking-up on branch-and-check
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
A cutting plane approach for integrated planning and scheduling
Computers and Operations Research
| Hi-index | 0.00 |
We consider both branch-and-cut and column-generation approaches for the problem of finding a minimum-cost assignment of jobs with release dates and deadlines to unrelated parallel machines. Results are presented for several variants both with and without constraint programming. Among the variants, the most effective strategy is to combine a tight and compact, but approximate, mixed integer programming (MIP) formulation with a global constraint testing single machine feasibility. Instances with up to nine machines and 54 jobs have been solved. All the algorithms have been implemented in the Mosel modeling and optimization language.