Modeling of period overlapping setup times

DOI10.1016/j.ejor.2005.03.033zbMath1175.90149OpenAlexW2109270409MaRDI QIDQ2503060

Christopher Suerie

Publication date: 13 September 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.033

zbMATH Keywords

mixed integer programmingproduction planninglot-sizingsetup timesprocess industries

Mathematics Subject Classification ID

Mixed integer programming (90C11) Management decision making, including multiple objectives (90B50) Production models (90B30)

Related Items

Simultaneous lotsizing and scheduling problems: a classification and review of models ⋮ Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups ⋮ New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups ⋮ Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity ⋮ Multi-stage simultaneous lot-sizing and scheduling for flow line production ⋮ Multi-level single machine lot-sizing and scheduling with zero lead times ⋮ Modeling industrial lot sizing problems: a review ⋮ Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups ⋮ Decomposition based heuristic algorithm for lot-sizing and scheduling problem treating time horizon as a continuum ⋮ Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over ⋮ A multi-stage stochastic programming model of lot-sizing and scheduling problems with machine eligibilities and sequence-dependent setups

Cites Work

• Unnamed Item
• The discrete lot-sizing and scheduling problem
• Lotsizing and scheduling for production planning
• The Changeover Scheduling Problem with Time and Cost Considerations: Analytical Results and a Forward Algorithm
• The Capacitated Lot-Sizing Problem with Linked Lot Sizes
• From EOQ Towards ZI
• A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
• Multiperiod production planning carrying over set-up time
• An effective heuristic for the CLSP with set-up times