StevenSun2014/fjssp

The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machines, such that the maximal completion time (makespan) of all operations is minimized.

语言：Java · GitHub 星标：19 · Fork：8

在 GitHub 上查看原仓库