1. The Marvel Shop has just received five new repair projects that must be repaired quickly, i.e., project 1, project 2, project 3, project 4, and project 5. Five workers namely Andy, Brad, Christian, Devon, and Evan with different talents will be able to do the job. Andy, Brad, Christian, Devon, and Evan can be assigned to any of these projects. It is known that every project will comprise only one worker. Also, one worker will work in only one project and will not change the project after assignment. The wages charged by the workers in different projects are given below in the following table Projects Workers Project 1 Project 2 Project 3 Project 4 Project 5 Andy $10 $5 $13 $15 $16 Brad $3 $9 $18 $13 $6 Christian $10 $7 S2 $2 $2 Devon $7 $11 $9 $7 $12 Evan $7 $9 $10 $4 $12 Now, Marvel Shop wants to complete all of these projects at minimum cost. Based on the information given above, answer the following questions. Also, clearly write down each of the steps. a) Using the Hungarian method, determine the optimal assignment of the workers that will minimize the cost (Use manual process) b) What is the minimum cost incurred by Marvel Shop as per Hungarian method?

1. The Marvel Shop has just received five new repair projects that must be repaired quickly, i.e., project 1, project 2, project 3, project 4, and project 5. Five workers namely Andy, Brad, Christian, Devon, and Evan with different talents will be able to do the job. Andy, Brad, Christian, Devon, and Evan can be assigned to any of these projects. It is known that every project will comprise only one worker. Also, one worker will work in only one project and will not change the project after assignment. The wages charged by the workers in different projects are given below in the following table Projects Workers Project 1 Project 2 Project 3 Project 4 Project 5 Andy $10 $5 $13 $15 $16 Brad $3 $9 $18 $13 $6 Christian $10 $7 S2 $2 $2 Devon $7 $11 $9 $7 $12 Evan $7 $9 $10 $4 $12 Now, Marvel Shop wants to complete all of these projects at minimum cost. Based on the information given above, answer the following questions. Also, clearly write down each of the steps. a) Using the Hungarian method, determine the optimal assignment of the workers that will minimize the cost (Use manual process) b) What is the minimum cost incurred by Marvel Shop as per Hungarian method?

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Similar questions

1. What is the cycle time? 2. What is the theoretical minimum number of workstations? 3. Which of the following statements is FALSE? a. All of the tasks A, B and C should be finished first before task F can be started. b.All of the tasks A through H should be finished first before task I can be started. c.Tasks A, B, and C can be started as soon as possible. d. All of the tasks B, E, C and F should be finished first before task H can be started.
A manufacturer is designing a product layout for a new product production. It plans to use a production line for 8 hours per day in order to meet forecasted demand of 80 units per day. The product requires 7 tasks in total. These tasks are namely, A, B, C, D, E, F, and G respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed. Starting tasks C needs, the task B to be completed. Also, starting task D needed task B to be completed. Task E can only start upon completion of Task C. Whereas starting task F needs the completion of both the tasks D and E. Finally, starting task G needed, task F to be completed. The processing times for tasks, A, B, C, D, E, F, and G are 2.8, 2.1, 0.9, 1.0, 1.2, 1.8, are 4.7 minutes respectively. What should be the (calculated) cycle time in minutes? Select one: Oa. 4.5 Ob. 0.9 Oc. None is the correct answer O d. 6.0 Oe. 4.4 Next pa nd Windows
Job Processing time (Days) Job Due Date (Days) A 12 18 14 23 C 7 15 2 7 There are painting jobs awaiting at a paint shop. Their processing times and due dates are shown in the table. The firm wants to determine the sequence of jobs according to shortest processing time (SPT). Jobs are assigned a letter in the order day arrived. The utilization is _%. Today is day 1 and work begins today.
Courtney is a programmer receiving requests each week to analyze a large data base. Five jobs were on her desk Monday morning, and she must decide in what order to write the code. Assume that all jobs arrived today (day 1 and hour 1), in the order shown below. Courtney has assigned the number of hours required to do the coding as noted. Note that Courtney works an 8-hour day and today is a work day. DURATION (HOURS REQUIRED) 14 7 2 JOB ABCDE DUE DATE (HOURS HENCE) 36 14 16 6 26 6 10 a) Sequence the jobs according to EDD. According to the EDD rule, the sequence of jobs should be D, B, C, E, A. b) What is the average completion (flow) time? The average completion (flow) time is 19.6 days (round your response to one decimal place). c) What is the average job lateness? The average job lateness is 0.6 days (round your response to one decimal place). d) What is the average number of jobs in the system? The average number of jobs in the system is jobs (round your response to one decimal…
Note:- Do not provide handwritten solution. Maintain accuracy and quality in your answer. Take care of plagiarism. Answer completely. You will get up vote for sure.
A) What is the theoretical minimum number of workstations? a. 3 workstations b. 3.5 workstations c. 3.83 workstations d. 4 workstations e. 5 workstations B) Which of the following statements is FALSE? a. Tasks A, B, and C can be started as soon as possible. b. All of the tasks A, B and C should be finished first before task F can be started. c. All of the tasks A through H should be finished first before task I can be started. d.All of the tasks B, E, C and F should be finished first before task H can be started. Answer the two questions please.
2
3) to final assembly for an important customer order. Currently, all eight jobs are in department X and must be routed to department Y after processing. The processing times (in days) for each job in each department follow: The machine shop of Reliable Manufacturing has to schedule eight jobs that are to be sent Dept/Job Dept. X Dept. Y A B C D E F G H 2 4 7 5 4 10 3 3 8 2 6 5 Develop two schedules for operations in both departments. For your first schedule, use the SPT priority rule (based on X). Your second schedule should be based on Johnson's Rule. Compare the two schedules using average flow time, makespan, and average WIP inventory. Use a Gantt chart to display your schedules (i.e. a timeline).
A manufacturer is designing a product layout for a new product production. It plans to use a production line for 8 hours per day in order to meet forecasted demand of 180 units per day. The product requires 7 tasks in total. These tasks are namely, A, B, C, D, E, F, and Grespectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed. Starting tasks C needs, the task B to be completed. Also, starting task D needed task B to be completed. Task E can only start upon completion of Task C. Whereas starting task F needs the completion of both the tasks D and E. Finally, starting task G needed, task F to be completed. The processing times for tasks, A, B, C, D, E, F, and G are 2.4, 2.2, 0.9, 1.0, 1.2, 1.8, are 1.5 minutes respectively. Applying the most remaining tasks rule for balancing the assembly line, with ties broken according to longest task time first. What is the idleness in percentage? a. 31.34 O b. 81.82 O c. None is the correct…
Ron Satterfield's excavation company uses both Gantt scheduling charts and Gantt load charts. Today, which is the end of day 7, Ron is reviewing the Gantt chart depicting these schedules: Job #151 was scheduled to begin on day 3 and to take 7 days. It got started on time and is 1 day ahead of schedule. Job #177 was scheduled to begin on day 3 and take 5 days. It is currently on time. Job #179 was scheduled to start on day 6 and take 3 days. It actually got started on day 5 and is progressing according to plan. Job #211 was scheduled to begin on day 5, but missing equipment delayed it until day 6. It is progressing as expected and should take 3 days. Job #215 was scheduled to begin on day 4 and take 5 days. It got started on time but has since fallen behind 2 days. This exercise contains only part a. a) Add the actual progress to the Gantt schedule shown on the right (on which the planned timings have been already plotted as blue lines). Using the line drawing tool, plot the actual…
Given the data below, using the SPT heuristic sequencing rule, determine the completion date and tardiness for each job as well as the average completion time and average tardiness for all four jobs. Which of the following statements is true? Job Processing time (days) Due date (in days) A 10 10 B 5 8 C 15 25 D 8 15 a.Jobs B and D will have no tardiness b.The tardiness for Job A is 12 days c.The average tardiness is 19.75 d.The average completion time is 6.5
A manufacturer is designing a product layout for a new product production. It plans to use a production line for 8 hours per day in order to meet forecasted demand of 90 units per day. The product requires 7 tasks in total. These tasks are namely, A. B, C, D. E,F. and Grespectively. Task A does not have any predecessor to start. To start Task B. it requires Task A to be completed. Starting tasks C needs, the task B to be completed. Also, starting task D needed task B to be completed. Task E can only start upon completion of Task C Whereas starting task F needs the completion of both the tasks Dand E. Finally, starting task G needed, task F to be completed. The processing times for tasks, A. B. C. D. E.F. and Gare 2.8.21,0.9.1.0, 1.2. 1.8, and 4.7 minutes respectively. How many minimum numbers of workstations are needed? Oa 3 Ob. None is the correct answer Oc 5 Od. 1 Oe 6