Minimizing total tardiness on a batch processing machine with incompatible job families
作者:
SANJAYV. MEHTA,
REHA UZSOY,
期刊:
IIE Transactions
(Taylor Available online 1998)
卷期:
Volume 30,
issue 2
页码: 165-178
ISSN:0740-817X
年代: 1998
DOI:10.1080/07408179808966448
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
Motivated by an application in semiconductor manufacturing, we study the problem of minimizing total tardiness on a batch processing machine with incompatibl8e 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.
点击下载:
PDF (1574KB)
返 回