On discrete lot-sizing and scheduling on identical parallel machines

DOI10.1007/s11590-011-0280-8zbMath1258.90038OpenAlexW1963598376MaRDI QIDQ691392

Celine Gicquel, Michel Minoux, Laurence A. Wolsey

Publication date: 30 November 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0280-8

zbMATH Keywords

valid inequalitiesidentical parallel machinesreformulationdiscrete lot-sizing and scheduling

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, MIP formulations and heuristics for two-level production-transportation problems

Cites Work

• Unnamed Item
• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
• 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
• A linear description of the discrete lot-sizing and scheduling problem
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• Valid Inequalities for the Lasdon-Terjung Production Model
• An Efficient Algorithm for Multi-Item Scheduling