On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times

DOI10.1016/j.orl.2008.10.001zbMath1154.90552OpenAlexW2029395472MaRDI QIDQ1002081

Yves Dallery, Michel Minoux, Celine Gicquel

Publication date: 23 February 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.10.001

zbMATH Keywords

mixed-integer programminglot-sizingsetup timessequence-dependent setup costs

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items

Simultaneous lotsizing and scheduling problems: a classification and review of models, Multi-product valid inequalities for the discrete lot-sizing and scheduling problem, On discrete lot-sizing and scheduling on identical parallel machines, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, A new heuristic and an exact approach for a production planning problem, Unnamed Item

Cites Work

• Unnamed Item
• The discrete lot-sizing and scheduling problem
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• 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
• Lot sizing and scheduling -- survey and extensions
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
• Discrete Lotsizing and Scheduling by Batch Sequencing
• Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
• Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
• Some Extensions of the Discrete Lotsizing and Scheduling Problem
• Production Planning by Mixed Integer Programming