Operations Scheduling

(Session 5)

1
 Outline

Work Center Defined

Typical Scheduling and Control
Functions
Job-shop Scheduling
Examples of Scheduling Rules
Shop-floor Control: Major functions
Principles of Work Center Scheduling
Issues in Scheduling Service Personnel

2
 Work Center
Defined

A work center is an area in a business in

which productive resources are organized and
work is completed
Can be a single machine, a group of machines,
or an area where a particular type of work is
done

3
 Typical Scheduling and Control
Functions

Allocating orders, equipment, and

personnel
Determining the sequence of order
performance
Initiating performance of the scheduled
work
Shop-floor control
4
Work-Center Scheduling Objectives

Meet due dates

Minimize lead time

Minimize setup time or cost

Minimize work-in-process inventory

Maximize machine utilization

5
Priority Rules for Job Sequencing

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

2. Shortest processing time (SPT)

3. Earliest due date (EDD)

4. Critical ratio (CR)

5. Last come, first served (LCFS)

6
Example of Job Sequencing: FCFS

Suppose Jobs (in order Processing Due Date

Supposeyouyouhave
havethe
thefour
four of arrival) Time (days) (days hence)
jobs
jobsto
tothe
theright
rightarrive
arrivefor
for A 4 5
processing
processingon onone
onemachine
machine B 7 10
C 3 6
D 1 4
What
Whatis
isthe
theFCFS
FCFSschedule?
schedule? Do
Doall
allthe
thejobs
jobsget
getdone
doneon
ontime?
time?
Answer: FCFS Schedule No,
No,Jobs
JobsB, B,C,
C,
Jobs (in order Processing Due Date Flow Time and
andDDare
aregoing
going
of arrival) Time (days) (days hence) (days) to
tobe
belate
late
A 4 5 4
B 7 10 11
C 3 6 14
D 1 4 15

7
 4 + 11 + 14 + 15
Mean flow time= = 11days
4
0 + 1 + 8 + 11
Average lateness= = 5days
4

8
 Example of Job Sequencing: SPT
Jobs (in order Processing Due Date
Suppose
Supposeyouyouhave
havethe
thefour
four of arrival) Time (days) (days hence)
jobs
jobsto
tothe
theright
rightarrive
arrivefor
for A 4 5
processing
processingon onone
onemachine
machine B 7 10
C 3 6
D 1 4

What
Whatis
isthe
theSPT
SPTschedule?
schedule? Do
Doall
allthe
thejobs
jobsget
getdone
doneon
ontime?
time?
Answer: Shortest Operating Time Schedule
Jobs (in order Processing Due Date Flow Time
No,
No,Jobs
JobsAA
of arrival) Time (days) (days hence) (days)
and
andBBare
are
D 1 4 1 going
C 3 6 4 goingtotobe
be
late
late
A 4 5 8
B 7 10 15
9
 Example of Job Sequencing: EDD
Jobs (in order Processing Due Date
Suppose
Supposeyouyouhave
havethe
thefour
four of arrival) Time (days) (days hence)
jobs
jobsto
tothe
theright
rightarrive
arrivefor
for A 4 5
processing
processingon onone
onemachine
machine B 7 10
C 3 6
D 1 4
What
Whatis isthe
theearliest
earliestdue
duedate
date
first
firstschedule?
schedule? Do
Doall
allthe
thejobs
jobsget
getdone
doneon
ontime?
time?
Answer: Earliest Due Date First
Jobs (in order Processing Due Date Flow Time No,
No,Jobs
JobsCC
of arrival) Time (days) (days hence) (days) and
andBBare
are
D 1 4 1 going
goingtotobe
be
A 4 5 5 late
late
C 3 6 8
B 7 10 15
10
 Example of Job Sequencing: CRM
Jobs (in order Processing Due Date
Suppose
Supposeyouyouhave
havethe
thefour
four of arrival) Time (days) (days hence)
jobs
jobsto
tothe
theright
rightarrive
arrivefor
for A 4 5
processing
processingon onone
onemachine
machine B 7 10
C 3 6
D 1 4
What
Whatis
isthe
theCR
CRschedule?
schedule? Do
Doall
allthe
thejobs
jobsget
getdone
doneon
ontime?
time?

In order to do this schedule the CRs have be calculated No,

No,but
butsince
since
for each job. If we let today be Day 1 and allow a total of there
thereisisthree-
three-
15 days to do the work. The resulting CRs and order way
waytie,
tie,only
only
schedule are: the
thefirst
firstjob
jobor
or
CR(A)=(5-4)/15=0.06 (Do this job last) two
twowill
willbe
beon
on
CR(B)=(10-7)/15=0.20 (Do this job first, tied with C and time
time
D)
CR(C)=(6-3)/15=0.20 (Do this job first, tied with B and D)
CR(D)=(4-1)/15=0.20 (Do this job first, tied with B and C)
11
Example of Job Sequencing: LCFS
Jobs (in order Processing Due Date
Suppose
Supposeyouyouhave
havethe
thefour
four of arrival) Time (days) (days hence)
jobs
jobsto
tothe
theright
rightarrive
arrivefor
for A 4 5
processing
processingon onone
onemachine
machine B 7 10
C 3 6
D 1 4

What
Whatis
isthe
theLCFS
LCFSschedule?
schedule? Do
Doall
allthe
thejobs
jobsget
getdone
doneon
ontime?
time?
Answer: Last-Come First-Served Schedule
Jobs (in order Processing Due Date Flow Time
of arrival) Time (days) (days hence) (days) No,
No,Jobs
JobsBB
D 1 4 1 and
andAAare
are
C 3 6 4 going
goingtotobe
be
B 7 10 11 late
late
A 4 5 15

12
 Comparison of Priority Rules

Rule Total flow Mean flow time Average lateness

time (days) (days) (days)

FCFS 15 11 5

SOT 15 7 2

DDATE 15 7.25 1.75

LCFS 15 7.75 2.75

SOT is better than rest of the rules,. It is called most important

concept in entire subject of sequencing.

13
Job Sequencing: Johnsons Rule

Suppose
Supposeyou
youhave
havethe
thefollowing
followingfive
fivejobs
jobswith
withtime
time
requirements
requirementsin
intwo
twostages
stagesof
ofproduction.
production. What
Whatis isthe
the
job
jobsequence
sequenceusing
usingJohnsons
JohnsonsRule?
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
14
 Job Sequencing: Johnsons Rule
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 smallest A 1.50 1.25
time in the first stage. Place that B 2.00 3.00
job as early as possible in the C 2.50 2.00
unfilled job sequence below. D 1.00 2.00

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 15
Shop-Floor Control:Major Functions

1. Assigning priority of each shop order

2. Maintaining work-in-process quantity

information

3. Conveying shop-order status information to

the office

16
4. Providing actual output data for capacity
control purposes

5. Providing quantity by location by shop order

for WIP inventory and accounting purposes

6. Providing measurement of efficiency,

utilization, and productivity of manpower and
machines
17
 Input/Output Control

Work
Input Output
Center

Planned input should never exceed planned output

Focuses attention on bottleneck work centers

18
 Principles of Work Center
Scheduling
1. There is a direct equivalence between work
flow and cash flow
2. The effectiveness of any job shop should be
measured by speed of flow through the shop
3. Schedule jobs as a string, with process steps
back-to-back
4. A job once started should not be interrupted
19
5. Speed of flow is most efficiently achieved by
focusing on bottleneck work centers and jobs

6. Reschedule every day

7. Obtain feedback each day on jobs that are not

completed at each work center

8. Match work center input information to what

the worker can actually do
20
9. When seeking improvement in output, look for
incompatibility between engineering design and
process execution

10. Certainty of standards, routings, and so

forth is not possible in a job shop, but
always work towards achieving it

21
Personnel Scheduling in Services

Scheduling consecutive days off

Scheduling daily work times

Scheduling hourly work times

22
 Capacity and Scheduling
Finite loading (Here, the jobs are assigned by comparing the required hours for
each operation with the available hours in each work center for the period
specified by the schedule)

Infinite loading (Example: MRP)

(Here, jobs are assigned to work center without regard to capacity)

Forward scheduling (It starts the schedule as soon as the job requirement are
known. It is usually designed to produce a schedule that can be accomplished even
if it means not meeting the due date. In many cases forward scheduling causes a
buildup WIP inventory)

Backward scheduling (Example: MRP)

(It begins with due date, scheduling the final operation first. Steps is the job are
then scheduled, one at a time, in reverse order. By subtracting the lead time fr
each item, the start time is obtained).

In practice, a combination of forward and backward scheduling is often used to

find a reasonable trade-off between what can be achieved and customer due dates.
23
Types of Manufacturing Scheduling
Processes and Approaches

Type of Process Typical Scheduling Approach

Continuous Finite forward of process,

process machine limited

High-volume Finite forward of line,

manufacturing machined limited

Mid-volume Infinite forward of process,

manufacturing labor and machined limited

Low-volume Infinite forward of jobs, labor

manufacturing and some machine limited
24