ON THE COMPLEXITY OF SCHEDULING WITH BATCH SETUP TIMES

被引：236

作者：

MONMA, CL ^{[1
]}

POTTS, CN ^{[1
]}

机构：

[1] UNIV SOUTHAMPTON,MATH STUDIES,SOUTHAMPTON SO9 5NH,HANTS,ENGLAND

来源：

OPERATIONS RESEARCH | 1989年 / 37卷 / 05期

关键词：

D O I：

10.1287/opre.37.5.798

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：798 / 804

页数：7

共 10 条

[1]

BRUNO J, 1978, SIAM J COMPUT, V7, P393, DOI 10.1137/0207031

[2] SCHEDULING INDEPENDENT TASKS TO REDUCE MEAN FINISHING TIME [J].

BRUNO, J ;

COFFMAN, EG ;

SETHI, R .

COMMUNICATIONS OF THE ACM, 1974, 17 (07) :382-387

[3]

Conway R, 1967, THEORY SCHEDULING

[4]

Lawler E. L., 1985, TRAVELING SALESMAN P

[5] FUNCTIONAL EQUATION AND ITS APPLICATION TO RESOURCE ALLOCATION AND SEQUENCING PROBLEMS [J].

LAWLER, EL ;

MOORE, JM .

MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 16 (01) :77-84

[6]

Lenstra J.K., 1977, ANN DISCRETE MATH, V1, P343, DOI [/10.1016/S0167-5060(08)70743-X, DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]

[7] SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS [J].

MCNAUGHTON, R .

MANAGEMENT SCIENCE, 1959, 6 (01) :1-12

[8]

Monma C. L., 1979, Mathematics of Operations Research, V4, P215, DOI 10.1287/moor.4.3.215

[9] OPTIMAL SEQUENCING VIA MODULAR DECOMPOSITION - CHARACTERIZATION OF SEQUENCING FUNCTIONS [J].

MONMA, CL ;

SIDNEY, JB .

MATHEMATICS OF OPERATIONS RESEARCH, 1987, 12 (01) :22-31

[10] SINGLE-SERVER, 2-MACHINE SEQUENCING WITH SWITCHING TIME [J].

SAHNEY, VK .

OPERATIONS RESEARCH, 1972, 20 (01) :24-&

← 1 →