Minimizing total tardiness on a batch processing machine with incompatible job families

被引:119
|
作者
Mehta, SV
Uzsoy, R
机构
[1] I2 Technol, Irving, TX 75039 USA
[2] Purdue Univ, Sch Ind Engn, W Lafayette, IN 47907 USA
基金
美国国家科学基金会;
关键词
D O I
10.1080/07408179808966448
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Motivated by an application in semiconductor manufacturing, we study the problem of minimizing total tardiness on a batch processing machine with incompatible job families, where all jobs of the same family have identical processing times and jobs of different families cannot be processed together. We present a dynamic programming algorithm which has polynomial time complexity when the number of job families and the batch machine capacity are fixed. We also examine various heuristic solution procedures which can provide near optimal solutions in a reasonable amount of computation time.
引用
收藏
页码:165 / 178
页数:14
相关论文
共 50 条