Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum

DOI10.1016/J.COR.2009.05.007zbMATH Open1175.90142OpenAlexW2076538930MaRDI QIDQ732896FDOQ732896

Authors: Seong-In Kim, Junghee Han, Youngho Lee, 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

Recommendations

• A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
• Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Lot sizing and scheduling -- survey and extensions
• A horizon decomposition approach for the capacitated lot-sizing problem with setup times

zbMATH Keywords

heuristiclot-sizing and schedulingproduction system

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Cites Work

• The general lotsizing and scheduling problem
• Simultaneous lotsizing and scheduling on parallel machines
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• Rolling-horizon lot-sizing when set-up times are sequence-dependent
• Single machine multi-product capacitated lot sizing with sequence-dependent setups
• The capacitated lot-sizing problem with linked lot sizes
• The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times
• Single item lot-sizing problem for a warm/cold process with immediate lost sales
• A modified framework for modelling set-up carryover in the capacitated lotsizing problem
• Multiperiod production planning carrying over set-up time
• Modeling of period overlapping setup times
• Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling

Cited In (4)

• 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
• Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
• Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach

This page was built for publication: Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732896)