Some Extensions of the Discrete Lotsizing and Scheduling Problem

From MaRDI portal
Publication:3982669

DOI10.1287/mnsc.37.7.801zbMath0742.90039OpenAlexW1986751216MaRDI QIDQ3982669

Marc Salomon, Luk N. Van Wassenhove, Leo G. Kroon, Roelof Kuik

Publication date: 26 June 1992

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/612c1585bf627c730e4caf3ab0eca7eb853a5a26




Related Items

Simultaneous production and maintenance planning for a single capacitated resource facing both a dynamic demand and intensive wear and tearA linear description of the discrete lot-sizing and scheduling problemDynamic capacitated lot-sizing problems: a classification and review of solution approachesMeta-heuristics for dynamic lot sizing: a review and comparison of solution approachesHybrid methods for lot sizing on parallel machinesOn production planning and scheduling in food processing industry:modelling non-triangular setups andproduct decayMulti-stage simultaneous lot-sizing and scheduling for flow line productionJust-in-Time Planning and Lot-SizingModeling industrial lot sizing problems: a reviewExact solution approaches for the discrete lot-sizing and scheduling problem with parallel resourcesReformulation and a Lagrangian heuristic for lot sizing problem on parallel machinesIntegrative versus separate cycle scheduling heuristics for capacitated discrete lot sizing and sequencing problemsOn the discrete lot-sizing and scheduling problem with sequence-dependent changeover timesScheduling multiple products on parallel machines with setup costsSolving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windowsA forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problemLot sizing and scheduling -- survey and extensionsThe discrete lot-sizing and scheduling problem: Complexity and modification for batch availabilitySingle item lot sizing problemsHybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisionsThe single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming