The economic lot scheduling problem without capacity constraints
From MaRDI portal
Publication:1772974
DOI10.1007/s10479-004-5033-yzbMath1119.90024MaRDI QIDQ1772974
Publication date: 22 April 2005
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-004-5033-y
90B35: Deterministic scheduling theory in operations research
90B80: Discrete location and assignment
Related Items
An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy, Economic lot scheduling problems incorporating a cost of using the production facility, A genetic algorithm for solving the economic lot scheduling problem in flow shops
Cites Work
- Unnamed Item
- Scheduling Economic Lot Size Production Runs
- The G-group heuristic for single machine lot scheduling
- Two heuristics for the economic lot scheduling problem: An experimental study
- The Economic Lot Scheduling Problem (ELSP): Review and Extensions
- On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
- A Note on the Joint Replenishment Problem under Constant Demand
- A Dynamic Programming Approach to a Lot Size Scheduling Problem
- Scheduling a Multi-Product Single Machine System
- The economic lot scheduling problem under power-of-two policy