Single Machine Multiple Machine Job Shop Flow Shop EXIT 3/6
SCHEDULER DEMO

Now to find the minimum makespan in this scenario,

  • set the Objective to Minimize Makespan
  • select the desired algorithm
  • and Click on Solve Problem
We can see the Minimum Makespan was 20.08 units and the algorithm we chose was List Scheduling by the Shortest Processing Times. If unsatisfied with the results we could always try out other algorithms or a random permutation.