Optimal algorithms for the no-wait flowshop scheduling problem with discount weights

This paper discusses the no-wait flowshop scheduling problem, whose objective function is the 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 provided.