Equivalence classes of problem instances for a continuous-time lot sizing and scheduling problem
From MaRDI portal
Publication:1042113
DOI10.1016/j.ejor.2008.11.006zbMath1176.90251OpenAlexW2021089699MaRDI QIDQ1042113
Herbert Jodlbauer, Andreas Weidenhiller
Publication date: 7 December 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.11.006
Related Items
Multi-objective optimization of integrated lot-sizing and scheduling problem in flexible job shops ⋮ 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
- Deterministic lotsizing models for production planning
- Lot sizing and scheduling -- survey and extensions
- The general lotsizing and scheduling problem
- An optimal production flow control problem with piecewise constant demand
- An approach for integrated scheduling and lot-sizing
- Dynamic Version of the Economic Lot Size Model
- A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
- Computational Complexity of the Capacitated Lot Size Problem
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- Discrete event control of production flows: Make-to-stock and make-toorder environments
- Maximum principle-based methods for production scheduling with partially sequence-dependent setups
- On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
- Optimal production and setup scheduling: A one-machine, two-product system
