Chung, Chia-Shin; Flynn, James; Walter, Rom; Staliński, Piotr
(Nowy Sacz School of Business – National-Louis University, 2012)
The m-machine, n-job, permutation flowshop problem with the total tardiness objective
is a common scheduling problem, known to be NP-hard. Branch and bound, the usual
approach to finding an optimal solution, experiences ...