The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
The Computational Complexities of Two Multi-purpose Machines Scheduling Problem with Setup Times
Author(s): 
Pages: 122-128
Year: Issue:  4
Journal: Operations Research Transactions

Keyword:  运筹学排序计算复杂性多项式时间算法多功能机安装时间滗;
Abstract: 提出需要安装时间的多功能机排序问题,一般情况下,这是NP-困难的;主要研究只有两台机器时一些特殊情况下的计算复杂性.根据加工集合为机器全集的工件组数的不同,分别给出多项式时间算法和分枝定界算法.对各工件组的工件数和加工时间都 相等的情况,给出一个多项式时间的最优算法一奇偶算法,从而证明此问题是多项式时间可解的.
Related Articles
No related articles found