Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
From MaRDI portal
Publication:732896
DOI10.1016/j.cor.2009.05.007zbMath1175.90142OpenAlexW2076538930MaRDI QIDQ732896
Youngho Lee, Seong-In Kim, Junghee Han, Eun Kyung Park
Publication date: 15 October 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.05.007
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items (3)
Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ A heuristic based on mathematical programming for a lot-sizing and scheduling problem in mold-injection production ⋮ Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
Cites Work
- The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
- The general lotsizing and scheduling problem
- Simultaneous lotsizing and scheduling on parallel machines
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- Single item lot-sizing problem for a warm/cold process with immediate lost sales
- Modeling of period overlapping setup times
- The Capacitated Lot-Sizing Problem with Linked Lot Sizes
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- A modified framework for modelling set-up carryover in the capacitated lotsizing problem
- Multiperiod production planning carrying over set-up time
- Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling
- Single machine multi-product capacitated lot sizing with sequence-dependent setups
This page was built for publication: Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum
