| Article ID: | iaor20041000 |
| Country: | United States |
| Volume: | 29 |
| Issue: | 2 |
| Start Page Number: | 109 |
| End Page Number: | 113 |
| Publication Date: | Feb 1997 |
| Journal: | IIE Transactions |
| Authors: | Gallego Guillermo, Shaw Dong Xiao |
| Keywords: | complexity |
We show that the Economic Lot Schedule Problem is NP-hard in the strong sense under General Cyclic Schedules, Zero-Inventory Cyclic Schedules, Time-Invariant Cyclic Schedules, Lot-Invariant Cyclic Schedules, and Basic Period Cyclic Schedules.