Job sequencing on 3 machines.

Two conditions for a easy solution:

1. The smallest duration on machine #1 is at
least as great as the largest duration on machine
#2.
2. The smallest duration on machine #3 is at
least as great as the largest duration on machine
#2.

Conditions for an easy solution:

T1,smallest >= T2,largest
AND/OR
T3,smallest >= T2,largest

The easy solution: how-to...

Add: T1 + T2 & T2 + T3
Use these sums to do
Johnsons rule.

Example: 3 machines
Job
B
A
C
D

Duration (hrs.)
Mach 1 Mach 2
5
3
13
5
6
4
7
2

Mach 3
7
9
5
6

Example: 3 machines
One of the conditions is met.

Job
A
B
C
D

Duration (hrs.)
Mach 1 Mach 2
13
5
5
3
6
4
7
2

Mach 3
9
7
5
6

Example: 3 machines
Job
A
B
C
D

Duration (hrs.)
Mach 1+2
Mach 2+3
13+5
5+9
5+3
3+7
6+4
4+5
7+2
2+6

Example: 3 machines
Job
A
B
C
D

Duration (hrs.)
Mach 1+2
Mach 2+3
18
14
8
10
10
9
9
8

Example: 3 machines
Job
A
B
C
D

Duration (hrs.)
Mach 1+2
Mach 2+3
18
14
8 B goes first. 10
10
9
9
8

Example: 3 machines
Job
B
A
C
D

Duration (hrs.)
Mach 1+2
Mach 2+3
8
10
18
14
10
9
9 D goes last. 8

Example: 3 machines
Job
B
A
C
D

Duration (hrs.)
Mach 1+2
Mach 2+3
8
10
18
14
10
9 C goes next-to-last.
9
8

Example: 3 machines
Job
B
A
C
D

Duration (hrs.)
Mach 1+2
Mach 2+3
8
10
18
14 B goes 3rd-to-last.
10
9
9
8

Ex: 3 machines: Gantt Chart

Duration (hrs.)
Job Mach 1 Mach 2
B5 3
7
A 13 5
9
C6 4
5
D7 2
6

Mach 3

Time (hrs.) =>

B
B
B

Ex: 3 machines: Gantt Chart

Duration (hrs.)
Job Mach 1 Mach 2
B5 3
7
A 13 5
9
C6 4
5
D7 2
6

Mach 3

Time (hrs.) =>

B

A
B

A
B

Ex: 3 machines: Gantt Chart

Duration (hrs.)
Job Mach 1 Mach 2
B5 3
7
A 13 5
9
C6 4
5
D7 2
6

Mach 3

Time (hrs.) =>

B

A
B
B

C
A

C
A

Ex: 3 machines: Gantt Chart

Duration (hrs.)
Job Mach 1 Mach 2
B5 3
7
A 13 5
9
C6 4
5
D7 2
6

Mach 3

Time (hrs.) =>

B

A
B
B

C
A

D
C

D
A

Ex: 3 machines: Gantt Chart

Duration (hrs.)
Mach 1 Mach 2
5
3
13
5
6
4
7
2

Job
B
A
C
D
5

15
A

B
B

24
23

18
C
A

Mach 3
7
9
5
6

31

43

33

37

28
32
D
C

D
A