Complexity of the Economic Lot Schedule Problem with general cyclic schedules

Complexity of the Economic Lot Schedule Problem with general cyclic schedules

0.00 Avg rating0 Votes
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: ,
Keywords: complexity
Abstract:

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.

Reviews

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