Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups

DOI10.1080/00207540802446787zbMath1197.90190OpenAlexW2015372025MaRDI QIDQ3163748

Bernardo Almada-Lobo, Ross J. W. James

Publication date: 26 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802446787

zbMATH Keywords

linear programmingschedulingmeta-heuristicslogisticslot sizingoperational researchproduct planning

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems ⋮ Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ The capacitated lot-sizing and energy efficient single machine scheduling problem with sequence dependent setup times and costs in a closed-loop supply chain network ⋮ Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup ⋮ An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times ⋮ Single and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristics

Cites Work

• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Multilevel capacitated lotsizing complexity and LP-based heuristics
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• A note on ``the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Lotsizing and scheduling for production planning
• The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
• Simultaneous lotsizing and scheduling on parallel machines
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• Modeling of period overlapping setup times
• Lot-Sizing with Start-Up Times
• A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
• The Capacitated Lot-Sizing Problem with Linked Lot Sizes
• A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Rolling-horizon lot-sizing when set-up times are sequence-dependent
• Modeling industrial lot sizing problems: a review
• Single machine multi-product capacitated lot sizing with sequence-dependent setups