Discrete-time, economic lot scheduling problem on multiple, non-identical production lines
From MaRDI portal
Publication:421620
DOI10.1016/j.ejor.2011.05.053zbMath1237.90070OpenAlexW1967703211MaRDI QIDQ421620
Ramesh Bollapragada, Marco Ghirardi, Frederico Della Croce
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.05.053
Cites Work
- Unnamed Item
- Unnamed Item
- Capacitated lot-sizing with extensions: a review
- Lot sizing and scheduling -- survey and extensions
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems
- Single-Stage Resource Allocation and Economic Lot Scheduling on Multiple, Nonidentical Production Lines
- Economic Lot Scheduling for Multiple Products on Parallel Identical Processors
- The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes
- Computing Optimal Lot Sizes in the Economic Lot Scheduling Problem
- The Effect of Externalizing Setups in the Economic Lot Scheduling Problem
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- Planning and Scheduling in Manufacturing and Services
- Reduced production rates in the economic lot scheduling problem
- Scheduling Cyclic Production on Several Identical Machines
- On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
This page was built for publication: Discrete-time, economic lot scheduling problem on multiple, non-identical production lines
