Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions

DOI10.1016/j.ejor.2011.05.014zbMath1219.90060OpenAlexW2080394074MaRDI QIDQ635174

Jan Christian Lang, Zuo-Jun Max Shen

Publication date: 19 August 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.05.014

zbMATH Keywords

heuristicsinteger programmingproductionsubstitutionssequence-dependent setupscapacitated lot-sizing and scheduling

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)

Related Items (13)

Multiple-stage multiple-machine capacitated lot-sizing and scheduling with sequence-dependent setup: a case study in the wheel industry ⋮ Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ The green capacitated multi-item lot sizing problem with parallel machines ⋮ A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times ⋮ OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity ⋮ A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem ⋮ Efficient approximate algorithms for a class of dynamic lot size problems under product substitution ⋮ A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty ⋮ Multi‐level, multi‐stage lot‐sizing and scheduling in the flexible flow shop with demand information updating ⋮ Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty ⋮ Forecast horizon for dynamic lot sizing model under product substitution and perishable inventories ⋮ A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems

Uses Software

• LKH
• SAP APO

Cites Work

• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• A heuristic approach for big bucket multi-level production planning problems
• Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
• The general lotsizing and scheduling problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The traveling salesman problem and its variations
• Capacitated lot-sizing with sequence dependent setup costs
• Efficient reformulations for dynamic lot-sizing problems with product substitution
• Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
• Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
• Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
• A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
• Single machine multi-product capacitated lot sizing with sequence-dependent setups

This page was built for publication: Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions