首页   按字顺浏览 期刊浏览 卷期浏览 Myopic heuristics for single machine scheduling problems
Myopic heuristics for single machine scheduling problems

 

作者: S.BADIR BESHARA,   M. J. MAGAZINE,  

 

期刊: International Journal of Production Research  (Taylor Available online 1981)
卷期: Volume 19, issue 1  

页码: 85-95

 

ISSN:0020-7543

 

年代: 1981

 

DOI:10.1080/00207548108956631

 

出版商: Taylor & Francis Group

 

数据来源: Taylor

 

摘要:

For many years difficult combinatorial problems, such as scheduling problems, have been solved by the practitioner with heuristics. We suggest in this paper how to determine for which problems heuristics should be developed and, for a class of these problems, how to develop these procedures naturally. These results are motivated by theoretical results in computer science. The suggestion is numerically tested on a particular single machine scheduling problem.

 

点击下载:  PDF (376KB)



返 回