When is The Economic Lot Scheduling Problem easy?

When is The Economic Lot Scheduling Problem easy?

0.00 Avg rating0 Votes
Article ID: iaor1988910
Country: United States
Volume: 21
Issue: 1
Start Page Number: 11
End Page Number: 20
Publication Date: Mar 1989
Journal: IIE Transactions
Authors: ,
Keywords: production, scheduling
Abstract:

The Economic Lot Scheduling Problem, common in industry and the literature as well, is NP-hard and remains unsolved in general. The authors show that the very simple Rotation Cycle scheduling rule produces optimal or nearly optimal schedules in very many realistic situations and they give upper bounds for the maximum percentage deviation of the Rotation Cycle’s schedule from optimality. An implication for Group Technology is discussed.

Reviews

Required fields are marked *. Your email address will not be published.