无等待Flowshop带折扣加权排序问题的最优算法

The optimal algorithms of the no-wait flowshop scheduling problem with discount weight

讨论了目标函数为带折扣的加权总完工时间的无等待Flowshop排序问题,对其中三种特殊情况给出了最优算法.第一种问题是机器满足单调递增优势关系,第二种问题是机器满足单调递减优势关系,第三种是机器满足先递增、后递减的优势关系.

This paper dicusses the nowait flowshop scheduling problem,whose objective function is minimum sum of completion times with discount weight.The first problem assumes an increasing series of dominating machine.The second problem assumes a decreasing series of dominating machine.The last problem assumes an increasingdecreasing series of dominating machines.In this paper,optimal algorithms of above problems are approached respectively.