Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
From MaRDI portal
Publication:2997890
DOI10.1080/00207543.2010.532927zbMath1211.90071OpenAlexW1992659515MaRDI QIDQ2997890
Celine Gicquel, Yves Dallery, Michel Minoux
Publication date: 10 May 2011
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207543.2010.532927
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
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, An evaluation of semidefinite programming based approaches for discrete lot-sizing problems, Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach
Cites Work
- The discrete lot-sizing and scheduling problem
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Optimal production scheduling for the dairy industry
- 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
- A linear description of the discrete lot-sizing and scheduling problem
- On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs
- The discrete lot-sizing and scheduling problem: Complexity and modification for batch availability
- Simultaneous lotsizing and scheduling on parallel machines
- Dynamic Version of the Economic Lot Size Model
- Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs
- Some Extensions of the Discrete Lotsizing and Scheduling Problem
- Efficient Algorithms for Shortest Paths in Sparse Networks
- A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times
- Dynamic Production Scheduling for a Process Industry
- Remarks on: “Some Extensions of the Discrete Lotsizing and Scheduling Problem”
- Rolling-horizon lot-sizing when set-up times are sequence-dependent
- Modeling industrial lot sizing problems: a review
- Production Planning by Mixed Integer Programming
