Concept explainers
a)
To solve: The given information by using the assignment method.
Introduction: The assignment method is one of the methods available in the process of optimization. Here, the jobs are assigned to every available resource.
a)
Answer to Problem 7P
The problem has been solved by using the assignment method.
Explanation of Solution
Given information:
Squad | Case | ||||
A | B | C | D | E | |
1 | 14 | 7 | 3 | 7 | 27 |
2 | 20 | 7 | 12 | 6 | 30 |
3 | 10 | 3 | 4 | 5 | 21 |
4 | 8 | 12 | 7 | 12 | 21 |
5 | 13 | 25 | 24 | 26 | 8 |
Assign cases to respective squads:
Row minimum:
Squad | Case | Row minimum | ||||
A | B | C | D | E | ||
1 | 14 | 7 | 3 | 7 | 27 | 3 |
2 | 20 | 7 | 12 | 6 | 30 | 6 |
3 | 10 | 3 | 4 | 5 | 21 | 3 |
4 | 8 | 12 | 7 | 12 | 21 | 7 |
5 | 13 | 25 | 24 | 26 | 8 | 8 |
Table after the row subtraction is given below:
The row minimum value mentioned in the above table should be subtracted from each value of the row.
Squad | Case | ||||
A | B | C | D | E | |
1 | 11 | 4 | 0 | 4 | 24 |
2 | 14 | 1 | 6 | 0 | 24 |
3 | 7 | 0 | 1 | 2 | 18 |
4 | 1 | 5 | 0 | 5 | 14 |
5 | 5 | 17 | 16 | 18 | 0 |
Column minimum:
Squad | Case | ||||
A | B | C | D | E | |
1 | 11 | 4 | 0 | 4 | 24 |
2 | 14 | 1 | 6 | 0 | 24 |
3 | 7 | 0 | 1 | 2 | 18 |
4 | 1 | 5 | 0 | 5 | 14 |
5 | 5 | 17 | 16 | 18 | 0 |
Column minimum | 1 | 0 | 0 | 0 | 0 |
Table after the column subtraction is given below:
The column minimum value mentioned in the above table should be subtracted from each value of the column.
Squad | Case | ||||
A | B | C | D | E | |
1 | 10 | 4 | 0 | 4 | 24 |
2 | 13 | 1 | 6 | 0 | 24 |
3 | 6 | 0 | 1 | 2 | 18 |
4 | 0 | 5 | 0 | 5 | 14 |
5 | 4 | 17 | 16 | 18 | 0 |
Assigning squads to the cases:
Step 1: The first row must be checked for the zero. As there is only one zero in the first row, it must be marked and the entire column should be striked out.
Step 2: As only one zero is available in the second row, it must be marked and the entire column should be striked out.
Step 3: As only one zero is available in the third row, it must be marked and the entire column should be striked out.
Step 4: As only one zero is available in the fourth row, it must be marked and the entire column should be striked out.
Step 5: As only one zero is available in the fourth row, it must be marked and the entire column should be striked out.
Step 5: All the zeroes in the table have been striked out. The marked zeroes help to assign the cases to the squads.
Calculate the total person-days that are projected by using the assignment method:
The value has been taken in the given information where, the zeroes have been marked in the final answer.
Squad | Case | Value |
1 | C | 3 |
2 | D | 6 |
3 | B | 3 |
4 | A | 8 |
5 | E | 8 |
Total | 28 |
According to the table, Squad 1 should be assigned to Case C, Squad 2 should be assigned to Case D, Squad 3 should be assigned to Case B, Squad 4 should be assigned to Case A, and Squad 5 should be assigned to Case E. The total person days are 28 days.
b)
To solve: The given information by using assignment method.
Introduction: The assignment method is one of the methods available in the process of optimization. Here, the jobs are assigned to every available resource.
b)
Answer to Problem 7P
The problem has been solved by using the assignment method.
Explanation of Solution
Given information:
Squad | Case | ||||
A | B | C | D | E | |
1 | 14 | 7 | 3 | 7 | 27 |
2 | 20 | 7 | 12 | 6 | 30 |
3 | 10 | 3 | 4 | 5 | 21 |
4 | 8 | 12 | 7 | 12 | 21 |
5 | 13 | 25 | 24 | 26 | 8 |
It is given that the squad 5 cannot work on Case 5 because of the conflict.
Modified given information:
It is given that the squad 5 cannot work on Case 5 because of the conflict. Thus, the value should be modified from 8 to any other higher values. It is taken as 50 here.
Squad | Case | ||||
A | B | C | D | E | |
1 | 14 | 7 | 3 | 7 | 27 |
2 | 20 | 7 | 12 | 6 | 30 |
3 | 10 | 3 | 4 | 5 | 21 |
4 | 8 | 12 | 7 | 12 | 21 |
5 | 13 | 25 | 24 | 26 | 50 |
Assign cases to respective squads:
Row minimum:
Squad | Case | Row minimum | ||||
A | B | C | D | E | ||
1 | 14 | 7 | 3 | 7 | 27 | 3 |
2 | 20 | 7 | 12 | 6 | 30 | 6 |
3 | 10 | 3 | 4 | 5 | 21 | 3 |
4 | 8 | 12 | 7 | 12 | 21 | 7 |
5 | 13 | 25 | 24 | 26 | 50 | 13 |
Table after the row subtraction is given below:
The row minimum value mentioned in the above table should be subtracted from each value of the row.
Squad | Case | ||||
A | B | C | D | E | |
1 | 11 | 4 | 0 | 4 | 24 |
2 | 14 | 1 | 6 | 0 | 24 |
3 | 7 | 0 | 1 | 2 | 18 |
4 | 1 | 5 | 0 | 5 | 14 |
5 | 0 | 12 | 11 | 13 | 37 |
Column minimum:
Squad | Case | ||||
A | B | C | D | E | |
1 | 11 | 4 | 0 | 4 | 24 |
2 | 14 | 1 | 6 | 0 | 24 |
3 | 7 | 0 | 1 | 2 | 18 |
4 | 1 | 5 | 0 | 5 | 14 |
5 | 0 | 12 | 11 | 13 | 37 |
Column minimum | 0 | 0 | 0 | 0 | 14 |
Table after the column subtraction is given below:
The column minimum value mentioned in the above table should be subtracted from each value of the column.
Squad | Case | ||||
A | B | C | D | E | |
1 | 11 | 4 | 0 | 4 | 10 |
2 | 14 | 1 | 6 | 0 | 10 |
3 | 7 | 0 | 1 | 2 | 4 |
4 | 1 | 5 | 0 | 5 | 0 |
5 | 0 | 12 | 11 | 13 | 23 |
Assigning squads to the cases:
Step 1: The first row must be checked for the zero. As there is only one zero in the first row, it must be marked and the entire column should be striked out.
Step 2: As only one zero is available in the second row, it must be marked, and the entire column should be striked out.
Step 3: As only one zero is available in the third row, it must be marked, and the entire column should be striked out.
Step 4: As only one zero is available in the fourth row, it must be marked, and the entire column should be striked out.
Step 5: As only one zero is available in the fifth row, it must be marked, and the entire column should be striked out.
Step 5: All the zeroes in the table have been strikedout. The marked zeroes help to assign the cases to the squads.
Calculate the total person days that are projected by using the assignment method:
The value has been taken in the given information where, the zeroes have been marked in the final answer.
Squad | Case | Value |
1 | C | 3 |
2 | D | 6 |
3 | B | 3 |
4 | E | 21 |
5 | A | 13 |
Total | 46 |
According to the table, Squad 1should be assigned to Case C, Squad 2 should be assigned to Case D, Squad 3 should be assigned to Case B, Squad 4 should be assigned to Case E, and Squad 5 should be assigned to Case A. The total person days are 46 days.
Want to see more full solutions like this?
Chapter 15 Solutions
Principles Of Operations Management
- Which of the following is a linear program? Question 5 options: a. min 0.5x1+3x2 (0.99x1+x2)/x2≥2.7 x1−x2≤8 x1≥0 x2= free b. min 0.5x1+3x2 (0.99x1+x2)/x2≥2.7 x1−x2≤8 x1≥0 x2≥1.5 c. max 0.5x1+3x2 0.99x1+x2≥2.7 x1−x2<8 x1,x2≥0 d. min 0.5x1+3x2 x1+1.35x2=2.7 x1≥0 x2= freearrow_forwardQuestion: Consider the following linear program: Max Z = 2*x + 3*y subject to 3*x + 4*y >= 12 3*x + 2*y >= 9 y>= 1 x,y >= 0 The number of feasible corner points is: 0 1 2 3 None of the other answers are correct.arrow_forwardQuestion 1: According to the Columbia Accident Investigation Board, the root cause of the Columbia disaster was directly tied to Management’s unwillingness to adequately address the tradeoffs between the program’s conflicting goals of: Group of answer choices A) Cost, schedule, and safety B) Schedule, morale, and risk C) Safety, customer satisfaction, and schedule D) Cost, risk, and test flightsarrow_forward
- 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? Tip: create a Gantt chart schedule before answering Questions 4 & 5. a. Jobs 2 & 3 b. Jobs 3 & 4 c. Job 3 d. Job 4 e. None of the jobs will be latearrow_forwardQuestion 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 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
- Question 6: Irving Janis coined the term Groupthink after: Group of answer choices A) Reviewing the Korean War, Pearl Harbor, Bay of Pigs crisis, and Vietnam War B) Reviewing the Korean War, Iran-Iraq War, Vietnam War, and Gulf War C) Reviewing the Gulf War, Vietnam War, Korean War, and Seven Day War D) Reviewing the Bay of Pigs crisis, Gulf War, Korean War, and Pearl Harborarrow_forwardQuestion 1 (b) A company is considering to invest in eight projects. The estimated cost of each project, the perceived priority points, the estimated number of new jobs each project would create are provided in the Table 1. Table 1 Project Cost ($) Priority Points New Jobs X1 X2 X3 X4 X5 X6 X7 X8 5000 4500 600 2000 6000 800 3200 2500 3176 2774 3513 2928 4607 862 3829 2708 5 1 2 1 3 1 7 2 1. Formulate objective function for this 0-1 integer model to maximise the total number of perceived priority points. Considering the above problem write down mathematical equations for each of following conditions/constraints. 2. A budget of $21000 is available for the projects. 3. The company wishes to fund at most three of the projects. 4. The company wants to create at least 8 new jobs from these projects.…arrow_forwardQuestion 1 (b) A company is considering to invest in eight projects. The estimated cost of each project, the perceived priority points, the estimated number of new jobs each project would create are provided in the Table 1. Table 1 Project Cost ($) Priority Points New Jobs X1 X2 X3 X4 X5 X6 X7 X8 5000 4500 600 2000 6000 800 3200 2500 3176 2774 3513 2928 4607 862 3829 2708 5 1 2 1 3 1 7 2 4. The company wants to create at least 8 new jobs from these projects. 5. Only one of the two projects, i.e., X3 and X5 should be funded at this time but not both. 6. The company believes that if it decides to invest in project X7 then it should also invest in project X8, and vice versa. [DO NOT SOLVE THE ABOVE MODEL YOU DEVELOPED IN QUESTION 1 (b).…arrow_forward
- Question 10 NASA’s leadership has traditionally been based on technical people that were degreed in the hard sciences. Group of answer choices A) When a group of people have similar backgrounds, they create a culture based on common attributes. B) When a group of people have similar backgrounds, they cannot create a culture because their individuality negates any common attributes. C) When a group of people have similar backgrounds, they create a culture based on diverse attributes. D) When a group of people have similar backgrounds, they create a culture based on common attributes, which always proves negative.arrow_forwardQuestion 1 Posh Nails Katie Posh runs an upscale nail salon. The service process includes five activities that are conducted in the sequence described below. (The time required for each activity is shown in parentheses): Activity 1: Welcome a guest. (1 minute) Activity 2: Clip and file nails. (3 minutes) Activity 3: Paint. (5 minutes) Activity 4: Dry. (10 minutes) Activity 5: Check out the customer. (4 minutes) Three servers (S1, S2, and S3) offer the services in a worker-paced line. The assignment of tasks to servers is the following: S1 does Activity 1. S2 does Activities 2 and 3. S3 does Activities 4 and 5. The drying process does not require server 3’s constant attention; she/he needs to only escort the customer to the salon’s drying chair (equipped with fans for drying). The time to do this is negligible. There exists only one drying chair in the salon. Which resource is the bottleneck of the process?arrow_forwardQuestion 5 AIT computer department purchases a new computer every two years with preferences for three models; T1, T2 and T3. If the present model is T1, the next computer may be T2 with probability 0.2 or T3 with probability 0.15. If the present model is T2, the probabilities of switching to T1 and T3 are 0.6 and 0.25 respectively. And if present model is T3 then, the probabilities of switching to T1 and T2 are 0.5 and 0.1 respectively. Represent the situation as a Markov chain.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.