On discrete lot-sizing and scheduling on identical parallel machines

DOI10.1007/S11590-011-0280-8MaRDI QIDQ691392zbMATH OpenOpenAlexFDO

Authors C. Gicquel, Laurence A. Wolsey, Michel Minoux

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

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

Recommendations

• The discrete lot-sizing and scheduling problem
• scientific article; zbMATH DE number 4197717
• A linear description of the discrete lot-sizing and scheduling problem
• Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
• Lot-sizing with start-up times

Cites work

• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• A linear description of the discrete lot-sizing and scheduling problem
• An Efficient Algorithm for Multi-Item Scheduling
• Improved lower bounds for the capacitated lot sizing problem with setup times.
• Modelling practical lot-sizing problems as mixed-integer programs
• On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
• On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• 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
• Valid Inequalities for the Lasdon-Terjung Production Model

Cited in

(5)

• Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
• Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
• MIP formulations and heuristics for two-level production-transportation problems
• An exact framework for the discrete parallel machine scheduling location problem
• Simultaneous lotsizing and scheduling problems: a classification and review of models

This page was built for publication: On discrete lot-sizing and scheduling on identical parallel machines

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