PRODUCTION & OPERATIONS MANAGEMENT COURSE
LEARNING OUTCOMES
L.O.3.10 Explain the concepts related to short-
CHAPTER 9: term scheduling.
SHORT-
SHORT-TERM SCHEDULING L.O.3.11 Sequencing job in 1 machine.
L.O.3.12 Sequencing job in 2 machines
Capacity plan - new equipment and
Capacity Planning
facilities are designed, built, purchased, [Link] completion time: Evaluated by
Long-term; Changes in Facilities/ or shut down plan over a period of determining the average completion time.
years Equipment
years. [Link] utilization: Evaluated by
Aggregate plan - decisions regarding determining the percent of the time the
the use of facilities, inventory, people, facility is utilized.
Aggregate planning
and outside contractors. Resources are [Link] work-in-process (WIP)
Facility utilization/
Medium term, allocated in terms of an aggregate inventory: Evaluated by determining the
Personnel changes/
quarterly, monthly
Subcontracting measure such as total units, tons, or average number of jobs in the system. The
hours. Scheduling relationship between the number of jobs in
The master schedule breaks down the Criteria the system and WIP inventory will be high.
Master Production schedule aggregate plan and develops weekly Therefore, the fewer the number of jobs
Medium term; MRP/ Disaggregate schedules for specific products or that are in the system, the lower the
weekly the aggregate plan inventory.
product lines.
Short-term schedule - translate [Link] customer waiting time:
capacity decisions, aggregate plans,
The objective of Evaluated by determining the average
Short-term Scheduling and master schedules into job scheduling is to allocate number of late periods
Short-term;
Work center loading/ sequences and specific assignments of and prioritize demand to
days, hours,
sequencing available facilities
minutes personnel, materials, and machinery.
Determining the order in which jobs should be
The scheduling of process-focused facilities done at each work center.
Process-focused facilities (intermittent , or Priority Rules - Rules used to determine the
job-shop): sequence of jobs in process-oriented facilities.
high-variety, low-volume manufacturing
◆ FCFS: first come, first served .
and service organizations
Jobs are completed in the order they arrived.
produce make-to-order products or Sequencing
Short-term ◆ SPT: shortest processing time .
services (Dispatching)
Scheduling Scheduling requires that the sequence Jobs with the shortest processing times are
Jobs
Application of work, time required for each item, and assigned first.
the capacity and availability of each work
1 machine
◆ EDD: earliest due date .
center be known.
Earliest due date jobs are assigned first.
The variety of products and unique
requirements means that scheduling is ◆ LPT: longest processing time .
often complex. Jobs with the longest processing time are
assigned first.
Flow time: The time between the release
of a job to a work center until the job is
finished (the time that each job spends
for waiting and being processed)
Job Job Processing time Job due
(days) date
Average completion time =
A 6 8
Sequencing in 1 B 2 6
Performance Utilization Metric =
machine - C 8 18
Criteria
Average number of jobs in the system Example D 3 15
=
E 9 23
Average Jobs Lateness=
The choice of which priority
rule to choose depends on
how each rule performs.
Job seq. Job processing Flow Job due Job Job seq. Job processing Flow Job due Job
time time date lateness time time date lateness
FCFS
first come, first
A 6 6 8 0 SPT B 2 2 6 0
B 2 8 6 2 shortest processing time D 3 5 15 0
serve
C 8 16 18 0 A 6 11 8 3
D 3 19 15 4 Order sequence: C 8 19 18 1
E 9 28 23 5 B–D–A–C–E E 9 28 23 5
28 77 11 28 65 09
Average completion time = = . Average completion time = = !
Utilization Metric = = 28/77 = 36.4% Utilization Metric = = 28/65 = 43.1%
Average number of jobs in the system = = 77/28 = 2.75 jobs Average number of jobs in the system = = 65/28 = 2.32 jobs
Average Jobs Lateness= = 11/5 = 2.2 days Average Jobs Lateness= = 9/5 = 1.8 days
Job seq. Job processing Flow Job due Job Job seq. Job processing Flow Job due Job
time time date lateness time time date lateness
LPT
EDD B 2 2 6 0
longest processing
earliest due date A 6 8 8 0
time
D 3 11 15 0
Order sequence: C 8 19 18 1 Order sequence:
B–A–D–C–E E 9 28 23 5
28 68 06
"
Average completion time = = !.# Average completion time = =
Utilization Metric = = 41.2% Utilization Metric = =
Average number of jobs in the system = = 2.43 jobs Average number of jobs in the system = =
Average Jobs Lateness= = 6/5 = 1.2 days Average Jobs Lateness= =
Job seq. Job processing Flow Job due Job
time time date lateness
LPT E 9 9 23 0
longest processing Shortest processing time is generally
C 8 17 18 0
time the best technique for minimizing job flow
A 6 23 8 15 OR minimizing the average number of
Order sequence: jobs in the system.
D 3 26 15 11
E-C-A-D-B First come, first served does not score
B 2 28 6 22 well on most criteria (but neither does it
score particularly poorly). It has the
28 103 48
advantage, however, of appearing fair to
Summary customers, which is important in service
Average completion time = =103/5 = 20.6 days
systems.
Utilization Metric = = 28/103 = 27% Earliest due date minimizes maximum
tardiness, which may be necessary for
jobs that have a very heavy penalty after
Average number of jobs in the system = = 103/28 = 3.68 jobs
a certain date. In general, EDD works
well when lateness is an issue.
Average Jobs Lateness= = 48/5 = 9.6 days
The following jobs are waiting to be
processed at the same machine center.
Jobs are logged as they arrive: Assume that all jobs arrive on day 275
JOB DUE DATE DURATION(DAYS) JOB Proc Flow Due Job lateness
A 313 8 time time date
(-275)
B 312 16
A 8 38
C 325 40
EXERCISE 1 D 314 5
EXERCISE 1 B 16 37
C 40 50
E 314 3
D 5 39
In what sequence would the jobs be
ranked according to the following decision E 3 39
rules: (a) FCFS, (b) EDD, (c) SPT, and (d)
FCFS: A-B-C-D-E
LPT? All dates are specified as
EDD: B-A-D-E-C
manufacturing planning calendar days. SPT: E-D-A-B-C
Assume that all jobs arrive on day 275. LPT: C-B-A-D-E
The following jobs are waiting to be
processed at Julie Morel’s machine
Today on the planning calendar is day 130, and none of
center the jobs have been started or scheduled.
Order Date order Processi Date
received ng time order JOB Proc Flow Due Job lateness
(days) due time time date
A 110 20 180 (-130)
B 120 30 200 A 20 50
EXERCISE 2 C 122 10 175 EXERCISE 2 B 30 70
D 125 16 230 C 10 45
E 130 18 210 D 16 100
In what sequence would the jobs be E 18 80
ranked according to the following rules:
(a) FCFS, (b) EDD, (c) SPT, and (d) LPT?
All dates are according to shop calendar
days. Today on the planning calendar is
day 130, and none of the jobs have been
started or scheduled.
When N jobs (where N is 2 or 1. All jobs are listed, and the time that
more) must go through two each job requires on a machine is
different machines or work shown.
centers in the same order. Each 2. Select the job with the shortest
work center only works on one processing time. If the shortest time lies
job at a time Apply Johnson’s
with the first machine, the job is
rule
scheduled first. If the shortest time lies
Sequencing Jobs Johnson’s rule: An approach Johnson’s rule with the second machine, schedule the
– 2 machines that minimizes the total time for
job last. Ties in processing times can be
sequencing a group of jobs
broken arbitrarily.
through two work centers while
minimizing total idle time in the 3. Once a job is scheduled, eliminate it.
work centers 4. Apply steps 2 and 3 to the remaining
jobs, working toward the center of the
sequence.
• Select the job with the shortest Job Work center 1 Work center 2
processing time. (hour) (hour)
• If the shortest time lies with the
first machine, the job is A 5 2
scheduled first. If the shortest B 3 6 Job B E D C A
time lies with the second WC1 3 7 10 8 5
machine, schedule the job last. C 8 4
Ties in processing times can be D 10 7 WC2 6 12 7 4 2
broken arbitrarily.
• Once a job is scheduled, E 7 12
eliminate it -> come back to 1st B E D C A Sequence: B-E-D-C-A
step
Example Job B E D C A
WC1 3 7 10 8 5
WC2 6 12 7 4 2
Total processing time: 35 hours
Idle time of Work center 2: 4 hours
Idle time of Work center 1: 2 hours
The following set of seven jobs is to be processed
Six jobs are to be processed through a through two work centers at George Heinrich’s
two-step operation. The first operation printing company. The sequence is first printing,
involves sanding, and the second then binding. Processing time at each of the work
involves painting. Processing times are centers is shown in the following table
as follows: Job Printing (hrs) Binding (hrs)
Job Sanding Painting T 15 3
(hours) (hours) U 8 9
Exercise 3 A 10 5 Exercise 4 V 4 10
B 7 4 W 7 6
C 5 7 X 10 9
D 3 8 Y 4 5
E 2 6 Z 7 8
F 4 3
What is the optimal sequence for these jobs to be scheduled?
Determine a sequence that will minimize the total completion time for What is the total length of time of this optimal solution?
these jobs & Idle time for each operation. What is the idle time in the binding shop? in Printing shop?