FOR PRODUCTION PLANNERS, MACHINE SHOPS, OPERATIONS ENGINEERS AND STUDENTS

Which order should each machine run its jobs in?

Type each job's routing: the machines it visits, in order, and the time on each. The page finds the schedule that finishes the last job soonest (the makespan), draws it as a Gantt chart, and proves a lower bound no schedule can beat, so you can see how close it is. On small shops it proves the answer optimal. Free, and it runs in your browser.

How it works, and how it did on 162 published benchmark instances

1. Jobs and routings

One operation per line, job, machine, time, in the order the job visits the machines. Any time unit works (minutes, hours, shifts) if you use the same one throughout.

Also opens a CSV, a JSON shop, or an OR-Library, JSPLIB or Taillard instance file (paste one in the box too).

2. Search

The page stops early when it has proved the answer. The tab is busy while it searches.

3. Schedule

Load the example or type your jobs, then schedule them.

Makespan
–
Proved lower bound
–
Average machine use
–

Machines

MachineBusyIdleUseOrder (job#step)

Jobs

JobDone atWorkWaiting

Questions

What is job shop scheduling?

Each job is a list of operations that must run in a fixed order, each on a given machine for a given time. A machine runs one operation at a time. The question is the order each machine should take its operations in so that the whole set of jobs finishes as early as possible; that finishing time is the makespan.

Is the schedule optimal?

When the page says proved, yes: either the schedule meets a lower bound no schedule can beat, or (on small shops) an exhaustive search finished. Otherwise it shows the best schedule found and the proved lower bound, so you can see the largest possible gap. The how-it-works page lists how it did on 162 published benchmark instances.

Can I use standard benchmark files?

Yes. The page reads the OR-Library and JSPLIB format (a line with the job and machine counts, then one line per job of machine and time pairs, machines numbered from 0) and Taillard's format (times, then machines numbered from 1), as well as a plain job, machine, time table.

Is my shop data uploaded?

No. Every calculation runs in your browser. An optional anonymous counter in this browser's local storage records only that a schedule ran and the day.