Escolar Documentos
Profissional Documentos
Cultura Documentos
Case Study
Keep Patient Waiting? Not in My Office!
` What features of the appointment scheduling system
were crucial in capturing “many grateful patients”?
` Wh t procedure
What d were followed
f ll d to
t keep
k the
th appointment
i t t
system flexible enough to accommodate the emergency
cases, and yet be able to keep up with the other patients’
appointments?
Chapter 17 ` How were the special cases such as latecomers and no-
Operations Scheduling shows handled?
3 4
3 4
5 6
7 8
7 8
9 10
Priority Rules for Job Sequencing Example of Job Sequencing:
(Continued) First-Come First-Served
Jobs (in order Processing Due Date
6. Critical ratio (CR) 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
(Due date - Current date)
CR =
C 3 6
D 1 4
Number of days remaining What is the FCFS schedule?
Do all the jobs get done on time?
No, Jobs B, C,
7. Last come, first served (LCFS) Jobs (in order Processing Due Date Flow Time
and D are
going to be late
of arrival) Time (days) (days hence) (days)
8. Random order or whim A 4 5 4
B 7 10 11
C 3 6 14
D 1 4 15
9 10
11 12
Example of Job Sequencing: Example of Job Sequencing:
Shortest Operating Time Earliest Due Date First
Jobs (in order Processing Due Date Jobs (in order Processing Due Date
Suppose you have the four of arrival) Time (days) (days hence) Suppose you have the four of arrival) Time (days) (days hence)
jobs to the right arrive for A 4 5 jobs to the right arrive for A 4 5
processing on one machine B 7 10 processing on one machine B 7 10
C 3 6 C 3 6
D 1 4 D 1 4
JJobs
b (i(in order
d P
Processing
i D D
Due Date Flow
Fl Time
Ti
No, Jobs A Jobs (in order Processing Due Date Flow Time No, Jobs C
of arrival) Time (days) (days hence) (days)
and B are of arrival) Time (days) (days hence) (days) and B are
D 1 4 1 going to be D 1 4 1 going to be
C 3 6 4 late A 4 5 5 late
A 4 5 8 C 3 6 8
B 7 10 15 B 7 10 15
11 12
13 14
Example of Job Sequencing: Example of Job Sequencing:
Critical Ratio Method Last-Come First-Served
Jobs (in order Processing Due Date Jobs (in order Processing Due Date
Suppose you have the four of arrival) Time (days) (days hence) Suppose you have the four of arrival) Time (days) (days hence)
jobs to the right arrive for A 4 5 jobs to the right arrive for A 4 5
processing on one machine B 7 10 processing on one machine B 7 10
C 3 6 C 3 6
D 1 4 D 1 4
What is the CR schedule? Do all the jobs get done on time?
What is the LCFS schedule? Do all the jobs get done on time?
In order to do this schedule the CR’s have be calculated No, but since
for each job. If we let today be Day 1 and allow a total of there is a
15 days to do the work. The resulting CR’s and order three-way
three way tie, Jobs (in order Processing Due Date Flow Time
schedule are: only the first of arrival) Time (days) (days hence) (days) No, Jobs B
CR(A)=(5-4)/15=0.06 (Do this job last) job or two will D 1 4 1 and A are
CR(B)=(10-7)/15=0.20 (Do this job first, tied with C and D) be on time C 3 6 4 going to be
CR(C)=(6-3)/15=0.20 (Do this job first, tied with B and D) B 7 10 11 late
CR(D)=(4-1)/15=0.20 (Do this job first, tied with B and C) A 4 5 15
13 14
15 16
15 16
17 18
Example of Job Sequencing: Shop-Floor Control:
Johnson’s Rule (Part 2) Major Functions
First, select the job with the
smallest time in either stage.
Time in Hours 1. Assigning priority of each shop order
Jobs Stage 1 Stage 2
That is Job D with the smallest A 1.50 1.25
B 2.00 3.00
time in the first stage. Place that
job as early as possible in the C 2.50 2.00
2. Maintaining work-in-process quantity information
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 3. Conveying shop-order status information to the
sequence.
office
Drop A out, select the next smallest time. There is a tie in two stages for
two different jobs
jobs. In this case
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
17 Job Assigned D B C A 18
19 20
Shop-Floor Control:
Major Functions (Continued) Input/Output Control
4. Providing actual output data for capacity control
purposes Input
Work
Output
Center
19 20
21 22
Principles of Job Shop Scheduling
Principles of Work Center Scheduling (Continued)
1. There is a direct equivalence between work flow 6. Reschedule every day
and cash flow 7. Obtain feedback each day on jobs that are not
2. The effectiveness of any job shop should be completed
l d at eachh workk center
measured by speed of flow through the shop 8. Match work center input information to what the
3. Schedule jobs as a string, with process steps worker can actually do
back-to-back
9. When seeking improvement in output, look for
4. A jjob once started should not be interrupted
p incompatibility between engineering design and
process execution
i
5. Speed of flow is most efficiently achieved by
focusing on bottleneck work centers and jobs 10. Certainty of standards, routings, and so forth is not
possible in a job shop, but always work towards
achieving it
21 22
23 24
27 28
Question Bowl
Which of the following is a Principle of Work-Center
Scheduling?
a. There is a direct equivalence between work flow and
cash flow
b. Certainty of routings are very possible in a shop
c. Reschedule only once a week
d. All of the above
e. None of the above