Operations scheduling: algorithm of Johnson
The algorithm of Johnson is applied for the problem of sequencing of N jobs
on two machines.
Upon completion of the algorithm a Gantt-chart is displayed.
|| index ob jobs
|| index of machines
||processing time of job j on machine i
- n jobs
- flow-shop with two
- deterministic processing
- objective: makespan
- Askin/Standridge (1993), Chapter 4