具有简单线性恶化加工时间的Flow shop调度问题

Flowshop Scheduling Problem Under Linear Deterioration

讨论工件具有简单线性恶化加工时间的FlowShop调度问题·对于两台机器目标函数为极小化最大完工时间的FlowShop调度问题 ,证明了利用Johnson规则可以求得最优调度·对于多台机器的一般FlowShop调度问题 ,如果工件在各机器上的加工时间均相等 ,目标函数为极小化最大完工时间或最大延误的问题可以转化为单机调度问题·如果目标函数为极小化完工时间和 ,则利用SPT规则可以求得最优调度·

The Flow shop scheduling problem under simple linear deterioration was considered. For the two machine flowshop scheduling Johnson′s rule yields optimal schedule to minimize makespan. If the processing time of job on each of the machines are equal for flowshop, the problem can be deduced to single machine scheduling problem when the objective is the makespan or the maximum lateness and the SPT rule is optimal to minimize the sum of completion times.