Zobrazeno 1 - 2
of 2
pro vyhledávání: '"陈 恳"'
Publikováno v:
Journal of Nanchang University (Natural Science). Apr2020, Vol. 44 Issue 2, p187-192. 6p.
Autor:
陳懇億
91
In this thesis, we study the scheduling problem, F2||wiTi, of minimizing total weighted tardiness in a two-machine flowshop. This problem is already known to be NP-hard. To derive optimal solutions, we develop branch-and-bound algorithms.
In this thesis, we study the scheduling problem, F2||wiTi, of minimizing total weighted tardiness in a two-machine flowshop. This problem is already known to be NP-hard. To derive optimal solutions, we develop branch-and-bound algorithms.
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/30735515545370807552
