Amity Business School

Sequencing and Scheduling

 Amity Business School

Introduction
• The sequencing problem arises whenever there is a need for
determining an optimum order (sequence) of performing a
number of jobs by a number of facilities according to some pre-
assigned order so a s to optimize the output in terms of time, cost
or profit.
• The general sequencing problem may be described as: Let there
be n jobs to be performed one at a time on each of m machines.
The sequence (order) of machines in which each job should be
performed is given.
• The general sequencing problem, therefore, is to find the
sequence out of possible sequences which minimize the total
elapsed time between the start of the job in the first machine and
the completion of the last job on the last machine.
 Amity Business School

Example 1
• Suppose that there are two jobs J1 and J2, each
requiring work on two machines M1 and M2, in
this order, with the required processing times
given as follows: Machine
Job
M1 M2

J1 4 10
J2 8 7

• What order of performance of the jobs will

involve the least time
 Amity Business School

Example 1
• Two orders are possible, J1 – J2 and J2 – J1.
Both the alternatives are evaluated in the
Gantt chart
INDEX
Job Sequence: J1 J2 Location of J1
J1
M1 J2 Waits
Location of J2
J2
Machine

M2

0 2 4 6 8 10 12 14 16 18 20 22 24
 Amity Business School

Example 1 INDEX
Job Sequence: J2 J1 Location of J1
J2
M1 J1 Waits
Location of J2
J1
Machine

M2

0 2 4 6 8 10 12 14 16 18 20 22 24

Clearly then, the Job sequence J1 – J2 is optimal, since the total elapsed time T is
the lower of the two
 Amity Business School

Processing n jobs through 2 machines

• In a factory, there are six jobs to perform, each

of which should go through two machines A
and B, in the order AB. The processing timings
(in hours) for the jobs are given here. You are
required to determine the sequence for
performing the jobs that would minimize the
total elapsed time T. What is the value of T?
 Amity Business School

Job Machine A Machine B

1 7 3
2 4 8
3 2 6
4 5 6
5 9 4
6 8 1
 Amity Business School

Solution
Step 1. Select the smallest processing time,
Considering A1, A2, …..An and B1, B2 …. Bn
together
• The smallest processing time is for job 6 on
machine B
 Amity Business School

Step 2.
– if the minimum is for the job on machine A, do that job
first.
– if the minimum is for the job on machine B, do that job
in the end.
– In case of a tie between A and B, perform the A’s job
first and B’s job last
– If there is tie between 2 or more timings in either of the
series, select either of the jobs involved and perform
the first or last, accordingly as the tie is in A1, A2,
…..An or B1, B2 …. Bn
 Amity Business School

• So perform job 6 in the end. It is last in the sequence.

Step 3. After the job(s) has/have been assigned, apply step 1
and step 2 to the reduced set by deleting the machines times
corresponding to he job(s) already assigned
• Now delete this job from the given data.
• Of all timings now, the minimum is for job 3 on machine A.
so, do the job 3 first.
• After deleting job 3 also, the smallest time of 3 hours is for
job 1 on machine B. Thus, perform job 1 in the end (before
6)
• Now we observe that the smallest value of 4 hours is
shared by job 2 on machine A and job 5 on machine B. So,
perform job 2 first and job 5 in the end
 Amity Business School

• Now only job 4 is remaining, it shall be assigned the

only place left in the sequence.
• The resultant sequence of jobs is, therefore, as
follows
Machine A Machine B
Job
In Out In Out

3 0 2 2 8
2 2 6 8 16
4 6 11 16 22
5 11 20 22 26
1 20 27 27 30
6 27 35 35 36
 Amity Business School

N Jobs Through 3 Machines

Step 1. is Min of A Max of B and/or Min of C Max
of B. if the answer is no (there is no general
solution available). If the answer is yes
Step 2. Replace given problem with an equivalent
problem involving n jobs and 2 fictitious machines
G and H, and define the corresponding processing
times G and H as follows
G=A+B
H=B+C
 Amity Business School

Example 3
• You are given the following data regarding the
processing times of some jobs on three
machines I, II and III. The order of processing is
I – II – III. Determine the sequence that
minimizes the total elapsed time (T) required
to complete the jobs. Also evaluate T and the
idle time of II and III.
 Amity Business School

Processing Time (Hours)

Job
I II III

A 3 4 6
B 8 3 7
C 7 2 5
D 4 5 11
E 9 1 5
F 8 4 6
G 7 3 12
• According to the given information.
Min of I = 3
Max of II = 5
Min of III= 5
• Clearly since Min of III = Max of II. We can solve the problem
 Amity Business School

Job G = I + II H = II + III
A 7 10
B 11 10
C 9 7
D 9 16
E 10 6
F 12 10
G 10 15

• According to this, there are two optimal sequences.

They are
S1: A D G B F C E
S2: A D G F B C E
 Amity Business School

Job Machine 1 Machine 2 Machine 3

In Out In Out In Out

A 0 3 3 7 7 13
D 3 7 7 12 13 24
G 7 14 14 17 24 36
B 14 22 22 25 36 43
F 22 30 30 34 43 49
C 30 37 37 39 49 54
E 37 46 46 47 54 59

• From the table T = 59 hours

• The idle time for various machines :
– Machine I: 13 hrs
– Machine II: 3+2+5+5+3+7+12 = 37 hours
– Machine III: 7 hours
 Amity Business School

Maintenance Crew Scheduling

• The method of solving sequencing problems relating to the
scheduling of jobs in a factory can be extended to scheduling the
factory maintenance crews in such a way as to minimize their idle
time.
• Suppose that a company has a set of different machines in its
plant that need preventive maintenance. The team is divided into
two groups A and B. First, crew A takes the machine and replaces
the parts according to the needs. Then crew B resets the machine
and puts it back into operation.
• If the service times of both the groups on the different machines
are known, we can determine the sequence in which the
maintenance jobs be done so that the idle time of the crew is
least.
 Amity Business School

• The rules, like for the sequencing problems earlier, when

the service times are given in the column form, are as
follows:
a. Choose the smallest of all values that appear in the two columns.
b. If the value is in the first column, then that machine in respect of
which the value is, shall be serviced by crew A in the beginning.
c. If it is in the second column, then that machine will be serviced
by crew A in the end.
d. If there is a tie in the same column, either of the machines
involved is selected and assigned the first, or the last place
accordingly as the tie is in the first or the second column.
e. After making the assignment, cross out the machines involved.
f. Continue in the manner of the steps (a) to (e) until all
assignments are made.
The resulting sequence shall ensure minimization of the idle time
of maintenance crew.
 Amity Business School

• Find the sequence that minimizes the total

elapsed time required to complete the
following task on two machines
Task A B C D E F G H I
M1 2 5 4 9 6 8 7 5 4
M2 6 8 7 4 3 9 3 8 11
 Amity Business School

Example 4
• The maintenance crew of a company is
divided into two groups, C1 and C2, which
cares for the maintenance of the machines.
Crew C1 is responsible for replacement of
parts which are worn out while crew C2 oils
and resets the machines back for operation.
The times required by crews C1 and C2 on
different machines which need working on
them are given as follows:
 Amity Business School
Machine Maintenance Time (hrs)
Crew C1 Crew C2
M1 8 5
M2 6 3
M3 10 7
M4 11 12
M5 10 8
M6 14 6
M7 4 7

• In what order should the machines be handled by

crews C1 and C2 so that the total time taken is
minimised?
 Amity Business School

• In accordance with the rules, the order in which

machines should be handled is as follows:
Machine Crew C1 Crew C2
Start Finish Start Finish
M7 0 4 4 11
M4 4 15 15 27
M5 15 25 27 35
M3 25 35 35 42
M6 35 49 49 55
M1 49 57 57 62
M2 57 63 63 66