SEQUENCING AND BATCHING FOR TWO CLASSES OF JOBS WITH DEADLINES AND SETUP TIMES
作者:
DAVID L. WOODRUFF,
MARK L. SPEARMAN,
期刊:
Production and Operations Management
(WILEY Available online 1992)
卷期:
Volume 1,
issue 1
页码: 87-102
ISSN:1059-1478
年代: 1992
DOI:10.1111/j.1937-5956.1992.tb00341.x
出版商: Blackwell Publishing Ltd
关键词: SEQUENCING;TABU SEARCH
数据来源: WILEY
摘要:
We formulate a general sequencing problem that includes two classes of jobs with setup times, setup costs, holding costs, and deadlines. The formulation is unique in its explicit recognition of the opportunities to exploit productive capacity increases due to batching. An algorithm based on tabu search is then used as a solution method. Computational results are presented that suggest that the algorithm is effective.
点击下载:
PDF
(341KB)
返 回