A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems

DOI10.1016/J.COR.2009.09.013MaRDI QIDQ2655646zbMATH OpenOpenAlexFDO

Authors Ada Y. Barlatt, Oleg Gusikhin, Amy Cohn

Publication date 25 January 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2009.09.013

zbMATH Keywords

algorithmsinteger programmingresource allocationscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Integration of mathematical programming with constraint programming for multi-objective planning and scheduling
• A simple and effective hybrid genetic search for the job sequencing and tool switching problem
• Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
• Hybrid optimization methods for time-dependent sequencing problems
• An exact algorithm for a vehicle-and-driver scheduling problem

Cites work

• A Benders approach for the constrained minimum break problem
• An LP-based heuristic for two-stage capacitated facility location problems
• Composite Variable Formulations for Express Shipment Service Network Design
• Generalized Benders decomposition
• Hierarchical production planning and scheduling in a multi-product, multi-machine environment
• Improving Crew Scheduling by Incorporating Key Maintenance Routing Decisions
• Logic-based Benders decomposition
• Multi-Stage Production Planning
• On the complexity of scheduling problems for parallel/pipelined machines
• On the Complexity of Scheduling with Batch Setup Times
• Partitioning procedures for solving mixed-variables programming problems
• Scheduling subject to resource constraints: Classification and complexity
• Scheduling with batching: A review
• The Complexity of Flowshop and Jobshop Scheduling

Cited in

(2)

• Single-facility scheduling by logic-based Benders decomposition
• Logic-based Benders decomposition for large-scale optimization

This page was built for publication: A hybridization of mathematical programming and dominance-driven enumeration for solving shift-selection and task-sequencing problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655646)