Concept explainers
a)
To determine: Thejob sequence, flow time, utilization metric, average number of jobs, and average lateness for EDD, SPT, LPT, and FCFS.
Introduction:
a)
Answer to Problem 18P
The values in the given table have been computed.
Explanation of Solution
Given information:
The following information has been given:
Job | Date order received | Production days needed | Date order due |
BR-02 | 228 | 15 | 300 |
CX-01 | 225 | 25 | 270 |
DE-06 | 230 | 35 | 320 |
RG-05 | 235 | 40 | 360 |
SY-11 | 231 | 30 | 310 |
All the jobs are arrived on day 241.
Table to compute:
Dispatching rule | Job sequence | Flow time | Utilization rating | Average number of jobs | Average lateness |
EDD | |||||
SPT | |||||
LPT | |||||
FCFS |
Computed table:
Dispatching rule | Job sequence | Flow time | Utilization rating | Average number of jobs | Average lateness |
EDD | CX-BR-SY-DE-RG | 385 | 37.60% | 2.66 | 10 |
SPT | BR-CX-SY-DE-RG | 375 | 38.60% | 2.59 | 12 |
LPT | RG-DE-SY-CX-BR | 495 | 29.30% | 3.41 | 44 |
FCFS | CX-BR-DE-SY-RG | 390 | 37.20% | 2.69 | 12 |
Supporting calculation:
Determine the sequence of the job using FCFS:
Processing time | Due date | Flow time | Completion time | Late | |
BR-02 | 15 | 300 | 15 | 265 | 0 |
CX-01 | 25 | 270 | 40 | 280 | 0 |
DE-06 | 35 | 320 | 75 | 315 | 0 |
RG-05 | 40 | 360 | 115 | 345 | 35 |
SY-11 | 30 | 310 | 145 | 385 | 25 |
Total | 390 | 60 |
Working note:
Duration and due date for the jobs has been given. Flow time is the cumulative value of the duration. Jobs arrival rate is given as 241.
First Come First Served (FCFS):
Completion day of CX-01:
Jobs arrival rate is given as 241. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 265.
Completion day of BR-02:
Start day of BR-02 is the next day of the completion day of CX-01. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 280.
Completion day of DE-06:
Start day of DE-06 is the next day of the completion day of BR-02. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day of DE-06 is 315.
Completion day of SY-11:
Start day of SY-11 is the next day of the completion day of DE-06. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day of SY-11 is 345.
Completion day of RG-05:
Start day of RG-05 is the next day of the completion day of SY-11. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day of RG-05 is 385.
Lateness of CX-01, BR-02, and DE-06:
Completion day of CX-01, BR-02, and DE-06 is less than its respective due date. Hence, there would be no lateness.
Lateness of SY-11:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 35.
Lateness of RG-05:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 25.
Determine the sequence of the job using SPT:
Processing time | Due date | Flow time | Completion time | Late | |
BR-02 | 15 | 300 | 15 | 255 | 0 |
CX-01 | 25 | 270 | 40 | 280 | 10 |
SY-11 | 30 | 310 | 70 | 310 | 0 |
DE-06 | 35 | 320 | 105 | 345 | 25 |
RG-05 | 40 | 360 | 145 | 385 | 25 |
Total | 375 | 60 |
Working note:
Duration and due date for the jobs has been given. Flow time is the cumulative value of the duration. Jobs arrival rate is given as 241.
Shortest Processing Time (SPT):
Completion day of BR-02:
Jobs arrival rate is given as 241. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 255.
Completion day of CX-01:
Start day of CX-01 is the next day of the completion day of BR-02. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 280.
Completion day of SY-11:
Start day of SY-11 is the next day of the completion day of CX-01. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 310.
Completion day of DE-06:
Start day of DE-06 is the next day of the completion day of SY-11. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 345.
Completion day of RG-05:
Start day of RG-05 is the next day of the completion day of DE-06. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 385.
Lateness of BR-02 and SY-11:
Completion day of BR-02 and SY-11 is less than its respective due date. Hence, there would be no lateness.
Lateness of CX-01:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 10.
Lateness of DE-06:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 25.
Lateness of RG-05:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 25.
Determine the sequence of the job using LPT:
Processing time | Due date | Flow time | Completion time | Late | |
RG-05 | 40 | 360 | 40 | 280 | 0 |
DE-06 | 35 | 320 | 75 | 315 | 0 |
SY-11 | 30 | 310 | 105 | 345 | 35 |
CX-01 | 25 | 270 | 130 | 370 | 100 |
BR-02 | 15 | 300 | 145 | 385 | 85 |
Total | 495 | 220 |
Working note:
Duration and due date for the jobs has been given. Flow time is the cumulative value of the duration. Jobs arrival rate is given as 241.
Largest Processing Time (LPT):
Completion day of RG-05:
Jobs arrival rate is given as 241. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 280.
Completion day of DE-06:
Start day of DE-06 is the next day of the completion day of RG-05. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 315.
Completion day of SY-11:
Start day of SY-11 is the next day of the completion day of DE-06. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 345.
Completion day of CX-01:
Start day of CX-01 is the next day of the completion day of SY-11. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 370.
Completion day of BR-02:
Start day of BR-02 is the next day of the completion day of CX-01. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 385.
Lateness of RG-05 and DE-06:
Completion day of RG-05 and DE-06 is less than its respective due date. Hence, there would be no lateness.
Lateness of SY-11:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 35.
Lateness of CX-01:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 100.
Lateness of BR-02:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 85.
Determine the sequence of the job using EDD:
Processing time | Due date | Flow time | Completion time | Late | |
CX-01 | 25 | 270 | 25 | 265 | 0 |
BR-02 | 15 | 300 | 40 | 280 | 0 |
SY-11 | 30 | 310 | 70 | 310 | 0 |
DE-06 | 35 | 320 | 105 | 345 | 25 |
RG-05 | 40 | 360 | 145 | 385 | 25 |
Total | 385 | 50 |
Working note:
Duration and due date for the jobs has been given. Flow time is the cumulative value of the duration. Jobs arrival rate is given as 241.
Earliest Due Date (EDD):
Completion day of CX-01:
Jobs arrival rate is given as 241. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 265.
Completion day of BR-02:
Start day of BR-02 is the next day of the completion day of CX-01. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day is 280.
Completion day of SY-11:
Start day of SY-11 is the next day of the completion day of DE-06. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day of SY-11 is 310.
Completion day of DE-06:
Start day of DE-06 is the next day of the completion day of BR-02. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day of DE-06 is 345.
Completion day of RG-05:
Start day of RG-05 is the next day of the completion day of SY-11. Completion day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the completion day of RG-05 is 385.
Lateness of CX-01, BR-02, and SY-11:
Completion day of CX-01, BR-02, and SY-11 is less than its respective due date. Hence, there would be no lateness.
Lateness of DE-06:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 25.
Lateness of RG-05:
It is calculated by subtracting the completion day of the job from the due date of the project. Hence, the lateness is 25.
Summary:
Dispatching rule | Job sequence | Flow time | Utilization rating | Average number of jobs | Average lateness |
EDD | CX-BR-SY-DE-RG | 385 | 37.60% | 2.66 | 10 |
SPT | BR-CX-SY-DE-RG | 375 | 38.60% | 2.59 | 12 |
LPT | RG-DE-SY-CX-BR | 495 | 29.30% | 3.41 | 44 |
FCFS | CX-BR-DE-SY-RG | 390 | 37.20% | 2.69 | 12 |
Working note:
Job sequence and flow time have been calculated in the above segments.
Earliest Due Date (EDD):
Average lateness:
It is calculated by dividing the total lateness with the number of jobs. Hence, the average tardiness is 10.
Average number of jobs in the system:
It is calculated by dividing the total flow time with total duration of all the jobs. Hence, the average number of jobs in the system is 2.66.
Utilization rating:
It is calculated by dividing total processing time and total flow time. Hence, the utilization rating is 38.6%.
Shortest Processing Time (SPT):
Average lateness:
It is calculated by dividing the total lateness with the number of jobs. Hence, the average tardiness is 12.
Average number of jobs in the system:
It is calculated by dividing the total flow time with total duration of all the jobs. Hence, the average number of jobs in the system is 2.59.
Utilization rating:
It is calculated by dividing total processing time and total flow time. Hence, the utilization rating is 38.6%.
Largest Processing Time (LPT):
Average lateness:
It is calculated by dividing the total lateness with the number of jobs. Hence, the average tardiness is 44.
Average number of jobs in the system:
It is calculated by dividing the total flow time with total duration of all the jobs. Hence, the average number of jobs in the system is 3.41.
Utilization rating:
It is calculated by dividing total processing time and total flow time. Hence, the utilization rating is 29.3%.
First Come First Served (FCFS):
Average lateness:
It is calculated by dividing the total lateness with the number of jobs. Hence, the average tardiness is 44.
Average number of jobs in the system:
It is calculated by dividing the total flow time with total duration of all the jobs. Hence, the average number of jobs in the system is 2.69.
Utilization rating:
It is calculated by dividing total processing time and total flow time. Hence, the utilization rating is 37.2%.
b)
To determine: The dispatching rule that has the best score in flow time.
Introduction: Scheduling is the process of controlling and arranging the workloads of the production process using the optimized way. It is used to plan on allocating human resources and machinery.
b)
Answer to Problem 18P
Shortest Processing Time has the best flow time.
Explanation of Solution
Given information:
The following information has been given:
Job | Date order received | Production days needed | Date order due |
BR-02 | 228 | 15 | 300 |
CX-01 | 225 | 25 | 270 |
DE-06 | 230 | 35 | 320 |
RG-05 | 235 | 40 | 360 |
SY-11 | 231 | 30 | 310 |
Best score in flow time:
Dispatching rule | Job sequence | Flow time | Utilization rating | Average number of jobs | Average lateness |
EDD | CX-BR-SY-DE-RG | 385 | 37.60% | 2.66 | 10 |
SPT | BR-CX-SY-DE-RG | 375 | 38.60% | 2.59 | 12 |
LPT | RG-DE-SY-CX-BR | 495 | 29.30% | 3.41 | 44 |
FCFS | CX-BR-DE-SY-RG | 390 | 37.20% | 2.69 | 12 |
According to the above table, Shortest Processing Time (SPT) has the best score in flow time. It has less flow time when compare to EDD, LPT, and FCFS.
Hence, SPT has the best score in flow time.
c)
To determine: The dispatching rule that has the best score in utilization metric.
Introduction: Scheduling is the process of controlling and arranging the workloads of the production process using the optimized way. It is used to plan on allocating human resources and machinery.
c)
Answer to Problem 18P
Shortest Processing Time has the best utilization metric.
Explanation of Solution
Given information:
The following information has been given:
Job | Date order received | Production days needed | Date order due |
BR-02 | 228 | 15 | 300 |
CX-01 | 225 | 25 | 270 |
DE-06 | 230 | 35 | 320 |
RG-05 | 235 | 40 | 360 |
SY-11 | 231 | 30 | 310 |
Best score in utilization metric:
Dispatching rule | Job sequence | Flow time | Utilization rating | Average number of jobs | Average lateness |
EDD | CX-BR-SY-DE-RG | 385 | 37.60% | 2.66 | 10 |
SPT | BR-CX-SY-DE-RG | 375 | 38.60% | 2.59 | 12 |
LPT | RG-DE-SY-CX-BR | 495 | 29.30% | 3.41 | 44 |
FCFS | CX-BR-DE-SY-RG | 390 | 37.20% | 2.69 | 12 |
According to the above table, Shortest Processing Time (SPT) has the best score in utilization metric. It has maximum utilization metric when compare to EDD, LPT, and FCFS.
Hence, SPT has the best score in utilization metric.
d)
To determine: The dispatching rule that has the best score in average lateness.
Introduction: Scheduling is the process of controlling and arranging the workloads of the production process using the optimized way. It is used to plan allocating human resources and machinery.
d)
Answer to Problem 18P
Earliest Due Date has the best utilization metric.
Explanation of Solution
Given information:
The following information has been given:
Job | Date order received | Production days needed | Date order due |
BR-02 | 228 | 15 | 300 |
CX-01 | 225 | 25 | 270 |
DE-06 | 230 | 35 | 320 |
RG-05 | 235 | 40 | 360 |
SY-11 | 231 | 30 | 310 |
Best score in average lateness:
Dispatching rule | Job sequence | Flow time | Utilization rating | Average number of jobs | Average lateness |
EDD | CX-BR-SY-DE-RG | 385 | 37.60% | 2.66 | 10 |
SPT | BR-CX-SY-DE-RG | 375 | 38.60% | 2.59 | 12 |
LPT | RG-DE-SY-CX-BR | 495 | 29.30% | 3.41 | 44 |
FCFS | CX-BR-DE-SY-RG | 390 | 37.20% | 2.69 | 12 |
According to the above table, Earliest Due Date (EDD) has the best score in average lateness. It has less average lateness when compare to SPT, LPT, and FCFS.
Hence, EDD has the best score in average lateness.
e)
To determine: The dispatching rule that would be selected by Person X.
Introduction: Scheduling is the process of controlling and arranging the workloads of the production process using the optimized way. It is used to plan allocating human resources and machinery.
e)
Answer to Problem 18P
Person X would select Earliest Due Date.
Explanation of Solution
Given information:
The following information has been given:
Job | Date order received | Production days needed | Date order due |
BR-02 | 228 | 15 | 300 |
CX-01 | 225 | 25 | 270 |
DE-06 | 230 | 35 | 320 |
RG-05 | 235 | 40 | 360 |
SY-11 | 231 | 30 | 310 |
Best score in average lateness:
Dispatching rule | Job sequence | Flow time | Utilization rating | Average number of jobs | Average lateness |
EDD | CX-BR-SY-DE-RG | 385 | 37.60% | 2.66 | 10 |
SPT | BR-CX-SY-DE-RG | 375 | 38.60% | 2.59 | 12 |
LPT | RG-DE-SY-CX-BR | 495 | 29.30% | 3.41 | 44 |
FCFS | CX-BR-DE-SY-RG | 390 | 37.20% | 2.69 | 12 |
According to the above table, EDD has the less average lateness and other values are also having a slight difference when compared with SPT. Thus, EDD should be selected.
Hence, Person X would choose Earliest Due Date (EDD).
Want to see more full solutions like this?
Chapter 15 Solutions
Pearson eText Principles of Operations Management: Sustainability and Supply Chain Management -- Instant Access (Pearson+)
- Question A.Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line Fastarrow_forwardQuestion one: Suppose a radiology department uses FCFS to determine how to sequence patient x-rays. Assuming these data are representative, compare between FCFS and other scheduling rules should the radiology department be using and why Processing Time (Minutes) Due Time (Minutes from Now) Patient A 35 140 B 15 180 35 360 D 25 290 E 30 420 F 25 20 G 35 180 H 30 290 20 110 K 25 150 L 15 270 M 30 390 20 220 20 400 P 10 330 Q 10 80 R 15 230 20 370arrow_forwardFinite capacity scheduling Question 20 options: schedules jobs through a number of work centers, each with one or more machines. All of these choices are correct. is an extension of the theory of constraints. requires that jobs are scheduled whole (cannot be split).arrow_forward
- QUESTION 5 (SCHEDULING: CYCLICAL SCHEDULING) 15.26 Daniel's Barber Shop at Newark Airport is open 7 days a week but has fluctuating demand. Daniel Ball is inter- ested in treating his barbers as well as he can with steady work and preferably 5 days of work with two consecutive days off. His analysis of his staffing needs resulted in the following plan. Schedule Daniel's staff with the minimum number of barbers. DAY MON. TUE. WED. THU. FRI. SAT. SUN. 6 5 5 5 6 4 3 Barbers neededarrow_forwardQuestion fourThree jobs are to be scheduled on two machines A and B. Assume that the jobs are processed in the sequence A-B (A has to finish the job before B can continue the job). The processing times are: Job A B1 5 42 7 73 3 5Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.arrow_forwardQuestion one: Suppose a radiology department uses FCFS to determine how to sequence patient x-rays. Assuming these data are representative, compare between FCFS and other scheduling rules should the radiology department be using and why Processing Time (Minutes) Due Time (Minutes from Now) Patient A 35 140 B 180 15 35 360 25 290 E 30 420 25 20 G 35 80 30 290 20 110 K 25 15 150 270 M 30 390 20 220 20 400 10 330 10 80 R 15 230 20 370 当 五犯 LEzlolalolclnarrow_forward
- Question Three Processing times (including setup times), and due dates for five jobs waiting to be processed at a work center are given in the following table. By Using the SPT rule determine the following: The sequence of jobs The average flow time The average job tardiness The average number of jobs at the work center Job Processing Time (hours) Hour Due A 17 15 B 10 25 C 5 20 D 7 32 E 11 38arrow_forwardQUESTION 5a. A Chef bakes and decorates cakes in a two-stage process. The cakes are baked and once cooledthey are then decorated based on the clients’ requirements. The Chef received seven orders forfully decorated cakes and has documented the orders with respective processing times for bakingand decorating, as shown in Table 7 that follows:.Table 7. Cake Job Orders received by the Chef with the respective processing times for Baking andDecoratingCake Job Order Baking Processing Time Decorating Processing TimeA 2 1B 8 5C 4 6D 9 7E 7 8F 9 6G 3 5 (ii) Illustrate the flow (throughput) times to complete the baking and decorating on atimeline chart.arrow_forwardQUESTION 5a. A Chef bakes and decorates cakes in a two-stage process. The cakes are baked and once cooledthey are then decorated based on the clients’ requirements. The Chef received seven orders forfully decorated cakes and has documented the orders with respective processing times for bakingand decorating, as shown in Table 7 that follows:.Table 7. Cake Job Orders received by the Chef with the respective processing times for Baking andDecoratingCake Job Order Baking Processing Time Decorating Processing TimeA 2 1B 8 5C 4 6D 9 7E 7 8F 9 6G 3 5 (i) Using Johnson’s Rule, determine the optimum sequence for processing the cake joborders through the baking and decorating stages.arrow_forward
- Question four Three jobs are to be scheduled on two machines A and B. Assume that the jobs are processed in the sequence A-B (A has to finish the job before B can continue the job). The processing times are: Job A 1 4 2 7 7 3 3 Draw a Gantt chart that shows the schedule corresponding to the sequence 1-2-3 of the jobs.arrow_forwardQuestion attachedarrow_forwardQUESTION 6 The framing department has six jobs waiting to be processed as shown in Table 3 below. It is now time zero and all jobs are ready to begin. Each has only one operation remaining. Table 3 Jobs (In order of arrival) Processing Time Due Date A 5 12 B 7 18 C 8. 14 D 3 10 E 9 22 F 12 17 Using minimum flow time as the evaluation criterion, recommend the best rule to sequence the jobs from the list below: i. FCFS ii. SOT iii. EDD iv. STRarrow_forward
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill EducationOperations and Supply Chain Management (Mcgraw-hi...Operations ManagementISBN:9781259666100Author:F. Robert Jacobs, Richard B ChasePublisher:McGraw-Hill Education
- Purchasing and Supply Chain ManagementOperations ManagementISBN:9781285869681Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. PattersonPublisher:Cengage LearningProduction and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.