Complexity of the ELSP with general cyclic schedules

被引：35

作者：

Gallego, G ^{[1
]}

Shaw, DX ^{[1
]}

机构：

[1] PURDUE UNIV,SCH IND ENGN,W LAFAYETTE,IN 47907

来源：

IIE TRANSACTIONS | 1997年 / 29卷 / 02期

关键词：

D O I：

10.1080/07408179708966318

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

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 Schedules (LICS), and Basic Period Cyclic Schedules (BPCS).

引用

页码：109 / 113

页数：5

共 11 条

[1]

[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness

[2] LOT SIZING AND SEQUENCING FOR N-PRODUCTS ON ONE FACILITY [J].

DELPORTE, CM ;

THOMAS, LJ .

MANAGEMENT SCIENCE, 1977, 23 (10) :1070-1079

[3] THE ECONOMIC LOT-SCHEDULING PROBLEM - ACHIEVING FEASIBILITY USING TIME-VARYING LOT SIZES [J].

DOBSON, G .

OPERATIONS RESEARCH, 1987, 35 (05) :764-771

[4] ITERATIVE PROCEDURE FOR SINGLE-MACHINE MULTI-PRODUCT LOT SCHEDULING PROBLEM [J].

DOLL, CL ;

WHYBARK, DC .

MANAGEMENT SCIENCE SERIES A-THEORY, 1973, 20 (01) :50-55

[5] ECONOMIC LOT SCHEDULING PROBLEM (ELSP) - REVIEW AND EXTENSIONS [J].

ELMAGHRABY, SE .

MANAGEMENT SCIENCE, 1978, 24 (06) :587-598

[6]

Gallego G., 1995, OPTIMIZATION IND, V3, P83

[7]

HANSSMANN F, 1962, OPERATIONS RES PRODU, P158

[8] A NOTE ON LINEAR-PROGRAMMING AND THE SINGLE-MACHINE LOT SIZE SCHEDULING PROBLEM [J].

HODGSON, TJ ;

NUTTLE, HLW .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1986, 24 (04) :939-943

[9] ON THE GENERAL FEASIBILITY TEST OF SCHEDULING LOT SIZES FOR SEVERAL PRODUCTS ON ONE MACHINE [J].

HSU, WL .

MANAGEMENT SCIENCE, 1983, 29 (01) :93-105

[10]

MAXWLL WL, 1964, NAV RES LOG, V11, P98

← 1 2 →