排序方式： 共有1条查询结果，搜索用时 156 毫秒
1
1.
T. C. EDWIN CHENG CHELLIAH SRISKANDARAJAH GUOQING WANG 《Production and Operations Management》2000,9(4):367-378
In this paper we study the time complexities of some two‐ and three‐stage no‐wait flowshop makespan scheduling problems where, in some stage, all the jobs require a constant processing time and the stage may consist of parallel identical machines. Polynomial time algorithms are presented for certain problems, while several others are proved to be strongly NP‐complete. 相似文献
1