首页   按字顺浏览 期刊浏览 卷期浏览 Minimizing the Total Flow Time of n Jobs on a Network
Minimizing the Total Flow Time of n Jobs on a Network

 

作者: DAVID SIMCHI-LEVI,   ODED BERMAN,  

 

期刊: IIE Transactions  （Taylor Available online 1991）
卷期: Volume 23, issue 3  

页码: 236-244

 

ISSN:0740-817X

 

年代: 1991

 

DOI:10.1080/07408179108963858

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

This paper addresses the problem of determining a sequence for processing jobs on a machine, with sequence dependent setup times, such that the total flow time is minimized. The paper includes a branch and bound algorithm to find the optimal tour sequence.

 

点击下载:  PDF (485KB)



返 回