Flow shop scheduling with late work criterion - Choosing the best solution strategy

Abstract

In the paper, we analyze different solution methods for the two-machine flow shop scheduling problem with a common due date with the weighted late work criterion, i.e. F2 | di = d | Yw, which is known to be NP-hard. In computational experiments, we compared the practical efficiency of a dynamic programming approach, an enumerative method and heuristic procedures. Test results showed that each solution method has its advantages and it cannot be rejected from the consideration a priori. © Springer-Verlag 2004.