科研之友
微信
新浪微博
Facebook
分享链接
摘要
We consider a two-stage flexible flow shop problem with a single machine at one stage and m identical machines at the other stage, where the processing times of each job at both stages are identical. The objective is to minimize the makespan. We describe some optimality conditions and show that the problem is NP-hard when m is fixed. Finally, we present an approximation algorithm that has a worst-case performance ratio of for m=2 and for ma parts per thousand yen3.
- 出版日期2013-1
