【摘要】 文章讨论了m台机器的Flow Shop成组加工问题,工件在不同机器上的加工时间以相同的系数(斜率)线性恶化,目标函数分别为极小化时间表长和总完工时间.对于目标函数为极小化时间表长的Flow Shop成组加工问题,再进一步细分为组间无调整时间和组间有相同调整时间的两种情形来讨论,都得到了最优调度(排序).对于目标函数为总完工时间的Flow Shop成组加工问题,只要组内按q(?)单调递增(SPT)序加工,组间按S_i单调递增序加工可得最优调度.更多还原

【Abstract】 This paper concerns a scheduling problem in m flow shop with job grouping,which have identical linear deterioration rate.The objective function is to minimize the makespan and the total completion times.For the former, we study two sub-problems,without setup time for any group and with a setup time for each group,respectively.For the latter,we process the jobs in the same group according to the non-decreasing order of gqij,and to the non- decreasing order of Si to decide which group is processed with priority.更多还原