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.
Symbols:
| j |
index ob jobs
|
| i |
index of machines |
| Mi |
machine i |
| t(j,i) |
processing time of job j on machine i |
Assumption:
- n jobs
- flow-shop with two
machines
- deterministic processing
times
- objective: makespan
minimization
Literature:
- Askin/Standridge (1993), Chapter 4
|
