Single-facility scheduling by logic-based Benders decomposition

DOI10.1007/s10479-011-1031-zzbMath1284.90023OpenAlexW2038323738MaRDI QIDQ2442086

John N. Hooker, Elvin Çoban

Publication date: 31 March 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Single-facility_scheduling_by_logic-based_Benders_decomposition/6707996

zbMATH Keywords

makespanmixed integer programmingtardinessfeasibilityconstraint programminglogic-based Benders decompositionsingle-facility scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items

Constraint programming and operations research, Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling, An MILP model for planning of batch plants operating in a campaign-mode, Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition, Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems, Logic-Based Benders Decomposition for Large-Scale Optimization, Improved combinatorial Benders decomposition for a scheduling problem with unrelated parallel machines, Changeover formulations for discrete-time mixed-integer programming scheduling models, Strengthening of feasibility cuts in logic-based benders decomposition

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid method for the planning and scheduling
• An integrated method for planning and scheduling to minimize tardiness
• Integrated methods for optimization.
• A Benders approach for the constrained minimum break problem
• The single-machine total tardiness scheduling problem: review and extensions
• Representability in mixed integer programming. I: Characterization results
• Partitioning procedures for solving mixed-variables programming problems
• Logic-based Benders decomposition
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Solving planning and scheduling problems with combined integer and constraint programming
• Scheduling a triple round robin tournament for the best Danish soccer league
• Generalized Benders decomposition
• A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Planning and Scheduling by Logic-Based Benders Decomposition
• Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
• Planning and Scheduling to Minimize Tardiness
• On the facial structure of set packing polyhedra
• Blocking and anti-blocking pairs of polyhedra
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Recent Advances in Constraints
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004