The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times

DOI10.1016/j.cor.2003.08.014zbMath1071.90534MaRDI QIDQ706984

Diwakar Gupta, Thorkell Magnusson

Publication date: 9 February 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.08.014

zbMATH Keywords

Scheduling; Relaxation; Sequencing; Heuristic; Lot-sizing; Sequence-dependent

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Modeling industrial lot sizing problems: a review, Single machine multi-product capacitated lot sizing with sequence-dependent setups, A note on ``the capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times, Lot sizing and furnace scheduling in small foundries, Single item lot-sizing problem for a warm/cold process with immediate lost sales, Production planning problem with sequence dependent setups as a bilevel programming problem

Cites Work

• Unnamed Item
• The traveling salesman problem: An overview of exact and approximate algorithms
• The vehicle routing problem: An overview of exact and approximate algorithms
• Capacitated lot-sizing and scheduling by Lagrangean relaxation
• Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows
• MIP modelling of changeovers in production planning and scheduling problems
• Capacitated lot sizing under setup learning
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• A cutting plane approach to capacitated lot-sizing with start-up costs
• Capacitated lot-sizing with sequence dependent setup costs
• Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
• The Deterministic Dynamic Product Cycling Problem
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Bounds for Row-Aggregation in Linear Programming
• A framework for modelling setup carryover in the capacitated lot sizing problem
• LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
• Rounding Off to Powers of Two in Continuous Relaxations of Capacitated Lot Sizing Problems