Journal article
When Is The Economic Lot Scheduling Problem Easy?
IIE transactions, Vol.21(1), pp.11-20
03/01/1989
DOI: 10.1080/07408178908966202
Abstract
The Economic Lot Scheduling Problem, common in industry and the literature as well, is NP-hard and remains unsolved in general. We show 'that the very simple Rotation Cycle scheduling rule produces optimal or nearly optimal schedules in very many realistic situations and we give upper bounds for the maximum percentage deviation of the Rotation Cycle's schedule fro m optimality. An implication for Group Technology is discussed.
Details
- Title: Subtitle
- When Is The Economic Lot Scheduling Problem Easy?
- Creators
- PHILIP C. Jones - Northwestern UniversityROBERT R. Inman - Auburn University
- Resource Type
- Journal article
- Publication Details
- IIE transactions, Vol.21(1), pp.11-20
- DOI
- 10.1080/07408178908966202
- ISSN
- 0740-817X
- eISSN
- 1545-8830
- Publisher
- Taylor & Francis Group
- Number of pages
- 10
- Language
- English
- Date published
- 03/01/1989
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963120502771
Metrics
1 Record Views