Sequencing Problems

Abu Bashar
 Sequencing???
• It is the selection of an appropriate order
in which a number of jobs (Operations)
can be assigned to to a finite number of
service facilities (Machines or equipments)
so as to optimize the outputs in terms of
time, cost or profit.
 Common Sequencing Rules
• FCFS. First Come First Served. Jobs
processed in the order they come to the
shop.
• SPT. Shortest Processing Time. Jobs with
the shortest processing time are scheduled
first.
• EDD. Earliest Due Date. Jobs are sequenced
according to their due dates.
• CR. Critical Ratio. Compute the ratio of
processing time of the job and remaining
time until the due date. Schedule the job with
the largest CR value next.
 Two Work Center Sequencing
• Johnson’s Rule: technique for minimizing
completion time for a group of jobs to be
processed on two machines or at two work
centers.
• Minimizes total idle time
• Several conditions must be satisfied
 Johnson’s Rule Conditions
• Job time must be known and constant
• Job times must be independent of
sequence
• Jobs must follow same two-step sequence
• Job priorities cannot be used
• All units must be completed at the first
work center before moving to the second
 Sequencing Problems
• One machine, many jobs
• Two machines, many jobs
• Three machines, many jobs
• Many machines, many jobs
 One machine, many jobs
• Total time is independent of sequence
• Sequencing minimizes idle time
 Two machines, many jobs
• All Jobs follow same sequence –
Johnson’s Rule
• Jobs have different sequence – Jackson’s
Rule
• Johnson’s 3 machine rule
 Johnson’s Rule
• Johnson’s rule: A procedure that minimizes idle time
when scheduling a group of jobs on two workstations.
• Step 1. Find the shortest processing time among the
jobs not yet scheduled. If two or more jobs are tied,
choose one job arbitrarily.
• Step 2. If the shortest processing time is on workstation
1, schedule the corresponding job as early as possible.
If the shortest processing time is on workstation 2,
schedule the corresponding job as late as possible.
• Step 3. Eliminate the last job scheduled from further
consideration. Repeat steps 1 and 2 until all jobs have
been scheduled.
 Example 16.5
Johnson’s Rule at the Morris Machine Co.

Time (hr)
Motor Workstation 1 Workstation 2
M1 12 22
M2 4 5
M3 5 3
M4 15 16
M5 10 8

Eliminate
Eliminate
Eliminate
Eliminate M5
M2 M3
M1 from
and
from
from consideration.
the only job
consideration.
consideration. The
The
The next
remaining
next
next to shortest
be
shortest
shortest time
time
time is
is
Shortest time is 3 hours at workstation 2, so
M5 isat
M2
scheduled
M1 at at Workstation
is M4.
workstation
workstation #1,
#2, 1,schedule
so
so so schedule
schedule M1
M5 M2 first.
next.
next to last.
schedule job M3 last.

Sequence = M2 M1 M4 M5 M3
 Example 16.5
Johnson’s Rule at the Morris Machine Co.

The schedule minimizes the idle time of workstation 2

and gives the fastest repair time for all five motors.
No other sequence will produce a lower makespan.
Gantt Chart for the Morris Machine Company Repair Schedule
Workstation

1 M2 M1 M4 M5 M3 Idle—available
(4) (12) (15) (10) (5) for further work

2 Idle M2
(5) Idle M1
(22)
M4
(16)
M5
(8)
M3
(3)

0 5 10 15 20 25 30 35 40 45 50 55 60 65
Day
 Problem

Job 1 2 3 4 5 6 7 8

A 4 5 8 10 6 5 10 6

B 8 10 2 4 5 7 6 6
Example
 Johnson’s 3 Machine Rule
• Domination – Largest on B is not greater
than smallest on A or C. Domination
guarantees optimality
• Conversion – Convert into a 2 M/C
problem as M1 = A + B, M2 = B + C
• Find optimal sequence for this 2 machine
problem
• Schedule on 3 machines based on the
sequence above
 Classwork
Job 1 2 3 4 5 6
A 8 6 10 7 9 7
B 7 4 6 5 5 4
C 13 12 11 12 13 10
M1 15 10 16 12 14 11
M2 20 16 17 17 18 14
 Classwork

j 1 2 3 4 5
tj1 8 11 7 6 9
tj2 3 2 5 7 11
tj3 6 5 7 13 10
Thank You Very Much