A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover
From MaRDI portal
Publication:3114705
DOI10.1287/mnsc.47.6.851.9813zbMath1232.90181OpenAlexW2065024613MaRDI QIDQ3114705
Mohan Gopalakrishnan, Srimathy Mohan, Ke Ding, Jean-Marie Bourjolly
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.47.6.851.9813
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items
Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Scheduled penalty variable neighborhood search ⋮ A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times ⋮ Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Self-adaptive randomized constructive heuristics for the multi-item capacitated lot sizing problem ⋮ A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines ⋮ A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times ⋮ Capacitated lot-sizing with extensions: a review ⋮ Modeling industrial lot sizing problems: a review ⋮ Multilevel capacitated lot-sizing and resource-constrained project scheduling: an integrating perspective ⋮ A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times ⋮ Group-scheduling problems in electronics manufacturing ⋮ MIP formulations and heuristics for two-level production-transportation problems ⋮ Single machine multi-product capacitated lot sizing with sequence-dependent setups ⋮ A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Discrepancies in solutions between traditional and net present value formulations of finite horizon, discrete-time economic lot size problems ⋮ Polyhedral and Lagrangian approaches for lot sizing with production time windows and setup times ⋮ Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over ⋮ GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem ⋮ Single item lot sizing problems ⋮ Solving lot-sizing problem with quantity discount and transportation cost
