CHAPTER VIII

SCHEDULING OPERATIONS
 Work Center Defined

 A work center is an area in a business in

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

13-2
 Scheduling

• Operations scheduling is the allocation of

resources over time to perform a
collection of tasks.

• Examples of resources:
– Workers, Machines, Tools

13-3
 Capacity and Scheduling

 Loading
 Loading Approaches

Infinite loading

Finite loading

Forward scheduling

Backward scheduling

13-4
 Work-Center Scheduling Objectives

 Meeting due dates

 Minimizing lead time

 Minimizing setup time or cost

 Minimizing work-in-process inventory

 Maximizing machine utilization

13-5
Hierarchy of Production Decisions

F o re c a s t o f d e m a n d

A g g r e g a te P la n

M a s te r P r o d u c t io n S c h e d u le

M a t e r ia l R e q u ir e m e n t s P la n n in g S y s te m

D e t a ile d J o b S h o p S c h e d u le
13-6
 Job Sequencing

 Sequencing is determining the order in

which jobs will be processed.
 Sequencing vs. Scheduling

13-7
 Types of Sequencing Rules

 Sequencing jobs at a single resource

 Sequencing jobs across multiple resources

13-8
 Sequencing Rules (Single Resource)

 Local
 First Come First Served
 Last Come First Served
 Shortest Processing Time
 Longest Processing Time
 Earliest Due Date

13-9
 Performance measures
 Flow time of a job
 Refers to summation of processing time+
transportation time between operations waiting time for
equipment maintenance , unavailable parts, quality
problems and soon.
 Lateness of a job
 Is the length of time the job completion date is
expected to exceed the date the job was due or promised
to a customer.

13-10
 Cont…
 Makespan
 Is the total time needed to finish a group of jobs (the
length of time between the start of the first job in the
group and the completion of the last job in the group).
 Average number of jobs (ANJ)
 Jobs that are in a shop are considered to be work-in-
process inventory.
ANJ =Total flow time / Makespan

13-11
 Cont…
 Tardiness (or Lateness)
 Is the difference between a late job’s due date and its
flow time (or completion time).
 Slack
 Refers to the length of time between the
excess/shortage /of the due date over the current
date and the processing time.
 Mathematically:
Slack= (due date-today’s date) - processing time

13-12
 Cont…
 Critical Ratio
 Is the ratio of the length of time between the
due date and today’s date to the remaining
processing time.
Mathematically:

Time Remaining Due date - today's date

CR = =
Work Remaining remaining processing time

13-13
 Implications:

 If CR>1, then the job is ahead of schedule.

 If CR < 1, then the job is behind schedule.

 If CR=1, then the job is exactly on schedule.

13-14
 Example: Average number of jobs

 Jobs: A and B with processing times 10 each

Number of jobs
2

A finishes at 10 B finishes at 20 Time

Makespan=20, Total Flow time=10+20
Average number of jobs=30/20
13-15
 Example of Job Sequencing: First-Come First-Served

Jobs (in order Processing Due Date

of arrival) Time (days) (days hence)
Suppose you have the four
A 4 5
jobs to the right arrive for B 7 10
processing on one machine. C 3 6
D 1 4

13-16
 Example of Job Sequencing: Shortest Operating Time

Suppose you have the four Jobs (in order Processing Due Date
jobs to the right arrive for of arrival) Time (days) (days hence)
processing on one machine. A 4 5
B 7 10
C 3 6
D 1 4

13-17
 Example of Job Sequencing: Last-Come First-Served

Suppose you have the four jobs to Jobs (in order Processing Due Date
of arrival) Time (days) (days hence)
the right arrive for processing on
A 4 5
one machine.
B 7 10
C 3 6
D 1 4

13-18
 Example of Job Sequencing: Earliest Due Date First

Suppose you have the four Jobs (in order Processing Due Date
jobs to the right arrive for of arrival) Time (days) (days hence)
processing on one machine. A 4 5
B 7 10
C 3 6
D 1 4

13-19
 Example of Job Sequencing: Critical Ratio Method

Suppose you have the four

jobs to the right arrive for Jobs (in order Processing Due Date
processing on one machine. of arrival) Time (days) (days hence)
A 4 5
What is the CR schedule? B 7 10
C 3 6
Do all the jobs get done on time? D 1 4

 calculate the critical ratios at zero date and develop the order in which
the jobs have to be processed.

13-20
 Solution
Job Sequence Processing (days) Due date Critical Ratio
A 4 5 [5-0]/4 = 1.25 → the smallest
B 7 10 [10-0]/7 = 1.43
C 3 6 [6-0]/3 = 2.00
D 1 4 [4-0]/1 = 4.00

At day 4 (when activity A is completed), the critical ratios are:

Job Sequence Processing (days) Due date Critical Ratio

A - - -
B 7 10 [10-4]/7 = 0.86
C 3 6 [6-4]/3 = 0.67
D 1 4 [4-4]/1 = 0.00→ the smallest
13-21
 Cont…
Job Sequence Processing (days) Due date Critical Ratio
A - - -
B 7 10 [10-4]/7 = 0.86
C 3 6 [6-4]/3 = 0.67
D 1 4 [4-4]/1 = 0.00→ the smallest

At day 5 (when activities A and D are completed), the critical ratios are:

Job Sequence Processing (days) Due date Critical Ratio

A - - -
B 7 10 [10-5]/7 = 0.71
C 3 6 [6-5]/3 = 0.33→ the smallest
D - - -
13-22
 Cont…
At day 8, activities A, D and C are completed, and thus only activity B is
left for which there is no need calculate the critical ratio.

Job Sequence Processing (days) Due date Flow Time Days Tardy
A 4 5 4 0
D 1 4 5 1
C 3 6 8 2
B 7 10 15 5
Total 32 8
Average 8 2

13-23
 Summary of the Rules

Rule Average Average Average Number

Flow Time Tardiness of Jobs at Work
Center
FCFS 11.00 5.00 2.93
SOT 7.00 2.00 1.87
LCFS 7.75 5.00 2.07

Due Date 7.25 1.75 1.93

Critical Ratio 8.00 2.00 2.13
13-24
 Sequencing Jobs Through Two Work centers

 Johnson’s
Joh Rule: is a technique for minimizing
completion time for a group of jobs to be
processed on two work centers.
 Minimizes total idle time and the
makespan

13-25
 Cont…
 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
13-26
 Steps

1. Select a job with the shortest processing time

If the processing time is on the first workcenter
Schedule the job right after the already scheduled
at the beginning of the list
If the processing time is on the second workcenter
Schedule the job right before the already scheduled
at the end of the list
2. Cross out the scheduled job and go to 1
13-27
 Example:

 Secretary of the Department of Management,

Martha, has six Operations Management chapters
on her desk that must be typed and proofed as soon
as possible. Martha does the typing/ the author does
the proofing. Some chapters are easy to type but
more difficult to proof. The estimated time (in
minutes) for each activity is given here. In what
order should Martha type the chapters so that the
entire batch can be finished as soon as possible?

13-28
Cont…

Chapter Typing Proofing

1 30 20
2 90 25
3 60 15
4 45 30
5 75 60
6 20 30

13-29
 Solution:
Chapter Typing Proofing
Order Chapter
1 30 20
1st 6
2 90 25
2nd 5
3 60 15
3rd 4
4 45 30
4th 2
5 75 60
5th 1
6 20 30
6th 3

This order will complete these activities

faster than any other sequence.
13-30
 Calculating the Makespan

CH-6 CH-5 CH-4 CH-2 CH-1 CH-3 15

20 95 140 230 260 320

20 45 45 5 40
20 50 155 185 255 280 335

Chapter Typing Proofing

1 30 20 The two activities
2 90 25
will be completed in
3 60 15
4 45 30
335 minutes.
5 75 60
6 20 30 13-31
 Scheduling ‘n’ Jobs on ‘n’ Work
Centers:Assignment Model

 Assignment model
 A linear programming model for optimal assignment of
tasks and resources

 Hungarian method
 Method of assigning jobs by a one-for-one matching to
identify the lowest cost solution

13-32
 Hungarian Method
1. Row reduction: subtract the smallest number in each
row from every number in the row

a. Enter the result in a new table

2. Column reduction: subtract the smallest number in

each column from every number in the column

a. Enter the result in a new table

13-33
 Cont…

3. Test whether an optimum assignment can be made

a. Determine the minimum number of lines needed to cross
out all zeros

b. If the number of lines equals the number of rows, an

optimum assignment is possible. Go to step 6

c. Else, go to step 4

13-34
 Cont…
4. If the number of lines is less than the number of
rows, modify the table:
a. Subtract the smallest number from every uncovered number
in the table
b. Add the smallest uncovered number to the numbers at
intersections of cross-out lines
c. Numbers crossed out but not at intersections of cross-out
lines carry over unchanged to the next table

13-35
 Cont…

5. Repeat steps 3 and 4 until an optimal table is

obtained
6. Make the assignments
a. Begin with rows or columns with only one zero
b. Match items that have zeros, using only one match for
each row and each column
c. Eliminate both the row and the column after the match

13-36
 Example:
 A contractor pays his subcontractors a fixed fee plus mileage for work
performed. On a given day the contractor is faced with three electrical
jobs associated with various projects. Given below are the distances
between the subcontractors and the projects.
Project
A B C
Westside 50 36 16
Subcontractors Federated 28 30 18
Goliath 35 32 20
Universal 25 25 14
How should the contractors be assigned to minimize total distance (and
total cost)?
13-37
 Solving the Assignment Problem

 LP Formulation
 Decision Variables Defined
xij = 1 if subcontractor i is assigned to project j
= 0 otherwise

where: i = 1 (Westside), 2 (Federated),

3 (Goliath), and 4 (Universal)
j = 1 (A), 2 (B), and 3 (C)
13-38
 LP Formulation

 Objective Function minimize total distance:

Min 50x11 + 36x12 + 16x13 + 28x21 +

30x22 + 18x23 + 35x31 + 32x32 + 20x33
+ 25x41 + 25x42 + 14x43

13-39
 Cont…
Subject to:
x11 + x12 + x13 < 1 (no more than one
x21 + x22 + x23 < 1 project assigned
x31 + x32 + x33 < 1 to any one
x41 + x42 + x43 < 1 subcontractor)
x11 + x21 + x31 + x41 = 1 (each project must
x12 + x22 + x32 + x42 = 1 be assigned to just
x13 + x23 + x33 + x43 = 1 one subcontractor)
all xij > 0 (non-negativity)

13-40
Balancing the Problem:

50 36 16 0
28 30 18 0
35 32 20 0
25 25 14 0

13-41
 Cont…

50 36 16 0  Row Reduced OCT

50 36 16 0
28 30 18 0 28 30 18 0
35 32 20 0 35 32 20 0
25 25 14 0
25 25 14 0

25 11 2 0 25 11 2 0
3 5 4 0 3 5 4 0
10 7 6 0 10 7 6 0
0 0 0 0 0 0 0 0
13-42
 Cont…

23 9 0 0 23 9 0 1
1 3 2 0 0 2 1 0
8 5 4 0 7 4 3 0
0 0 0 2 0 0 0 3

 Since the number of lines drawn is equal to the

number of columns (or equivalently the number
of rows), the problem is optimized and the
resulting optimal assignment schedule is shown
below.
13-43
 Optimal Assignment Schedule

Subcontractor Project Distance

Westside C 16
Federated A 28
Goliath Dummy 0
Universal B 25
Total minimum distance 69 miles

13-44
 Balanced Assignment Method

 Suppose, for example, .

that a scheduler has five Machine
jobs that can be Job A B C D E
performed on any of five
1 $5 $6 $4 $8 $3
machines (n=5). The
cost of completing each
2 6 4 9 8 5
job-machine 3 4 3 2 5 4
combination is shown in 4 7 2 4 5 3
the table below. Which 5 3 6 4 5 5
machine should process
which job?

13-45
 LP Form
Min 5X1A + 6X1B + 4X1C + 8X1D + 3X1E + 6X2A + 4X2B + 9X2C
+ 8X2D + 5X2E + 4X3A + 3X3B + 2X3C+5X3D+4X3E+7X4A +
2X4B + 4X4C + 5X4D + 3X4E + 3X5A + 6X5B + 4X5C + 5X5D
+ 5X5E
Subject to:
X1A + X1B + X1C+ X1D+ X1E = 1 X1A + X1B+X1C +X1D + X1E=1
X2A + X2B + X2C+ X2D+ X2E = 1 X2A + X2B+X2C +X2D + X2E=1
X3A + X3B + X3C+ X3D+ X3E = 1 X3A + X3B+X3C +X3D + X3E=1
X4A + X4B + X4C+ X4D+ X4E = 1 X4A + X4B+X4C +X4D + X4E=1
X5A + X5B + X5C+ X5D+ X5E = 1 X5A + X5B+X5C +X5D + X5E=1
Xij > 0
13-46
 Solving the problem

Selecting the smallest number 2 3 1 5 0

5 6 4 8 3 2 0 5 4 1
6 4 9 8 5 2 1 0 3 2
4 3 2 5 4 5 0 2 3 1
7 2 4 5 3 0 3 1 2 2
3 6 4 5 5 2 3 1 3 0
2 0 5 2 1
2 1 0 1 2
5 0 2 1 1
0 3 1 0 2
13-47
Cont…

2 4 1 3 0  Since the number of

1 0 4 1 0 lines is equal to the
2 2 0 1 2 number of rows, the
4 0 1 0 0 problem is optimized.
0 4 1 0 2
 The optimum schedule
is presented below:

13-48
Optimum Schedule:

Job Machine Cost

1 E $3
2 B 4
3 C 2
4 D 3
5 A 3
Total $15
13-49
 Maximization Assignment Model

 The objective function value is the

amount of benefit, may be, sales or profit
that will be generated by assigning
resources to different work centers

13-50
 Example

 A manufacturing firm produces and sells

a product. It has five sales persons and if
each of which is assigned to each sales
branch sells different quantities of the
product as shown in the following table.

13-51
 Cont…

Sales Sales Offices

person A B C D E

1 10 4 6 10 12
2 11 7 7 9 14
3 13 8 12 14 15
4 14 16 13 17 17
5 17 11 17 20 19
Which sales person should be assigned to which sales
office so that the firm’s total sales will be optimized?
13-52
 Solving the Maximization Problem

 It is only in the first Step I: Reducing Row

step, reducing the row 10 4 6 10 12
or reducing column
11 7 7 9 14
which ever comes first
that solving a 13 8 12 14 15
maximization 14 16 13 17 17
assignment problem 17 11 17 20 19
differs from solving
the minimization one.

13-53
 Cont…

0 7 3 2 0 Reducing Column: selecting the

1 6 4 5 0 smallest number from each
column and subtracting it from
0 6 0 1 0 each number in the row.
1 0 1 0 0 0 7 3 2 0
1 8 0 0 1 1 6 4 5 0
0 7 3 2 0 0 6 0 1 0
1 6 4 5 0 1 0 1 0 0
0 6 0 1 0 1 8 0 0 1
1 0 1 0 0
1 8 0 0 1 13-54
 Cont…
 Since the number of lines is equal to the
number of rows, the problem is optimized
with the following optimal schedule.

Sales person Sales Office Quantity Sold

1 A 10
2 E 14
3 C 12
4 B 16
5 D 20
Total 72 units
13-55
Employee Scheduling

13-56
Input-Output Control

13-57