Batch scheduling to minimize maximum lateness

被引：43

作者：

Ghosh, JB ^{[1
]}

Gupta, JND ^{[1
]}

机构：

[1] BALL STATE UNIV,DEPT MANAGEMENT,MUNCIE,IN 47306

来源：

OPERATIONS RESEARCH LETTERS | 1997年 / 21卷 / 02期

关键词：

analysis of algorithms; dynamic programming; production/schedules;

D O I：

10.1016/S0167-6377(97)00028-X

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem. (C) 1997 Elsevier Science B.V.

引用

页码：77 / 80

页数：4

共 13 条

[1]

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

[2]

BAKER KR, 1994, ORSA TIMS M DETR

[3]

Bruno J., 1978, Foundations of Control Engineering, V3, P105

[4]

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