Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
expand_more
expand_more
format_list_bulleted
Question
Expert Solution
arrow_forward
Step 1
One method to solve the assignment problems algorithmically is the Hungarian method. This method solves the problem by combinatorial optimization in polynomial time.
Step by stepSolved in 5 steps with 4 images
Knowledge Booster
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.arrow_forwardJob 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.arrow_forwardCourtney 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…arrow_forward
- 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.arrow_forwardA) 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.arrow_forward3) 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).arrow_forward
- 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…arrow_forwardGiven 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.5arrow_forwardYou want to work a five day work week. How many ways can you schedule your five-day work week if you want to avoid working 5 days in a row? NOTE: take a single week into consideration (don't roll into the next week or look at the week before).arrow_forward
- A shoe repair operation uses a two-step sequence that all jobs in a certain category follow. Alljobs can be split in half at both stations. For the group of jobs listed:a. Find the sequence that will minimize total completion time.b. Determine the amount of idle time for workstation B.c. What jobs are candidates for splitting? Why? If they were split, how much would idle time andmakespan time be reduced?JOB TIMES (minutes)A B C D EWorkstation A 27 18 70 26 15Workstation B 45 33 30 24 10arrow_forwardFive jobs are planned to be scheduled. Each of the jobs must be processed on three machines (A, B, and C) in the same order. The processing times are listed below. Use Johnson's Rule to determine the optimal sequence of jobs. Job B 16 10 11 10 14 20 12 3 10 8 4 1 O a) 3-1-2-4-5 O b) Johnson's Rule is not an Optimal Technique O c) 1-2-3-4-5 O d) 5-4-3-1-2 O e) 5-4-3-2-1 O) 5-4-2-1-3 O e) 5-4-2-3-1 2345arrow_forwardThe total time required to process all six jobs is ________ minutes. You have been asked to develop a new sequence to reduce the total time. You results produced a timeline of ______________ minutes.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- 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.
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Purchasing and Supply Chain Management
Operations Management
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Cengage Learning
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.