Production and Operations Management Consulting.
Operations scheduling: algorithm of Johnson
The algorithm of Johnson is applied for the problem of sequencing of N jobs on two machines.
|j||index ob jobs|
|i||index of machines|
|t(j,i)||processing time of job j on machine i|
- n jobs
- flow-shop with two machines
- deterministic processing times
- objective: makespan minimization
- Askin/Standridge (1993), Chapter 4