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
- 17.17. The Blue Plate Special restaurant, famous for its slow-cooked stews and meats, serves one meal a day family style. Sous Chef Lisle marinates the meat, fish, and vegetables for the five different dishes on the menu, while Chef Graham handles the cooking. The time required for marinating and cooking can vary, depending on the complexity of the dish and the spiciness desired, as shown below. Assuming only one dish can be marinating and one dish cooking at a time, determine in what order the dishes should be fixed toarrow_forwardWork teams usually do not have the authority to assign roles within the team. Question 2 options: True Falsearrow_forwardQuestion 3: A catering company must have the following number of clean napkins available at the beginning of each of the next four days: day 1: 15, day 2: 12, day 3: 18, and day 4: 6. After being used, a napkin can be cleaned by one of two methods: fast service or slow service. Fast service costs $0.10 per napkin, and a napkin cleaned via fast service is available for use the day after it is last used. Slow service costs $0.06 per napkin, and a napkin cleaned via slow service is available two days after they were last used. New napkins can be purchased for a cost of $0.20 per napkin. Part A: Formulate the problem as a minimum cost transportation problem. Part B: Use Excel Solver to solve the problem (provide exact values for all variables and the optimal objective function).arrow_forward
- Question: B) Identify The Economic Order Quanitity And Consider The Implications For Making An Error In Calculating Economic Order Quanitity. This problem has been solved! See the answer b) Identify the economic order quanitity and consider the implications for making an error in calculating economic order quanitity.arrow_forwardQuestion (13-15): A Car service station owns one washing machine that serves 3.5 cars every 45 minutes. Moreover, 2.5 customers arrive at the station every 40 minutes. Answer the following questions: 13. Determine the expected waiting time in the car service: D D 3.021 D 4.621 с 14. Determine the expected number of customers in the queue: 0.9031 C 1.0909 C 3.872 B 0.3001 B 0.875 B 3.287 15. Determine the probability that customers are waiting more than 45 minutes in the queue: A 0.4041 A 1.256 A 4.099 0.5981arrow_forwardQuestion 1.2 Jenna Fourie has a bachelor’s degree and has worked as a computer programmer and project leader for an international organisation. In five short years she has more new software programs to her credit that anyone else in the department. She is highly creative and widely respected for her programming skills. However, Jenna is impulsive and has little tolerance for those whose work is less creative. Jenna is slow to cooperate with other departments and supervisors are unhappy with her approach. Jenna prefers to work alone and is focussed on completing her master’s degree. She has little interest in developing her team or setting goals and objective for the team to meet certain targets. Jenna has not been considered for a promotion to senior manager. Expanding on the ‘technical skills’ category of managerial skills, discuss the areas in this category of managerial skills that Jenna should develop, as well as the technical skills that Jenna already has.arrow_forward
- 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: Pistons for automotive engines can be formed either by casting or forging technique. Traditional cast pistons are considered good enough by most engine tuners and builders when it comes to standard setups. They suffer no significant drawback in terms of compression and service life. Performance enthusiasts and custom engine builders prefer the use of forged pistons because they are more durable and easily customised to any configuration, which is essential for engine tuning. Cast pistons are made with the use of large, specialised equipment made up of a mould where the molten aluminium alloy is poured to create the piston shape. Forged pistons employ a single-cast billet of the alloy which is stamped into the required shape using a die. The shape of the die determines the size and shape of the piston. The productivity rates for both methods are different. How do i calculate this?: In this Question, we assume that one unit piston weighs 1.54kg. To calculate the cost per part…arrow_forwardQuestion: workstations available. Permanent and temporary operators work 8 hours per day. A permanent operator averages about 0.4 error per day, whereas a temporary operator averages 0.9 error per day. The company wants to limit errors to 15 per day. A permanent operator is paid $120 per day wheras a temporary operator is paid $75 per day. Corsouth wants to determine the number of permanent and temporary operators it needs to minimize cost. Formulate, and solve an integer programming model for this problem and compare this solution to the non-integer solution. 5. Globex Investment Capital Corporation owns six companies that have the following estimated returns (in millions of dollars) if sold in one of the next 3 years: Year Sold (estimated returns, $1,000,000s) Company 1 2 3 1 $14 $18 $23 11 15 3 18 23 27 4 16 21 25 5 12 16 22 6 21 23 28 To generate operating funds, the company must sell at least $20 million worth of assets in year 1, $25 million in year 2, and $35 million in year 3.…arrow_forward
- Question Scenario: Early one Monday morning in Jamaica, Susan, a Restaurant Manager starts getting ready for the morning’s work operations. She is particularly happy because tonight he has a date with Marvin, the new Chef that was recently hired. The problem, as Susan sees it, is that Roberta, another Restaurant employee has been just a little too friendly with Marvin lately and that really upsets Susan. Susan has redone the work schedule, assigning Roberta the clean-up shift in the night and cutting back on her hours of work. She is hoping that Roberta would simply quit and out of her way. However, that plan doesn’t seem to be working. Despite a lighter pay cheque and frequent reprimand through the disciplinary process of creating reasons to write to her about her conduct and performance. Roberta has decided to quit her studies due to her inability to fund her tuition. A few days later, Susan noticed Marvin and Roberta having lunch together in the staff dining room. Susan got furious…arrow_forwardQ. 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 : One way for a manager of a property to increase the net operating income of a retail store is to increase the flow of customer traffic into the store. If the increased traffic results in increased sales, then the net operating income of the store will increase. If this can be sustained then the manager has increased the value of the property. True or Falsearrow_forward
Practical Management ScienceOperations ManagementISBN:9781337406659Author:WINSTON, Wayne L.Publisher:Cengage,
Operations ManagementOperations ManagementISBN:9781259667473Author:William J StevensonPublisher:McGraw-Hill Education
Operations 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 Learning
Production and Operations Analysis, Seventh Editi...Operations ManagementISBN:9781478623069Author:Steven Nahmias, Tava Lennon OlsenPublisher:Waveland Press, Inc.