[EN] The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many ...
Vallada Regalado, Eva; Ruiz García, Rubén; Framinan, Jose M.(Elsevier, 2015-02-01)
[EN] In this work a new benchmark of hard instances for the permutation flowshop scheduling problem with
the objective of minimising the makespan is proposed. The new benchmark consists of 240 large instances and 240 small ...