Concept explainers
Using the information presented in the following table, identify the processing sequence that would result using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, determine (1) average job flow time, (2) average job tardiness, and (3) average number of jobs in the system. Jobs are listed in 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.)
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 7P
Explanation of Solution
Given information:
Job | Processing time per unit | Units per job | Setup time | Due date |
a | 0.14 | 45 | 0.7 | 4 |
b | 0.25 | 14 | 0.5 | 10 |
c | 0.1 | 18 | 0.2 | 12 |
d | 0.25 | 40 | 1 | 20 |
e | 0.1 | 75 | 0.5 | 15 |
Due date is given. Job time should be determined using the given processing time per unit, units per job, and setup time.
Example:
The procedure should be repeated for all the jobs. The resultant table is as follows:
Job | Job time (hours) | Due date (hours) |
a | 7 | 4 |
b | 4 | 10 |
c | 2 | 12 |
d | 11 | 20 |
e | 8 | 15 |
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.
Determine average flow time, average tardiness, and average number of jobs for FCFS:
Job | Processing time (hours) | Due date (hours) | Flow time | Tardiness |
a | 7 | 4 | 7 | 3 |
b | 4 | 10 | 11 | 1 |
c | 2 | 12 | 13 | 1 |
d | 11 | 20 | 24 | 4 |
e | 8 | 15 | 32 | 17 |
Total | 32 | 61 | 87 | 26 |
Average | 6.4 | 12.2 | 17.4 | 5.2 |
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:
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 3.
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 1.
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 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 4.
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 17.
Average flow time:
It is calculated by dividing the total flow time and number of jobs.
Hence, average flow time is 17.40 hours.
Average tardiness:
It is calculated by dividing the total tardiness and number of jobs.
Hence, average tardiness is 5.20 hours.
Average number of jobs:
It can be determined by dividing the total flow time and total processing time.
Hence, average number of jobs is 2.72 jobs.
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 7P
Explanation of Solution
Given information:
Job | Processing time per unit | Units per job | Setup time | Due date |
a | 0.14 | 45 | 0.7 | 4 |
b | 0.25 | 14 | 0.5 | 10 |
c | 0.1 | 18 | 0.2 | 12 |
d | 0.25 | 40 | 1 | 20 |
e | 0.1 | 75 | 0.5 | 15 |
Due date is given. Job time should be determined using the given processing time per unit, units per job, and setup time.
Example:
The procedure should be repeated for all the jobs. The resultant table is as follows:
Job | Job time (hours) | Due date (hours) |
a | 7 | 4 |
b | 4 | 10 |
c | 2 | 12 |
d | 11 | 20 |
e | 8 | 15 |
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 c-b-a-e-d.
Determine average flow time, average tardiness, and average number of jobs for SPT:
Job | Job time (hours) | Due date (hours) | Flow time | Tardiness |
c | 2 | 12 | 2 | 0 |
b | 4 | 10 | 6 | 0 |
a | 7 | 4 | 13 | 9 |
e | 8 | 15 | 21 | 6 |
d | 11 | 20 | 32 | 12 |
Total | 32 | 61 | 74 | 27 |
Average | 6.4 | 12.2 | 14.8 | 5.4 |
Supporting calculation:
Processing time and due date are given for each job. Flow time is the cumulative of the processing time.
Tardiness of Job c, and Job b:
Flow time of Job c and Job b 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 9.
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 6.
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 12.
Average flow time:
It is calculated by dividing the total flow time and number of jobs.
Hence, average flow time is 14.80 hours.
Average tardiness:
It is calculated by dividing the total tardiness and number of jobs.
Hence, average tardiness is 5.40 hours.
Average number of jobs:
It can be determined by dividing the total flow time and total processing time.
Hence, average number of jobs is 2.31 jobs.
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 7P
Explanation of Solution
Given information:
Job | Processing time per unit | Units per job | Setup time | Due date |
a | 0.14 | 45 | 0.7 | 4 |
b | 0.25 | 14 | 0.5 | 10 |
c | 0.1 | 18 | 0.2 | 12 |
d | 0.25 | 40 | 1 | 20 |
e | 0.1 | 75 | 0.5 | 15 |
Due date is given. Job time should be determined using the given processing time per unit, units per job, and setup time.
Example:
The procedure should be repeated for all the jobs. The resultant table is as follows:
Job | Job time (hours) | Due date (hours) |
a | 7 | 4 |
b | 4 | 10 |
c | 2 | 12 |
d | 11 | 20 |
e | 8 | 15 |
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 a-b-c-e-d.
Determine average flow time, average tardiness, and average number of jobs for EDD:
Job | Job time (hours) | Due date (hours) | Flow time | Tardiness |
a | 7 | 4 | 7 | 3 |
b | 4 | 10 | 11 | 1 |
c | 2 | 12 | 13 | 1 |
e | 8 | 15 | 21 | 6 |
d | 11 | 20 | 32 | 12 |
Total | 32 | 61 | 84 | 23 |
Average | 6.4 | 12.2 | 16.8 | 4.6 |
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:
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 3.
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 1.
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 1.
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 6.
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 12.
Average flow time:
It is calculated by dividing the total flow time and number of jobs.
Hence, average flow time is 16.80 hours.
Average tardiness:
It is calculated by dividing the total tardiness and number of jobs.
Hence, average tardiness is 4.60 hours.
Average number of jobs:
It can be determined by dividing the total flow time and total processing time.
Hence, average number of jobs is 2.63 jobs.
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 7P
Explanation of Solution
Given information:
Job | Processing time per unit | Units per job | Setup time | Due date |
a | 0.14 | 45 | 0.7 | 4 |
b | 0.25 | 14 | 0.5 | 10 |
c | 0.1 | 18 | 0.2 | 12 |
d | 0.25 | 40 | 1 | 20 |
e | 0.1 | 75 | 0.5 | 15 |
Due date is given. Job time should be determined using the given processing time per unit, units per job, and setup time.
Example:
The procedure should be repeated for all the jobs. The resultant table is as follows:
Job | Job time (hours) | Due date (hours) |
a | 7 | 4 |
b | 4 | 10 |
c | 2 | 12 |
d | 11 | 20 |
e | 8 | 15 |
Determine the sequence using critical ratio:
Initial critical ratio should be determined at day 0:
Job | Processing time (hours) | Due date | Critical ratio |
a | 7 | 4 | 0.57 |
b | 4 | 10 | 2.5 |
c | 2 | 12 | 6 |
d | 11 | 20 | 1.82 |
e | 8 | 15 | 1.88 |
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: Process continues for all the jobs.
Job a has the lowest critical ratio. Thus, it will be completed first. Hence, Job a 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 7 hours, completion day of completed day would be 7.
Job | Processing time (hours) | Due date | Critical ratio |
a | - | - | - |
b | 4 | 10 | 0.75 |
c | 2 | 12 | 2.5 |
d | 11 | 20 | 1.18 |
e | 8 | 15 | 1 |
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: Process continues for all the jobs.
Job b has the lowest critical ratio. Hence, Job b would be completed next in the sequence of jobs.
Determine the critical ratio after the completion of Job a and Job b:
As the processing time of job a is 7 hours and Job b is 4, completion day of completed day would be 11 (7+4).
Job | Processing time (hours) | Due date | Critical ratio |
a | - | - | - |
b | - | - | - |
c | 2 | 12 | 0.5 |
d | 11 | 20 | 0.82 |
e | 8 | 15 | 0.5 |
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.
Job c has the lowest critical ratio (break the tie arbitrarily). Hence, Job c would be completed next in the sequence of jobs after Job a and Job b.
Determine the critical ratio after the completion of Job a, Job b and Job c:
As the processing time of job a is 7 hours, Job b is 4, and Job c is 2 hours. completion day of completed day would be 13 (7+4+2).
Job | Processing time (hours) | Due date | Critical ratio |
a | - | - | - |
b | - | - | - |
c | - | - | - |
d | 11 | 20 | 0.82 |
e | 8 | 15 | 0.5 |
Critical ratio for Job d:
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.
Job e has the lowest critical ratio. Hence, Job e would be completed next in the sequence of jobs after Job a, Job b, and Job c.
As Job d is the remaining job, it will be completed next.
Hence, the sequence of jobs using critical ratio is a-b-c-e-d.
Average flow time:
It is calculated by dividing the total flow time and number of jobs.
Hence, average flow time is 16.80 hours.
Average tardiness:
It is calculated by dividing the total tardiness and number of jobs.
Hence, average tardiness is 4.60 hours.
Average number of jobs:
It can be determined by dividing the total flow time and total processing time.
Hence, average number of jobs is 2.63 jobs.
Want to see more full solutions like this?
Chapter 16 Solutions
OPERATIONS MANAGEMENT>CUSTOM<
- 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_forwardThe 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_forwardThe following six jobs are to be scheduled on a single machine: Job 1 2 3 4 5 6 Processing time (min.) 110 120 220 90 180 80 Suppose the jobs are processed in FCFS numerical order. Compute the makespan, flow time for each job, and overall average flow time. Round your answers to the nearest whole number. Job Flow Time (min) 1 2 3 4 5 6 Makespan: minutes Average flow time: minutes In what order would the jobs be processed using the SPT rule? The SPT sequence is - - - - - . Compute the average flow time after each job is completed. Round your answer to the nearest whole number. Average flow time: minutes Compare this answer with your answer to part a. The minimizes flow time and gets the most work done in the least amount of time.arrow_forward
- The following table shows orders to be processed at a machine shop as of 8:00 a.m. Monday. The jobs have different operations they must go through. Processing times are in days. Jobs are listed in order of arrival. Job Processing Time (Days) Due Date (Days) Remaining Number of Operations A 8 20 2 B 10 18 4 C 5 25 5 D 11 17 3 E 9 35 4 Click here for the Excel Data File a. Determine the processing sequence at the first work center using each of these rules: (1) First come, first served, (2) Slack per operation. (Hint: In case of a tie choose the jobs in alphabetical order.) b. Compute the effectiveness of each rule using each of these measures: (1) average completion time, (2) average number of jobs at the work center. (Round your answers to 2 decimal places.)arrow_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_forwardCurrently a company that designs Web sites has six customers in its backlog. The time since the order arrived, processing time, and promised due dates are given in the following table. Job Time Since Order Arrived (days ago) Processing Time (days) Due Date (days from now) A 6 18 48 B 4 22 52 C 1 30 70 D 10 14 28 E 7 12 56 F 5 20 62 Develop a schedule by using the first-come, first-served (FCFS) rule and calculate the average flow time and average days past due for the schedule. Develop a schedule by using the earliest due date (EDD) rule and calculate the average flow time and average days past due for the schedule. Comment on the performance of the FCFS and EDD rules relative to average flow time and average days past due.arrow_forward
- The times required to complete each of eight jobs in a two-machine flow shop are shown in the table that follows. Each job must follow the same sequence, beginning with machine A and moving to machine B. TIME (hours) Job Machine A Machine B a 16 5 b 3 13 c 8 7 d 9 6 e 2 14 f 14 4 g 18 14 h 20 11 Find machine B’s idle time For the sequence determined in part a, how much would machine B's idle time be reduced by splitting the last two jobs in half?arrow_forwardGiven the following data for the processing time in hours for each Job in eachMachine, determine the following:a. Optimal job flow sequenceb. Total span time and idle timeNeed answer asap. Please include the solution/computation. Thank you.arrow_forwardAn architect has five projects to complete. She estimates that three of the projects willrequire one week to complete and the other two will require three weeks and four weeks.During the time these projects are completed (and assuming no other projects areworked on during this time), what is the architect’s flow rate (projects per week)?arrow_forward
- Given the following information on job times and due dates, determine the optimal processingsequence using (1) FCFS, (2) SPT, (3) EDD, and (4) CR. For each method, find the average jobflow time and the average job tardiness. Jobs are listed in order of arrival.JobJob Time(hours)Due Date(hours)a 3.5 7b 2.0 6c 4.5 18d 5.0 22e 2.5 4f 6.0 20arrow_forwardIf the jobs displayed in Table 18.23 are processed using the earliest-due-date rule, whatis the average flow time?arrow_forwardWhat is the workstation cycle time? Balance this line using largest number of the following tasks. Use the longest task time as a secondary criterion.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.