SCHEDULING WITH BATCHING - MINIMIZING THE WEIGHTED NUMBER OF TARDY JOBS

被引：42
|
作者：
HOCHBAUM, DS [1 ]
LANDY, D [1 ]
机构：
[1] UNIV CALIF BERKELEY,SCH BUSINESS ADM,BERKELEY,CA 94720
来源：
OPERATIONS RESEARCH LETTERS | 1994年 / 16卷 / 02期
关键词：
SEMICONDUCTOR MANUFACTURING; PSEUDO-POLYNOMIAL ALGORITHMS; BATCH SCHEDULING;
D O I：
10.1016/0167-6377(94)90063-9
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The weighted tardiness with batching (WTB) problem can be briefly described as follows: given n jobs, each with a processing time, a weight, and a due date, and given a batch setup time, find a sequence of batches that minimizes the weighted number of tardy jobs. We show that the decision version of WTB is NP-complete, but that it can be solved in pseudo-polynomial time by a dynamic programming algorithm. We also analyze various restricted versions of the problem generated by requiring that one or more of the job parameters (weight, processing time, or due date) is the same for all jobs. For each such version of the problem, we prove NP-completeness or provide a polynomial algorithm.
引用
收藏
页码：79 / 86
页数：8
相关论文
共 50 条
12345