85
Views
56
CrossRef citations to date
0
Altmetric
Original Articles

When Is The Economic Lot Scheduling Problem Easy?

&
Pages 11-20 | Received 01 Mar 1987, Published online: 31 May 2007
 

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.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.