首页   按字顺浏览 期刊浏览 卷期浏览 Two-Machine Super-Shop Scheduling Problem
Two-Machine Super-Shop Scheduling Problem

 

作者: StrusevichV. A.,  

 

期刊: Journal of the Operational Research Society  （Taylor Available online 1991）
卷期: Volume 42, issue 6  

页码: 479-492

 

ISSN:0160-5682

 

年代: 1991

 

DOI:10.1057/jors.1991.96

 

出版商: Taylor&Francis

 

关键词: shop scheduling;pre-emptive and non-pre-emptive scheduling;polynomial-time algorithms

 

数据来源: Taylor

 

摘要:

AbstractThe paper introduces the two-machine super-shop scheduling problem to minimize makespan. The well-known flow-shop, open-shop, job-shop and mixed-shop scheduling problems are special cases of our model. A polynomial-time algorithm to find both pre-emptive and non-pre-emptive optimal schedules is described.

 

点击下载:  PDF (3668KB)



返 回