Heuristic approaches to solve the NP-hard P || C_max scheduling problem.
Partially based on Minimizing the Makespan in Nonpreemptive Parallel Machine Scheduling Problem by Giampiero Chiaselotti et al.
- CPLEX (latest - academic license)
Build -> Build Artifacts -> MakespanMinimizer.jar
$ java -jar -Djava.library.path="/opt/ibm/ILOG/CPLEX_Studio1210/opl/bin/x86-64_linux/" MakespanMinimizer.jar res/instances/S0/PCMAX_NU_1_0010_05_0.txt res/solutions 8 180 995