Concept explainers
a)
To determine: Thesequence of jobs based on the decision rule, i.e, First Come First Served (FCFS).
Introduction: The First Come First Served is the
a)
Answer to Problem 15P
The sequence is A-B-C-D-E.
Explanation of Solution
Given information:
The following information has been given below:
Job | Due date | Duration (days) |
A | 313 | 8 |
B | 312 | 16 |
C | 325 | 40 |
D | 314 | 5 |
E | 314 | 3 |
All the jobs have arrived on day 275.
Determine the sequence of the job by using FCFS:
Job | Due date | Duration (days) | Flow time | Start | End | Lateness |
A | 313 | 8 | 8 | 275 | 282 | |
B | 312 | 16 | 24 | 283 | 298 | |
C | 325 | 40 | 64 | 299 | 338 | 13 |
D | 314 | 5 | 69 | 339 | 343 | 29 |
E | 314 | 3 | 72 | 344 | 346 | 32 |
Total | 72 | 237 | 74 |
Working note:
The duration and due date for the jobs has been given. The flow time is the cumulative value of the duration. The jobs arrival rate is given as 275.
End day of Job A:
The jobs arrival rate is given as 275. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job A is 282.
End day of Job B:
The start day of Job B is the next day of the end day of Job A. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job B is 298.
End day of Job C:
The start day of Job C is the next day of the end day of Job B. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job C is 338.
End day of Job D:
The start day of Job D is the next day of the end day of Job C. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job D is 343.
End day of Job E:
The start day of Job E is the next day of the end day of Job D. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job E is 346.
Lateness of Job A and Job B:
The end day of Job A and Job B is less than its respective due date. Hence, there is no lateness.
Lateness of Job C:
It is calculated by subtracting the end day of the job from the due date of the project. Hence, the lateness of Job C is 13.
Lateness of Job D:
It is calculated by subtracting the end day of the job from the due date of the project. Hence, the lateness of Job D is 29.
Lateness of Job E:
It is calculated by subtracting the end day of the job from the due date of the project. Hence, the lateness of Job E is 32.
b)
To determine: The sequence of jobs based on the decision rule, i.e, Earliest Due Date (EDD).
Introduction: The Earliest Due Date is the scheduling rule, which helps to arrange the sequence in the order. Here, the job with the earliest due date would be served first. Then, the process would be go on from the earliest due date to the latest due date.
b)
Answer to Problem 15P
The sequence is B-A-D-E-C.
Explanation of Solution
Given information:
The following information has been given below:
Job | Due date | Duration (days) |
A | 313 | 8 |
B | 312 | 16 |
C | 325 | 40 |
D | 314 | 5 |
E | 314 | 3 |
All the jobs have arrived on day 275.
Determine the sequence of the job by using EDD:
Job | Due date | Duration (days) | Flow time | Start | End | Lateness |
B | 312 | 16 | 16 | 275 | 290 | |
A | 313 | 8 | 24 | 291 | 298 | |
D | 314 | 5 | 29 | 299 | 303 | |
E | 314 | 3 | 32 | 304 | 306 | |
C | 325 | 40 | 72 | 307 | 346 | 21 |
Total | 72 | 173 | 21 |
Working note:
The duration and due date for the jobs have been given. The flow time is the cumulative value of the duration. The jobs arrival rate is given as 275. The job should be arranged based on the due date. The due date should be assembled in the ascending order.
End day of Job A:
The jobs arrival rate is given as 275. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job A is 290.
End day of Job B:
The start day of Job B is the next day of the end day of Job A. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job B is 298.
End day of Job C:
The start day of Job C is the next day of the end day of Job B. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job C is 303.
End day of Job D:
The start day of Job D is the next day of the end day of Job C. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job D is 306.
End day of Job E:
The start day of Job E is the next day of the end day of Job D. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job E is 346.
Lateness of Job A, Job B, Job C, and Job D is given below:
The end day of Job A, Job B, Job C, and Job dare less than its respective due date. Hence, there is no lateness.
Lateness of Job E:
It is calculated by subtracting the end day of the job from the due date of the project. Hence, the lateness of Job E is 21.
c)
To determine: The sequence of jobs based on the decision rule, i.e, Shortest Processing Time (SPT).
Introduction: The Shortest Processing Time is the scheduling rule, which helps to arrange the sequence in the order. Here, the job with the shortest duration is served first. Then, the process would be go on from the shortest to the largest duration.
c)
Answer to Problem 15P
The sequence is E-D-A-B-C.
Explanation of Solution
Given information:
The following information has been given below:
Job | Due date | Duration (days) |
A | 313 | 8 |
B | 312 | 16 |
C | 325 | 40 |
D | 314 | 5 |
E | 314 | 3 |
All the jobs are arrived on day 275.
Determine the sequence of the job by using SPT:
Job | Due date | Duration (days) | Flow time | Start | End | Lateness |
E | 314 | 3 | 3 | 275 | 277 | |
D | 314 | 5 | 8 | 278 | 282 | |
A | 313 | 8 | 16 | 283 | 290 | |
B | 312 | 16 | 32 | 291 | 306 | |
C | 325 | 40 | 72 | 307 | 346 | 21 |
Total | 72 | 131 | 21 |
Working note:
The duration and due date for the jobs have been given. The flow time is the cumulative value of the duration. The jobs arrival rate is given as 275. The job should be arranged based on the duration (processing time). The duration should be assembled in the ascending order.
End day of Job A:
The jobs arrival rate is given as 275. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job A is 277.
End day of Job B:
The start day of Job B is the next day of the end day of Job A. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job B is 282.
End day of Job C:
The start day of Job C is the next day of the end day of Job B. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job C is 290.
End day of Job D:
The start day of Job D is the next day of the end day of Job C. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job D is 306.
End day of Job E:
The start day of Job E is the next day of the end day of Job D. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job E is 346.
Lateness of Job A, Job B, Job C, and Job D is as follows:
The end day of Job A, Job B, Job C, and Job D are less than its respective due date. Hence, there is no lateness.
Lateness of Job E:
It is calculated by subtracting the end day of the job from the due date of the project. Hence, the lateness of Job E is 21.
d)
To determine: The sequence of jobs based on the decision rule, i.e, Longest Processing Time (LPT).
Introduction: The Largest Processing Tine is the scheduling rule, which helps to arrange the sequence in the order. Here, the job with the largest duration is served first. Then, the process would go on from the largest to the shortest duration.
d)
Answer to Problem 15P
The sequence is C-B-A-D-E.
Explanation of Solution
Given information:
The following information has been given below:
Job | Due date | Duration (days) |
A | 313 | 8 |
B | 312 | 16 |
C | 325 | 40 |
D | 314 | 5 |
E | 314 | 3 |
All the jobs have arrived on day 275.
Determine the sequence of the job by using LPT:
Job | Due date | Duration (days) | Flow time | Start | End | Lateness |
C | 325 | 40 | 40 | 275 | 314 | |
B | 312 | 16 | 56 | 315 | 330 | 18 |
A | 313 | 8 | 64 | 331 | 338 | 25 |
D | 314 | 5 | 69 | 339 | 343 | 29 |
E | 314 | 3 | 72 | 344 | 346 | 32 |
Total | 72 | 301 | 104 |
Working note:
The duration and due date for the jobs have been given. The flow time is the cumulative value of the duration. The jobs arrival rate is given as 275. The job is arranged based on the duration (processing time). The duration should be assembled in the descending order
End day of Job A:
The jobs arrival rate is given as 275. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job A is 314.
End day of Job B:
The start day of Job B is the next day of the end day of Job A. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job B is 330.
End day of Job C:
The start day of Job C is the next day of the end day of Job B. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job C is 338.
End day of Job D:
The start day of Job D is the next day of the end day of Job C. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job D is 343.
End day of Job E:
The start day of Job E is the next day of the end day of Job D. The end day is calculated by adding the start day with the value attained by subtracting 1 from the duration. Hence, the end day of Job E is 346.
Lateness of Job A:
The end day of Job A is less than its respective due date. Hence, there is no lateness.
Lateness of Job B:
It is calculated by subtracting the end day of the job from the due date of the project. Hence, the lateness of Job B is 18.
Lateness of Job C:
It is calculated by subtracting the end day of the job from the due date of the project. Hence, the lateness of Job C is 25.
Lateness of Job D:
It is calculated by subtracting the end day of the job from the due date of the project. Hence, the lateness of Job D is 29.
Lateness of Job E:
It is calculated by subtracting the end day of the job from the due date of the project. Hence, the lateness of Job E is 32.
Summary:
Decision rule | Average tardiness | Average flow time | Average number of jobs in system |
FCFS | 14.8 | 47.4 | 3.3 |
EDD | 4.2 | 34.6 | 2.4 |
SPT | 4.2 | 26.2 | 1.8 |
LPT | 20.8 | 60.2 | 4.2 |
First Come First Served (FCFS):
Average tardiness:
It is calculated by dividing the total lateness with the number of jobs. Hence, the average tardiness is 14.8.
Average flow time:
It is calculated by dividing the total flow time with the number of jobs. Hence, the average flow time is 47.4.
Average number of jobs in the system:
It is calculated by dividing the total flow time with the total duration of all the jobs. Hence, the average number of jobs in the system is 3.3.
Earliest Due Date (EDD):
Average tardiness:
It is calculated by dividing the total lateness with the number of jobs. Hence, the average tardiness is 4.2.
Average flow time:
It is calculated by dividing the total flow time with the number of jobs. Hence, the average flow time is 34.6.
Average number of jobs in the system:
It is calculated by dividing the total flow time with the total duration of all the jobs. Hence, the average number of jobs in the system is 2.4.
Shortest processing time (SPT):
Average tardiness:
It is calculated by dividing the total lateness with the number of jobs. Hence, the average tardiness is 4.2.
Average flow time:
It is calculated by dividing the total flow time with the number of jobs. Hence, the average flow time is 26.2.
Average number of jobs in the system:
It is calculated by dividing the total flow time with the total duration of all the jobs. Hence, the average number of jobs in the system is 1.8.
Largest processing time (LPT):
Average tardiness:
It is calculated by dividing the total lateness with the number of jobs. Hence, the average tardiness is 20.8.
Average flow time:
It is calculated by dividing the total flow time with the number of jobs. Hence, the average flow time is 60.2.
Average number of jobs in the system:
It is calculated by dividing the total flow time with the total duration of all the jobs. Hence, the average number of jobs in the system is 4.2.
Shortest processing time has the minimum average tardiness, average flow time, and the average number of jobs in systems. Hence, SPT is the best decision rule.
Want to see more full solutions like this?
Chapter 15 Solutions
PRIN.OF OPERATIONS MANAGEMENT-MYOMLAB
- Q. 3 What is the total makespan from Question 1? Question 1: Four floral arranging jobs are to be carried out across three stations: A (Arrange), B (Bag), C (crop) shown. The station sequences and job times in minutes are shown below, along with the due dates for each job. Using an "earliest due date" job dispatching priority rule, which, if any, of the jobs in will be late? Answer was Job 4 Group of answer choices a. 100 b. 130 c. 150 d. 170 e. 200arrow_forwardQuestion 33 The processing times of five jobs are given as follows: Job Processing time (minutes) A 20 B 60 C 30 D 75 E 15 Assume the jobs arrived in alphabetical order of the job name and no other job arrives in the next 200 minutes. What is the average inventory if the jobs are processed in shortest processing time (SPT) order? Group of answer choices 3.00 2.92 1.97 2.20arrow_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_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 4: Six jobs waiting at a workstation will be processed in order, starting with the one with the shortest break time. In the table below, the time elapsed since the arrival of the works, the time remaining to the delivery and the processing time are given. According to this, create the work order and fill in the data in the relevant table.(fill in the second table in the photos)a) What is the average delay time with the generated order?b) How many hours is the average flow time?c) How many jobs will be delayed?d) How many jobs will not be delayed?arrow_forwardQuestion 34 Consider the processing times and priorities for four jobs: Job Processing time (minutes) Weight/Priority (cost per minute) A 10 6 B 2 1 C 50 2 D 16 10 Assume the weighted shortest processing time (WSPT) rule is used. Which job should be processed third? Group of answer choices A B C Darrow_forward
- Allocate the tasks to workstations taking into consideration the precedence requirements and using the LOT rule to break ties between feasible tasks.arrow_forwardQuestion 32 The processing times of four jobs are given as follows: Job Processing time (minutes) A 10 B 30 C 16 D 24 Assume the jobs arrived in alphabetical order of the job name and no other job arrives in the next 70 minutes. What is the average flow time in minutes if the jobs are processed in shortest processing time (SOP) order? Group of answer choices 166 41.5 38 20.5arrow_forwardA Maving to another question will sae this response. Question 24 Copy of Table 10.10 A work center has the following five jobs waiting to be processed (all times are shown in days): Job Arrival Processing Due 12 29 16 11 31 13 12 25 1 8 Use the infomation in Table 10.10. What is the average flow time using the FCFS rule (Answer to 2 decimal places)? (CSLOS 1,2,3) Moving to another question will save this response.arrow_forward
- QUESTION #4 Four delivery trucks are in a queue at a Tool Company with only one service bay. The trucks are identified by the sequence in which they arrived at the Company. Assume the time is 10:00 a.m. The table shows the times necessary to unload each vehicle and the periods when the commodities they contain are expected in the factory. Determine the schedules that result for each of the rules SPE, CR EDD, and FSFC. In each case compute the average tardiness, the number of tardy jobs, and mean flow time. Truck 1 2 3 4 5 Unloading Time (minutes) 23 16 39 12 30 Time Material is Due 10:15 AM 10:40 AM 10:55 AM 10:30 AM 10:40 AMarrow_forwardQuestion 36 The theory of constraints states that the ________ of a process is primarily dictated by the ________ through the ________ resource. Group of answer choices flow rate, flow rate, bottleneck flow time, flow rate, non-bottleneck flow time, flow rate, bottleneck flow rate, flow time, bottleneckarrow_forwardWhich are the major functions of shop-floor control?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.