调整时间可分离的无等待Flow Shop调度问题

No-Wait Flow Shop Scheduling Problems with Set-up Time Separated

研究了 3台机器调整时间可分离的无等待FlowShop调度问题 ,目标函数为极小化加权完工时间和·基于对问题的分析 ,给出了目标函数的一般表示·对某些特殊情况 ,给出了问题存在多项式最优算法的充分条件·在此条件下 ,将单机调度问题的WSPT规则应用到无等待FlowShop调度问题 ,得到了求解无等待FlowShop问题最优调度的分派规则·通过反例指出了文献中的某些错误·

Three-machine no-wait flow shop scheduling problem with set-up time separated was studied. Based on the analysis of the problem, the general expression of objective is given. For some special cases the sufficient condition is presented in which the problem can be solved by polynomial algorithm. Under this condition the WSPT rule of single machine scheduling problem can be used for no-wait flow shop scheduling problem to get the dispatching rules. The errors in a journal paper were pointed out by counter examples with present model.