Five jobs are to be processed on machines A and B in that

order. The processing times in hours are given in the table.

Determine the sequence that minimizes the total elapsed
time and the corresponding total time to process both the
jobs, and also the idle times.

Machine A
Job Machine A Machine B Sequence Ti Tp To
1 10 4 1 0 10 10
2 6 1 2 10 6 16
3 2 8 3 16 2 18
4 3 7 4 18 3 21
5 9 5 5 21 9 30

Machine A
Job Machine A Machine B Sequence Ti Tp To
1 10 4 3 0 2 2
2 6 1 4 2 3 5
3 2 8 5 5 9 14
4 3 7 1 14 10 24
5 9 5 2 24 6 30

johnson rule
 Machine B Hours
Ti Tp To Total time to process all the jobs 38
10 4 14 Total processing time - Machine 1 30
16 1 17 Total processing time - Machine 2 25
18 8 26 Total idle time - Machine 1 8
26 7 33 Total idle time - Machine 2 13
33 5 38

Machine B Hours
Ti Tp To Total time to process all the jobs 31
2 8 10 Total processing time - Machine 1 30
10 7 17 Total processing time - Machine 2 25
17 5 22 Total idle time - Machine 1 1
24 4 28 Total idle time - Machine 2 6
30 1 31
The Morris Machine Company just received an order to refurbish five
motors for materials handling equipment that were damaged in a fire. The
motors have been delivered and are available for processing. The motors
will be repaired at two workstations in the following manner.
Workstation 1: Dismantle the motor and clean the parts.
Workstation 2: Replace the parts as necessary, test the motor, and make
adjustments.
The plant manager is interested in developing a schedule that minimizes
the makespan and has authorized around-the-clock operations until the
motors have been repaired. The estimated time to repair each motor is
shown in the following table:

Motor Workstation 1 Workstation 2

1 12 22
2 4 5
3 5 3
4 15 16
5 10 8
Sequence Tin Tp Tou Tin Tp Tou
1 0 12 12 12 22 34
2 12 4 16 34 5 39
3 16 5 21 39 3 42
4 21 15 36 42 16 58
5 36 10 46 58 8 66

Sequence Tin Tp Tou Tin Tp Tou

2 0 4 4 4 5 9
1 4 12 16 16 22 38
4 16 15 31 38 16 54
5 31 10 41 54 8 62
3 41 5 46 62 3 65

Sequence Tin Tp Tou Tin Tp Tou

2 0 4 4 4 5 9
1 4 12 16 16 22 38
4 16 15 31 38 16 54
5 31 10 41 54 8 62
3 41 5 46 62 3 65
 Hours
Total time to process all the jobs 66
Total processing time - Machine 1 46
Total processing time - Machine 2 54
Total idle time - Machine 1 20
Total idle time - Machine 2 12

Hours
Total time to process all the jobs 65
Total processing time - Machine 1 46
Total processing time - Machine 2 54
Total idle time - Machine 1 19
Total idle time - Machine 2 11

Hours
Total time to process all the jobs 65
Total processing time - Machine 1 46
Total processing time - Machine 2 54
Total idle time - Machine 1 19
Total idle time - Machine 2 11
 Henry Miller, the author has completed writing his latest book and is
proposing typing and proofing the chapters. The estimated time for the two
processes are given in the Table. Obtain the optimum sequence for processing
the Chapters through the two processes.
Determine what effect splitting a job would have on the idle time and on the
total time.
Assume that each job can be split into two equal parts.

Chapter Typing time, min Proofing time, min

1 40 20
2 70 35
3 60 15
4 45 30
5 75 60
6 50 25

Typing
Chapter
Chapter Typing time, min Proofing time, min Ti
Sequence Sequence
1 1 40 20
2 2 70 35
3 3 60 15
4 4 45 30
5 5 75 60
6 6 50 25

Typing
Chapter
Chapter Typing time, min Proofing time, min Ti
Sequence Sequence
1 1 40 20
2 2 70 35
3 3 60 15
4 4 45 30
5 5 75 60
6 6 50 25
 ook and is
d time for the two
uence for processing

le time and on the

Typing Proofing

Tp To Ti Tp To Total time to process all the jobs

Total processing time - Machine 1

Total processing time - Machine 2

Total idle time - Machine 1

Total idle time - Machine 2

Typing Proofing

Tp To Ti Tp To Total time to process all the jobs

Total processing time - Machine 1

Total processing time - Machine 2

Total idle time - Machine 1

Total idle time - Machine 2

Hours

Hours

0
Six jobs are to be processed through a two-step operation. The first
operation involves sanding, and the second involves painting.
Processing times are as follows. Determine a sequence that will
minimize the total completion time for these jobs. Find the idle times
also.

Sanding
Sanding, Painting,
Job Sequence Ti Tp
hours hours
A 10 5
B 7 4
C 5 7
D 3 8
E 2 6
F 4 3

Sanding
Sanding, Painting,
Job Sequence Ti Tp
hours hours
A 10 5
B 7 4
C 5 7
D 3 8
E 2 6
F 4 3
 n. The first
nting.
that will
e idle times

Sanding Painting

To Ti Tp To Total time to process all the jobs

Total processing time - Machine 1

Total processing time - Machine 2
Total idle time - Machine 1
Total idle time - Machine 2

Sanding Painting

To Ti Tp To Total time to process all the jobs

Total processing time - Machine 1

Total processing time - Machine 2
Total idle time - Machine 1
Total idle time - Machine 2
Hours

0
0
0
0

Hours

0
0
0
0