无空闲Flowshop带折扣加权排序的算法

The algorithms of the no-idle Flowshop scheduling problem with discounted weight

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

This paper discusses the noidle permutation Flowshop scheduling problem,whose objective function is the weighted total completion time with discounted factor.Optimal algorithms for four special cases are discussed respectively.The first problem assumes an increasing series of dominant machines.The second problem assumes a decreasing series of dominant machines.The third problem assumes a decreasing then increasing series of dominant machines.The last problem assumes an increasingdecreasing series of dominant machines.