Machines are capped at a minimum of 3 — see the note below.
Current solution
Sequence — this is the solution
Proposed
Drag a chip, or use ◀▶.
Gantt chart
Hatched = the part of a job running past its due date. ▾ on the bottom lane = due dates.
Move the chips above. Every ordering is a legal schedule — there is nothing you can break.
Watch the Gantt and the four objectives change as you go.
FCFS = job number · SPT = shortest total processing time · LPT = longest · EDD = earliest due date.
Ties go to the lower job number.
Hill climbing: evaluate every neighbour, take the best one that improves. Stop when none does. Propose a move shows you one neighbour at a time — use ◀▶ to look through the whole neighbourhood on the Gantt before you Accept or Reject.
Draw a random sequence, score it, keep the best one seen. Draw one sequence shows you the draw on the Gantt before it counts — you decide whether to keep it.
Results so far
Click a row to load that sequence.
Best found vs solutions evaluated
Local search falls fast then flattens. Random search wanders and never catches up.