Two-stage proportionate flexible flow shop to minimize the makespan

作     者：Choi, Byung-Cheon Lee, Kangbok 

作者机构：Chungnam Natl Univ Dept Business Adm Taejon 305704 South Korea Rutgers State Univ Rutgers Business Sch Dept Supply Chain Management & Mkt Sci Newark NJ 07102 USA 

出 版 物：《JOURNAL OF COMBINATORIAL OPTIMIZATION》 (组合优化杂志)

年 卷 期：2013年第25卷第1期

页      面：123-134页

核心收录：

学科分类：12[管理学] 120202[管理学-企业管理（含：财务管理、市场营销、人力资源管理）] 0202[经济学-应用经济学] 02[经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Scheduling Proportionate flexible flow shop Computational complexity Approximation algorithm 

摘      要：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.