Lot-Sizing with Start-Up Times
From MaRDI portal
Publication:2784046
DOI10.1287/mnsc.44.10.1409zbMath0989.90069OpenAlexW2139346168MaRDI QIDQ2784046
Publication date: 7 August 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.44.10.1409
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (16)
Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups ⋮ Scheduling with few changes ⋮ Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems ⋮ Multiple machine continuous setup lotsizing with sequence-dependent setups ⋮ Modeling industrial lot sizing problems: a review ⋮ Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation ⋮ Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems ⋮ Decomposition and dynamic cut generation in integer linear programming ⋮ Robust branch-and-cut-and-price for the capacitated vehicle routing problem ⋮ Discrete lot sizing and scheduling using product decomposition into attributes ⋮ A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times ⋮ Comparative approaches to equipment scheduling in high volume factories ⋮ Single item lot sizing problems
This page was built for publication: Lot-Sizing with Start-Up Times
