
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
Principles Of Operations Management
- Can you guys help me with this? Thank you! Here's the question: Compared to the CONSTRAINT model, how has the network changed? How do you plan to add contingency to your network? Please answer this throughly Here's the what-if scenario: Assume that Dallas plant has lost power. It cannot serve the DCs anymore and has to remain locked indefinitely. Re-optimize the network considering this new constraint. Here's the scenario comparison analysis: Scenario Constraint Scenario vs What-if Scenario Summary In comparing the Constraint Scenario to the What-if Scenario, a few key differences highlight the efficiencies evident in the supply chain. Firstly, the total cost in the Constraint Scenario is lower at $7,424,575.45, while the What-if Scenario incurs a total cost of $7,486,369.12, resulting in a cost delta of $61,793.67. Additionally, although both scenarios exhibit the same average service time of 0.72 days, the What-if Scenario has a more favorable average end-to-end service time of 2.41…arrow_forwardEmployee In-Service Training ASSIGNMENT: In-Service Training. The intern is required to plan and implement two in-service training sessions for employees. Each in-service should last at least 10 but not more than 30 minutes and should be given to all employees affected. The preceptor or supervisor/unit manager must approve all in-service topics. 1) One presentation should be related to a policy or procedure of any kind (e.g. proper use of equipment); 2) The second presentation must be related to sanitation or safety. For each in-service presentation, the intern must develop a written class plan and a visual aid (may be a handout, poster, PowerPoint slide presentation, etc.) appropriate to the life experiences, cultural diversity and educational background of the target audience. The intern must also measure behavior change. Note, this cannot be measured by a written pre- and post- test. That would be measuring knowledge. The intern mustactually observe and document that the learners…arrow_forwardFor a dietary manager in a nursing home to train a dietary aidearrow_forward
- Dietary Management in a Nursing Home. As detailed as possible.arrow_forwardFor dietary management in a nursing home. As detailed as possible.arrow_forwardA small furniture manufacturer produces tables and chairs. Each product must go through three stages of the manufacturing process – assembly, finishing, and inspection. Each table requires 3 hours of assembly, 2 hours of finishing, and 1 hour of inspection. The profit per table is $120 while the profit per chair is $80. Currently, each week there are 200 hours of assembly time available, 180 hours of finishing time, and 40 hours of inspection time. Linear programming is to be used to develop a production schedule. Define the variables as follows: T = number of tables produced each week C= number of chairs produced each week According to the above information, what would the objective function be? (a) Maximize T+C (b) Maximize 120T + 80C (c) Maximize 200T+200C (d) Minimize 6T+5C (e) none of the above According to the information provided in Question 17, which of the following would be a necessary constraint in the problem? (a) T+C ≤ 40 (b) T+C ≤ 200 (c) T+C ≤ 180 (d) 120T+80C ≥ 1000…arrow_forward
- As much detail as possible. Dietary Management- Nursing Home Don't add any fill-in-the-blanksarrow_forwardMenu Planning Instructions Use the following questions and points as a guide to completing this assignment. The report should be typed. Give a copy to the facility preceptor. Submit a copy in your Foodservice System Management weekly submission. 1. Are there any federal regulations and state statutes or rules with which they must comply? Ask preceptor about regulations that could prescribe a certain amount of food that must be kept on hand for emergencies, etc. Is the facility accredited by any agency such as Joint Commission? 2. Describe the kind of menu the facility uses (may include standard select menu, menu specific to station, non-select, select, room service, etc.) 3. What type of foodservice does the facility have? This could be various stations to choose from, self-serve, 4. conventional, cook-chill, assembly-serve, etc. Are there things about the facility or system that place a constraint on the menu to be served? Consider how patients/guests are served (e.g. do they serve…arrow_forwardWork with the chef and/or production manager to identify a menu item (or potential menu item) for which a standardized recipe is needed. Record the recipe with which you started and expand it to meet the number of servings required by the facility. Develop an evaluation rubric. Conduct an evaluation of the product. There should be three or more people evaluating the product for quality. Write a brief report of this activity • Product chosen and the reason why it was selected When and where the facility could use the product The standardized recipe sheet or card 。 o Use the facility's format or Design one of your own using a form of your choice; be sure to include the required elements • • Recipe title Yield and portion size Cooking time and temperature Ingredients and quantities Specify AP or EP Procedures (direction)arrow_forward
- Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,Foundations of Business (MindTap Course List)MarketingISBN:9781337386920Author:William M. Pride, Robert J. Hughes, Jack R. KapoorPublisher:Cengage LearningFoundations of Business - Standalone book (MindTa...MarketingISBN:9781285193946Author:William M. Pride, Robert J. Hughes, Jack R. KapoorPublisher:Cengage Learning


