首页   按字顺浏览 期刊浏览 卷期浏览 An Empirical Evaluation of the “Entrapment” Procedure for Scheduling Jobs...
An Empirical Evaluation of the “Entrapment” Procedure for Scheduling Jobs on Identical Machines

 

作者: EugeneN. Vasilescu,   AmarDev Amar,  

 

期刊: IIE Transactions  （Taylor Available online 1983）
卷期: Volume 15, issue 3  

页码: 261-263

 

ISSN:0740-817X

 

年代: 1983

 

DOI:10.1080/05695558308974643

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

This work empirically evaluates the “entrapment” procedure used by Barnes and Brennan's branch-and-bound algorithm to minimize total cost of tardy jobs to be processed on identical machines. Using 25 problems taken from various known sources, it is shown that entrapment does not necessarily decrease computational time required to optimally solve such a problem.

 

点击下载:  PDF (160KB)



返 回