Journal Article10.1287/IJOC.1040.0110
Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
TL;DR: This work considers 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, finding 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.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Integration of production planning and scheduling: Overview, challenges and opportunities
TL;DR: The integration of medium-term production planning and short-term scheduling is reviewed, and the major modeling approaches for the integration of scheduling and planning decisions are presented.
397
The energy scheduling problem: Industrial case-study and constraint propagation techniques
TL;DR: An extension of specific resource constraint propagation techniques to efficiently prune the search space for EnSP solving and a branching scheme to solve the problem via tree search are presented.
104
Propagating logic-based Benders’ decomposition approaches for distributed operating room scheduling
TL;DR: Three novel logic-based Benders’ decomposition approaches and a cut propagation mechanism to solve large-scale location-allocation integer programs (IPs) and it is quantitatively demonstrated that the new Benders' cuts, cut propagation, and implementation can individually or collectively yield a computational time impact of at least two orders of magnitude.
96
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
TL;DR: In this paper, the authors proposed new symmetry-breaking constraints to break the symmetry in the branch-and-bound algorithm for the parallel machine lot-sizing problem, and tested their approach on the problem with setup costs and times, using a network reformulation for this problem.
Runway sequencing with holding patterns
TL;DR: This work studies a scheduling problem, motivated by air-traffic control, and describes several special cases that can be solved in polynomial time, and introduces a general hybrid branch and cut framework to solve the problem with arbitrary time windows.
75
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Constraint - based scheduling : applying constraint programming to scheduling problems
Philippe Baptiste,Claude Le Pape,Wim Nuijten +2 more
- 01 Jan 2001
TL;DR: This book is to provide an overview of the most widely used Constraint-Based Scheduling techniques and provides a model of the constraints that are the most often encountered in scheduling problems.
576