Efficient heuristics for the weighted tardiness distributed permutation flowshop scheduling problem
In this paper, we consider the distributed permutation flowshop scheduling problem with a total weighted tardiness objective. Our focus is on dispatching rules, which are widely used in practical settings and can quickly provide solutions for even quite large instances. We consider a total of 23 dispatching rules. Twel...