Logic-based Benders decomposition for scheduling a batching machine

DOI10.1016/j.cor.2019.104777zbMath1458.90288OpenAlexW2969606928WikidataQ127341499 ScholiaQ127341499MaRDI QIDQ2333133

Michel Gendreau, Simon Emde, Lukas Polten

Publication date: 11 November 2019

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

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

zbMATH Keywords

precedence constraintsBenders decompositionmaximum latenessautomated storage and retrievalsingle batching machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

The Star Degree Centrality Problem: A Decomposition Approach ⋮ Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ Benders decomposition for a period-aggregated resource leveling problem with variable job duration ⋮ Network scheduling problem with cross-docking and loading constraints ⋮ When serial batch scheduling involves parallel batching decisions: a branch and price scheme ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ Multi-shuttle crane scheduling in automated storage and retrieval systems ⋮ Logic-based benders decomposition with a partial assignment acceleration technique for avionics scheduling ⋮ Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Logic-Based Benders Decomposition for Integrated Process Configuration and Production Planning Problems ⋮ Bin Packing Problem with Time Lags ⋮ Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition ⋮ Scheduling multiple types of equipment in an automated warehouse ⋮ Parallel batching with multi-size jobs and incompatible job families

Cites Work

• A survey on single crane scheduling in automated storage/retrieval systems
• Split-merge: using exponential neighborhood search for scheduling a batching machine
• A survey of literature on automated storage and retrieval systems
• Partitioning procedures for solving mixed-variables programming problems
• Scheduling a batching machine
• Solving a chemical batch scheduling problem by local search
• The Benders decomposition algorithm: a literature review
• Bi-objective scheduling on a restricted batching machine
• Scheduling with batching: A review
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Planning and Scheduling by Logic-Based Benders Decomposition
• Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling of storage/retrieval orders under a just-in-time environment
• Efficient orderbatching methods in warehouses
• Optimally scheduling interfering and non‐interfering cranes
• Depth-First Search and Linear Graph Algorithms
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Scheduling

This page was built for publication: Logic-based Benders decomposition for scheduling a batching machine