Concept explainers
Given the following information on job times and due dates, determine the optimal processing sequence using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, find the average job flow time and the average job tardiness. Jobs are listed in order of arrival.
1)
To determine: Sequence of jobs based on decision rule First Come First Served (FCFS).
Introduction: First Come First Served is the scheduling rule, which helps to arrange the sequence in the order. Here, the first come would be served first.
Answer to Problem 17P
Explanation of Solution
Given information:
Job | Job time (hours) | Due date (hours) |
a | 3.5 | 7 |
b | 2.0 | 6 |
c | 4.5 | 18 |
d | 5.0 | 22 |
e | 2.5 | 4 |
f | 6.0 | 20 |
Determine the sequence using FCFS:
According to FCFS, the first come would be served first. Hence, the jobs should be sequenced in the order as per its arrival.
Hence, the sequence of jobs using FCFS is a-b-c-d-e.
2)
To determine: Sequence of jobs based on decision rule Shortest Processing Time (SPT).
Introduction: Shortest Processing Tine is the scheduling rule, which helps to arrange the sequence in the order. Here, job with the shortest duration would be served first. Then, the process would be going on from shortest to largest duration.
Answer to Problem 17P
Explanation of Solution
Given information:
Job | Job time (hours) | Due date (hours) |
a | 3.5 | 7 |
b | 2.0 | 6 |
c | 4.5 | 18 |
d | 5.0 | 22 |
e | 2.5 | 4 |
f | 6.0 | 20 |
Determine the sequence using SPT:
According to SPT, the job that has the shortest processing would be served first and it goes on as the processing time increase. Duration should be assembled in the ascending order
Hence, the sequence of jobs using SPT is b-e-a-c-d-f.
3)
To determine: Sequence of jobs based on decision rule Earliest Due Date (EDD).
Introduction: Earliest Due Date is the scheduling rule, which helps to arrange the sequence in the order. Here, job with the earliest due date would be served first. Then, the process would be going on from earliest due date to latest due date.
Answer to Problem 17P
Explanation of Solution
Given information:
Job | Job time (hours) | Due date (hours) |
a | 3.5 | 7 |
b | 2.0 | 6 |
c | 4.5 | 18 |
d | 5.0 | 22 |
e | 2.5 | 4 |
f | 6.0 | 20 |
Determine the sequence using EDD:
According to EDD, the job that has the earliest due date would be served first and it goes on as the due date increases. The job should be arranged based on due date. Due date should be assembled in the ascending order
Hence, the sequence of jobs using EDD is e-b-a-c-f-d.
4)
To determine: Sequence of jobs based on decision rule critical ratio.
Introduction: Critical ratio is kind of scheduling rule that helps to identify that, the task or job is on the correct track. It would help to identify if the task is behind or ahead of the schedule.
Answer to Problem 17P
Explanation of Solution
Given information:
Job | Job time (hours) | Due date (hours) |
a | 3.5 | 7 |
b | 2.0 | 6 |
c | 4.5 | 18 |
d | 5.0 | 22 |
e | 2.5 | 4 |
f | 6.0 | 20 |
Determine the sequence using critical ratio:
Initial critical ratio should be determined at day 0:
Job | Job time (hours) | Due date (hours) | Critical ratio |
a | 3.5 | 7 | 2. |
b | 2.0 | 6 | 3 |
c | 4.5 | 18 | 4 |
d | 5.0 | 22 | 4.4 |
e | 2.5 | 4 | 1.6 |
f | 6.0 | 20 | 3.33 |
Critical ratio for Job a:
It is can be determined by dividing the value attained by subtracting the completion day of previous job from the due date of current job with the processing time.
Note: The procedure continues for all the jobs.
Job e has the lowest critical ratio. Thus, it will be completed first. Hence, Job e would be completed first in the sequence of jobs.
Determine the critical ratio after the completion of Job a:
As the processing time of job a is 2.5 hours, completion day of completed day would be 2.5.
Job | Job time (hours) | Due date (hours) | Critical ratio |
a | 3.5 | 7 | 1.29 |
b | 2.0 | 6 | 1.75 |
c | 4.5 | 18 | 3.44 |
d | 5.0 | 22 | 3.90 |
e | |||
f | 6.0 | 20 | 2.90 |
Critical ratio for Job a:
It is can be determined by dividing the value attained by subtracting the completion day of completed job from the due date of current job with the processing time.
Note: The procedure continues for all the jobs.
Job a has the lowest critical ratio. Hence, Job a would be completed next in the sequence of jobs after Job e.
Determine the critical ratio after the completion of Job e and Job a:
As the processing time of job e is 2.5 hours and Job a is 3.5, completion day of completed day would be 6 (2.5+3.5).
Job | Job time (hours) | Due date (hours) | Critical ratio |
a | |||
b | 2.0 | 6 | 0 |
c | 4.5 | 18 | 2.67 |
d | 5.0 | 22 | 3.20 |
f | 6.0 | 20 | 2.33 |
Critical ratio for Job b:
It is can be determined by dividing the value attained by subtracting the completion day of completed job from the due date of current job with the processing time.
Note: The procedure continues for all the jobs.
Job b has the lowest critical ratio. Hence, Job b would be completed next in the sequence of jobs after Job e and Job a.
Determine the critical ratio after the completion of Job e, Job a, and Job b:
As the processing time of job e is 2.5 hours, Job a is 3.5, and Job b is 2. Completion day of completed day would be 8 (2.5+3.5+2).
Job | Job time (hours) | Due date (hours) | Critical ratio |
a | |||
b | |||
c | 4.5 | 18 | 2.22 |
d | 5.0 | 22 | 2.80 |
f | 6.0 | 20 | 2.00 |
Critical ratio for Job c:
It is can be determined by dividing the value attained by subtracting the completion day of completed job from the due date of current job with the processing time.
Note: The procedure continues for all the jobs.
Job f has the lowest critical ratio. Hence, Job f would be completed next in the sequence of jobs.
Determine the critical ratio after the completion of Job e, Job a, Job b, and Job f:
As the processing time of job e is 2.5 hours, Job a is 3.5, Job b is 2, and Job f is 6.0. Completion day of completed day would be 14 (2.5+3.5+2+6).
Job | Job time (hours) | Due date (hours) | Critical ratio |
a | |||
b | |||
c | 4.5 | 18 | 2.22 |
d | 5.0 | 22 | 2.80 |
f |
Critical ratio for Job c:
It is can be determined by dividing the value attained by subtracting the completion day of completed job from the due date of current job with the processing time.
Note: The procedure continues for all the jobs.
Job c has the lowest critical ratio. Hence, Job c would be completed next in the sequence of jobs.
As Job d is the remaining job, it will be completed next.
Hence, the sequence of jobs using critical ratio is e-a-b-f-c-d.
Determine the average flow time and average tardiness:
First Come First Served:
Job | Job time (hours) | Due date (hours) | Flow time | Tardiness |
a | 3.5 | 7 | 3.5 | |
b | 2.0 | 6 | 5.5 | |
c | 4.5 | 18 | 10.0 | |
d | 5.0 | 22 | 15.0 | |
e | 2.5 | 4 | 17.5 | 13.5 |
f | 6.0 | 20 | 23.5 | 3.5 |
Total | 23.5 | 75.0 | 17.0 |
Supporting calculation:
Processing time and due date are given for each job. Flow time is the cumulative of the processing time.
Tardiness of Job a, Job, b, Job c, and Job d:
Flow time of Job a, Job b, Job c, and Job d is less than its respective due date. Hence, there would be no tardiness.
Tardiness of Job e:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job e is 13.5.
Tardiness of Job f:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job f is 3.5.
Average flow time:
It is calculated by dividing the total flow time and number of jobs.
Hence, average flow time is 12.5 hours.
Average tardiness:
It is calculated by dividing the total tardiness and number of jobs.
Hence, average tardiness is 2.83 hours
Shortest processing time:
Job | Job time (hours) | Due date (hours) | Flow time | Tardiness |
b | 2.0 | 6 | 2.0 | |
e | 2.5 | 4 | 4.5 | 0.5 |
a | 3.5 | 7 | 8.0 | 1.0 |
c | 4.5 | 18 | 12.5 | |
d | 5.0 | 22 | 17.5 | |
f | 6.0 | 20 | 23.5 | 3.5 |
Total | 23.5 | 68.0 | 5.0 |
Supporting calculation:
Processing time and due date are given for each job. Flow time is the cumulative of the processing time.
Tardiness of Job b, Job c, and Job d:
Flow time of Job b, Job c, and Job d is less than its respective due date. Hence, there would be no tardiness.
Tardiness of Job e:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job e is 0.5.
Tardiness of Job a:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job a is 1.
Tardiness of Job f:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job f is 3.5.
Average flow time:
It is calculated by dividing the total flow time and number of jobs.
Hence, average flow time is 11.33 hours.
Average tardiness:
It is calculated by dividing the total tardiness and number of jobs.
Hence, average tardiness is 0.83 hours
Earliest Due Date:
Job | Job time (hours) | Due date (hours) | Flow time | Tardiness |
e | 2.5 | 4 | 2.5 | |
b | 2.0 | 6 | 4.5 | |
a | 3.5 | 7 | 8.0 | 1.0 |
c | 4.5 | 18 | 12.5 | |
f | 6.0 | 20 | 18.5 | |
d | 5.0 | 22 | 23.5 | 1.5 |
Total | 23.5 | 69.5 | 2.5 |
Supporting calculation:
Processing time and due date are given for each job. Flow time is the cumulative of the processing time.
Tardiness of Job e, Job b, Job c, and Job f:
Flow time of Job e, Job b, Job c, and Job f is less than its respective due date. Hence, there would be no tardiness.
Tardiness of Job a:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job a is 1.
Tardiness of Job d:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job d is 1.5.
Average flow time:
It is calculated by dividing the total flow time and number of jobs.
Hence, average flow time is 11.58 hours.
Average tardiness:
It is calculated by dividing the total tardiness and number of jobs.
Hence, average tardiness is 0.42 hours
Critical ratio:
Job | Job time (hours) | Due date (hours) | Flow time | Tardiness |
e | 2.5 | 4 | 2.5 | |
a | 3.5 | 7 | 6.0 | |
b | 2.0 | 6 | 8.0 | 2.0 |
f | 6.0 | 20 | 14.0 | |
c | 4.5 | 18 | 18.5 | 0.5 |
d | 5.0 | 22 | 23.5 | 1.5 |
Total | 23.5 | 72.5 | 4.0 |
Supporting calculation:
Processing time and due date are given for each job. Flow time is the cumulative of the processing time.
Tardiness of Job e, Job a, and Job f:
Flow time of Job e, Job a, and Job f is less than its respective due date. Hence, there would be no tardiness.
Tardiness of Job b:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job b is 2.
Tardiness of Job c:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job c is 0.5.
Tardiness of Job d:
It is calculated by subtracting the flow time of the job from the due date of the project. Hence, the lateness of Job d is 1.5.
Average flow time:
It is calculated by dividing the total flow time and number of jobs.
Hence, average flow time is 12.08 hours.
Average tardiness:
It is calculated by dividing the total tardiness and number of jobs.
Hence, average tardiness is 0.67 hours.
Want to see more full solutions like this?
Chapter 16 Solutions
EBK OPERATIONS MANAGEMENT
- The day when the order arrived, processing time, and promised due dates are given in the following table. The jobs are listed in the order of arrival. Develop separate schedules by using the FCFS and EDD rules. Compare the schedules on the basis of average flow time and average past due days. Make a comment.arrow_forward. Assume the jobs displayed in Table 18.22 need to be processed on a single resource andare sequenced with the WSPT rule. Which job would be processed second?a. Ab. Bc. Cd. De. Earrow_forwardThe following five jobs, along with their processing time and due dates, are given below. Processing Days Due Job Time (days) From Today A 8 12 B 4 9 C 3 6 D 7 7 E 5 20 a. Use the Shortest Processing Time Rule (SPT), determine new sequence and determine the average flow-time for the five jobs b. Use the Earliest Due Date Rule (EDD), determine new sequence, and determine the average tardiness.arrow_forward
- The times required to complete each of eight jobs in a two-machine flow shop are shown in thetable that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B.a. Determine a sequence that will minimize makespan time.b. Construct a chart of the resulting sequence, and find machine B’s idle time. c. For the sequence determined in part a, how much would machine B’s idle time be reduced bysplitting the last two jobs in half?TIME (hours)Job Machine A Machine Ba 16 5b 3 13c 9 6d 8 7e 2 14f 12 4g 18 14h 20 11arrow_forwardGiven the data below, using the SPT heuristic sequencing rule, determine the completion date and tardiness for each job as well as the average completion time and average tardiness for all four jobs. Which of the following statements is true? Job Processing time (days) Due date (in days) A 10 10 B 5 8 C 15 25 D 8 15 a.Jobs B and D will have no tardiness b.The tardiness for Job A is 12 days c.The average tardiness is 19.75 d.The average completion time is 6.5arrow_forwardProcessing time for eight projects, displayed in the sequence they arrived. Project P1 P2 P3 P4 P5 P6 P7 P8 Processing time (hours) 3 1 1 2 9 6 1 1.50 2. Given the projects displayed in table above, if FCFS is used to sequence the jobs, what is the average flow rate of the projects? Note: Round your answer to 2 decimal places. 3. Given the projects displayed in table above, if FCFS is used to sequence the jobs, what is the average flow time of the projects? Note: Round your answer to 1 decimal place. 4. Given the projects displayed in table above, if FCFS is used to sequence the jobs, what is the average inventory of the projects? Note: Use your rounded answers from Parts 2 and 3. Round your answer to 1 decimal place. 5. Given the projects displayed in table above, if SPT is used to sequence the jobs, what is the average flow rate of the projects? Note: Round your answer to 2 decimal places. 6. Given the projects displayed in table above, if SPT is used to sequence…arrow_forward
- Using the information presented in the following table, identify the processing sequence that wouldresult using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, determine (1) average jobflow time, (2) average job tardiness, and (3) average number of jobs in the system. Jobs are listedin order of arrival. (Hint: First determine the total job time for each job by computing the total processing time for the job and then adding in the setup time. All times and due dates are in hours.)JobProcessingTime per UnitUnitsper JobSetupTimeDueDatea .14 45 0.7 4b .25 14 0.5 10c .10 18 0.2 12d .25 40 1.0 20e .10 75 0.5 15arrow_forwardGiven the following information on job times and due dates. Job Job Time(Hours) Due Date(Hours) a 3.5 7 b 2.0 6 c 4.5 18 d 5.0 22 e 2.5 4 f 6.0 20 a-1. Determine the optimal processing sequence using (1) First come, first served, (2) Shortest processing time, (3) Earliest due date, and (4) Critical ratio. Sequence for First come, first served Sequence for Shortest processing time Sequence for Earliest due date Sequence for Critical ratio a-2. For each method, find the average job flow time and the average job tardiness. (Round your answers to 2 decimal places.) First Come, FirstServed Shortest ProcessingTime Earliest Due Date Critical Ratio Average flow time Average job tardinessarrow_forwardGiven the information below, determine the following:(A) Processing sequence using (1) SPT and (2) EDD. (B) Average completion time and average job tardiness using (1) SPT and (2) EDD.arrow_forward
- Given the projects displayed in Table 18.21, if SPT is used to sequence the jobs, what isthe average flow time of the projects (in hours)?arrow_forwardTwo jobs must be processed through four machines in the same order. The processing times in the required sequence are (given) Determine how the two jobs should be scheduled in order to minimize the total makespan, and draw the Gantt chart indicating the optimal schedule.arrow_forwardSix jobs must be processed through machine A and then machine B as shown below. The processing time for each job is also shown.a. Develop a Gantt chart to determine the total time required to process all six jobs. Use the following sequence of jobs: 1, 2, 3, 4, 5, 6.b. Can you develop a better sequence to reduce the total time required for processing?arrow_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.