 Scheduling: Establishing the timing of the

use of equipment, facilities and human

activities in an organization
 Effective scheduling can yield
◦ Cost savings
◦ Increases in productivity

16-2
1. Assigning / loading jobs to facilities /
machines.

2. Sequencing or prioritizing jobs at a

facility/machine.

3. Monitoring and Controlling.

Work Center #1 Work Center #2 Output

4
 Flow system: High-volume system with
Standardized equipment and activities
 Flow-shop scheduling: Scheduling for
high-volume flow system

Work Center #1 Work Center #2 Output

16-5
High-volume JAN FEB MAR APR MAY JUN

Intermediate- A Done
Build A

volume Build B

Low-volume B Done

Build C

Service C Done

operations
On time!
Build D

Ship

16-6
 Process and product design
 Preventive maintenance
 Rapid repair when breakdown occurs
 Optimal product mixes
 Minimization of quality problems
 Reliability and timing of supplies

16-7
 Loading - assignment of jobs to
process centers
 Sequencing - determining the order in
which jobs will be processed
 Job-shop scheduling
◦ Scheduling for low-volume
systems with many
variations
in requirements

16-8
 Gantt chart - used as a visual aid for
loading and scheduling

16-9
 Infinite loading – jobs are assigned to work
centers without regard for the capacity of
the work center.
 Finite loading – jobs are assigned to work
centers taking into account the work center
capacity and job processing times
 Vertical loading
 Horizontal loading

16-11
 Forward scheduling – scheduling ahead from
some point in time.
 Backward scheduling – scheduling by working
backwards in time from the due date(s).
 Schedule chart – a form of Gantt chart that
shows the orders or jobs in progress and
whether they are on schedule.

16-12
 Sequencing: Determine the order in which
jobs at a work center will be processed.

 Workstation: An area where one person

works, usually with special equipment, on a
specialized job.

16-13
 Priority rules: Simple heuristics
used to select the order in
which jobs will be processed.
Everything is
#1 Priority
 Job time: Time needed for
setup and processing of a job.

16-15
 Allocating orders, equipment, and
personnel
 Determining the sequence of order
performance
 Initiating performance of the scheduled
work
 Shop-floor control
 Meet due dates

 Minimize lead time

 Minimize setup time or cost

 Minimize work-in-process inventory

 Maximize machine utilization

1. First-come, first-served (FCFS)

2. Shortest operating time (SOT)

3. Earliest due date first (EDD)

4. Last come first in (LCFS)

Everything is
#1 Priority
 Jobs (in order Processing Due Date
Suppose you have the four of arrival) Time (days) (days hence)
jobs to the right arrive for A 4 5
processing on one machine B 7 10
C 3 6
D 1 4
What is the FCFS schedule?
Do all the jobs get done on time?

Answer: FCFS Schedule No, Jobs B, C,

and D are
Jobs (in order Processing Due Date Flow Time
going to be late
of arrival) Time (days) (days hence) (days)
A 4 5 4
B 7 10 11
C 3 6 14
D 1 4 15
 Jobs (in order Processing Due Date
Suppose you have the four of arrival) Time (days) (days hence)
jobs to the right arrive for A 4 5
processing on one machine B 7 10
C 3 6
D 1 4

What is the SOT schedule? Do all the jobs get done on time?
Answer: Shortest Operating Time Schedule

Jobs (in order Processing Due Date Flow Time

No, Jobs A
of arrival) Time (days) (days hence) (days)
and B are
D 1 4 1 going to be
C 3 6 4 late
A 4 5 8
B 7 10 15
 Jobs (in order Processing Due Date
Suppose you have the four of arrival) Time (days) (days hence)
jobs to the right arrive for A 4 5
processing on one machine B 7 10
C 3 6
D 1 4

What is the earliest due date

first schedule? Do all the jobs get done on time?
Answer: Earliest Due Date First

Jobs (in order Processing Due Date Flow Time No, Jobs C
of arrival) Time (days) (days hence) (days) and B are
D 1 4 1 going to be
A 4 5 5 late
C 3 6 8
B 7 10 15
 Jobs (in order Processing Due Date
Suppose you have the four of arrival) Time (days) (days hence)
jobs to the right arrive for A 4 5
processing on one machine B 7 10
C 3 6
D 1 4

What is the LCFS schedule? Do all the jobs get done on time?
Answer: Last-Come First-Served Schedule

Jobs (in order Processing Due Date Flow Time

of arrival) Time (days) (days hence) (days) No, Jobs B
D 1 4 1 and A are
C 3 6 4 going to be
B 7 10 11 late
A 4 5 15
 Step 1: Find the minimum among various ti1 and ti2.
 Step 2a: If the minimum processing time requires machine 1, place the
associated job in the first
 available position in sequence. Go to Step 3.
 Step 2b: If the minimum processing time requires machine 2, place the
associated job in the last
 available position in sequence. Go to Step 3.
 Step 3: Remove the assigned job from consideration and return to Step 1
until all positions in
 sequence are filled. (Ties may be broken randomly.)
 The above algorithm is illustrated using the following problem:
Suppose you have the following five jobs with time
requirements in two stages of production. What is the
job sequence using Johnson’s Rule?

Time in Hours
Jobs Stage 1 Stage 2
A 1.50 1.25
B 2.00 3.00
C 2.50 2.00
D 1.00 2.00
First, select the job with the
Time in Hours
smallest time in either stage.
Jobs Stage 1 Stage 2
That is Job D with the A 1.50 1.25
smallest time in the first B 2.00 3.00
stage. Place that job as early C 2.50 2.00
as possible in the unfilled job D 1.00 2.00
sequence below.
Drop D out, select the next smallest time (Job A), and place it 4th in the job
sequence.
Drop A out, select the next smallest time. There is a tie in two
stages for two different jobs. In this case, place the job with the
smallest time in the first stage as early as possible in the unfilled job
sequence.
Then place the job with the smallest time in the second stage as
late as possible in the unfilled sequence.
Job Sequence 1 2 3
4
Job Assigned D B C A
1. Six jobs have arrived at one time to be
processed on a single machine. Assuming that no
new jobs arrive thereafter, determine
 Optimal order sequence as per SPT (SOT) rule
 Completion time of jobs
 Mean flow time

Jobs A B C D E F

Processing time in 7 6 8 4 3 5
(min)
 For the given 8 jobs to be processed using single
machine, using, FCFS, SOT, EDD rule determine:
 Optimal sequence
 Mean flow time
 Lateness, Mean lateness and max lateness
 No. of jobs actually late
Jobs Processing time (days) Due date (days)
1 5 15
2 8 10
3 6 15
4 3 25
5 10 20
6 14 40
7 7 45
8 3 50
 A production company located at 6 locations, of a city has to
undergo overhauling every year in two stages A and B. It
requires different skillset for each stage and stage B will be
carried out only after stage-A. During this period the entire
plant has to be closed. Company is following the given
schedule. Determine
1. the optimal sequence
2. If down time of any of the six plants costed Rs. 5000/-per
day. Idle time of Crew A cost Rs. 1500/- per day and Idle
time of Crew B costs Rs. 2500/- per day, which of the two
schedules will be economical and its respective costs. One
is Present and other is you have optimized.
Plant P1 P2 P3 P4 P5 P6
Crew A 12 9 10 8 10 10
Crew B 10 7 9 14 6 8
 Machine operator has to perform 3 operations,
Turning Threading and Knurling on a number of
different jobs. Determine the optimum sequence so
that total operating time is minimum. Also
calculate Idle time of all 3 operations and waiting
times of all jobs.
Job Turning (min) Threading (min) Knurling (min)

A 3 8 13
B 12 6 14
C 5 4 9
D 2 6 12
E 9 3 8
F 11 1 13