TY - JOUR
T1 - Complexity of the ELSP with general cyclic schedules
AU - Gallego, Guillermo
AU - Shaw, Dong Xiao
PY - 1997
Y1 - 1997
N2 - We show that the Economic Lot Schedule Problem (ELSP) is NP-hard in the strong sense under General Cyclic Schedules (GSC), Zero-Inventory Cyclic Schedules (ZICS), Time-Invariant Cyclic Schedules (TICS), Lot-Invariant Cyclic ScheduJes (LICS), and Basic Period Cyclic Schedules (BPCS).
AB - We show that the Economic Lot Schedule Problem (ELSP) is NP-hard in the strong sense under General Cyclic Schedules (GSC), Zero-Inventory Cyclic Schedules (ZICS), Time-Invariant Cyclic Schedules (TICS), Lot-Invariant Cyclic ScheduJes (LICS), and Basic Period Cyclic Schedules (BPCS).
UR - https://www.webofscience.com/wos/woscc/full-record/WOS:A1997WL62100003
UR - https://openalex.org/W2061448520
U2 - 10.1023/A:1018598507591
DO - 10.1023/A:1018598507591
M3 - Journal Article
SN - 0740-817X
VL - 29
SP - 109
EP - 113
JO - IIE Transactions (Institute of Industrial Engineers)
JF - IIE Transactions (Institute of Industrial Engineers)
IS - 2
ER -
