On discrete lot-sizing and scheduling on identical parallel machines
From MaRDI portal
Publication:691392
DOI10.1007/S11590-011-0280-8zbMATH Open1258.90038OpenAlexW1963598376MaRDI QIDQ691392FDOQ691392
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
Recommendations
Cites Work
- Modelling practical lot-sizing problems as mixed-integer programs
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Title not available (Why is that?)
- 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
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
- Improved lower bounds for the capacitated lot sizing problem with setup times.
- An Efficient Algorithm for Multi-Item Scheduling
- A linear description of the discrete lot-sizing and scheduling problem
- 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)