One possible solution method for the machine-to job assignment problem is the following heuristic procedure. Assign the machine to job 1 that completes job 1 quickest. Then assign the machine to job 2 that, among all machines that still have some capacity, completes job 2 quickest. Keep going until a machine has been assigned to all jobs. Does this heuristic procedure yield the optimal solution for this problem? If it does, see whether you can change the job times so that the heuristic does not yield the optimal solution.

One possible solution method for the machine-to job assignment problem is the following heuristic procedure. Assign the machine to job 1 that completes job 1 quickest. Then assign the machine to job 2 that, among all machines that still have some capacity, completes job 2 quickest. Keep going until a machine has been assigned to all jobs. Does this heuristic procedure yield the optimal solution for this problem? If it does, see whether you can change the job times so that the heuristic does not yield the optimal solution.

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter12: Queueing Models

Section: Chapter Questions

Problem 59P

See similar textbooks

Similar questions

Consider the following tasks that must be assigned to four workers on a conveyor-paced assembly line (i.e., a machine-paced line flow). Each worker must perform at least one task. There exists unlimited demand unless stated otherwise. Time to Complete Task (seconds): Task 1: 30 Task 2: 25 Task 3: 15 Task 4: 20 Task 5: 15 Task 6: 20 Task 7: 50 Task 8: 15 Task 9: 20 Task 10: 25 Task 11: 15 Task 12: 20 The current conveyor-paced assembly-line configuration assigns the workers in the following way: • Worker 1: Tasks 1, 2, 3 • Worker 2: Tasks 4, 5, 6 • Worker 3: Tasks 7, 8, 9 • Worker 4: Tasks 10, 11, 12 What is the direct labor content (in seconds per unit)?
One possible solution method for the machine-tojob assignment problem is the following heuristic procedure. Assign the machine to job 1 that completes job 1 quickest. Then assign the machine to job 2 that, among all machines that still have some capacity, completes job 2 quickest. Keep going until a machine has been assigned to all jobs. Does this heuristic-procedure yield the optimal solution for this problem? If it does, see whether you can change the job times so that the heuristic does not yield the optimal-solution.
William Beebe owns a small shoe store. He has 10 pairs of shoes that requireresoling and polishing. He has a machine that can resole one pair of shoes at atime, and the time required for the operation varies with the type and condition of theshoe and the type of sole that is used. Shoes are polished on a machine dedi-cated tothis purpose as well, and polishing is always done after resoling. His assistant generally does the polishing while Mr. Beebe does the resoling. The resoling and polishingtimes (in minutes) are Shoes Resoling Time Polishing Time1 14 32 28 13 12 24 6 55 10 106 14 67 4 128 25 89 15 510 10 5In what order should the shoes be repaired in order to minimize the total makespanfor these 10 jobs?
Consider a manufacturing process depicted by the following flowchart. A1 B: 4 minutes A2 A3 B Either of C1 and C2: 2 minutes. C1 Station A has 3 parallel operators, A1, A2, and A3. Station C has 2 parallel operators, C1 and C2. Each unit only needs to be processed by one of the operators A1, A2 and A3. After being processed at Station B, a unit then needs to be processed by either C1 or C2. The process time of the individual operators are given as follows. Each of A1, A2, and A3: 20 minutes C2 What is the capacity (in units/hour) of the whole process? Round your final answer to 2 decimal places if it is not a whole number.
Chris has three different workstations: one for drip coffee, one for espresso drinks, and one to prepare food. During the morning rush, Chris has 5 people working: one person at the drip coffee station, two at the espresso station, and two at the food prep station. These employees are not cross-trained, and thus must stay at their station. On average, it takes the person at the drip coffee station 1 minute to make the coffee. On average, it takes one person working at the espresso station 3 minutes to make one espresso drink. On average, it takes one person working at the food station 4.5 minutes to prepare the food for one customer. The customer mix is as follows. 10% order just a drip coffee, 30% order a drip coffee and food, 35% order just an espresso drink, and 25% order an espresso drink plus food. A total of 40 customers/ hour frequent Chris'. What is the implied utilization at the espresso station? Provide your answer in decimal form, and round to 4 decimal places. (So, if your…
The manager of the Personnel Department at City Enterprises has been reading about time-driven ABC and wants to apply it to her department. She has identified four basic activities her employees spend most of the their time on: Interviewing, Hiring, Assessment, and Separation Processing. The department employs 5 staff who perform these activities. The manager provides the following estimates for the amount of time it takes to complete each of these activities: Interviewing: 45 minutes. Hiring: 60 minutes. Assessment: 75 minutes. Separation Processing: 90 minutes. Employees in Personnel work 35-hour weeks with four weeks for vacation. Of the 35 hours, five are reserved for administrative tasks, training, and so on. The costs of the Personnel Department, including any allocated costs from other staff functions, are $972,000. During the year, Personnel conducted 1,200 interviews, made 375 hires, made 3,000 assessments, and had 250 separations. The manager of the Personnel…
In an evaluation of labor assignment rules when workers are not perfectly interchangeable, Paul. M. Bobrowski and Paul Sungchil Park created a dynamic job shop with 9 work centers and 9 workers, both numbered 1–9. The efficiency of each worker is specified in the following labor efficiency matrix, which represents the degree of worker cross-training.† Work Centers 1.00 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 1.00 0.95 0.95 0.95 0.95 0.95 0.85 0.85 0.85 0.85 1.00 W o r k e r s (a) For what work center(s) is worker 2 least efficient? (Enter your answers as a comma-separated list.) (b) For what…
A process improvement team is working to improve the production output at the Johnson Manufacturing plant’sHeader Cell that manufactures a key component, headers, used in commercial air conditioners. A header is partof the circulatory system of a commercial air conditioner that moves coolant between various components suchas the evaporator coil and the condenser coil. Currently, the header production cell is scheduled separately fromthe main work in the plant. Often, individual headers are not sequenced to match the product they go into on thefinal assembly line in a timely fashion, and so the product can sit in queue waiting for a header
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 G respectively. Task A does not have any predecessor to start. To start Task B, it requires Task A to be completed, Starting tasks needs the task 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 28.2.1,0.9, 10, 1.2.1.8 are 4.7 minutes respectively. How many minimum numbers of workstations are needed? a. 1 b. 6 c. None is correct d. 3 e. 5 please I neef answer along with the formula don't put it on excel
FILE UPLOAD: Draw a flowchart for customers fueling their cars at a gas station, starting with the customer exiting their car to refuel, and ending with the customer leaving the fueling station. Upload your flowchart as a file to answer this question. Include at least one decision block in your flowchart and at least 4 distinct activities. You can use any means to construct the flowchart (software, by hand, etc.). Remember to save your file in case you want to re-take the assignment.
In her last semester at SPC, Polly Hedron needs to take Statistics, Composition 2, Ethics, and Physics. Because Polly is registering early, she has 14 choices for her section of Statistics, 19 choices for her section of Composition, 17 choices for her section of Ethics, and 18 choices for her section of Physics. From how many possible schedules can Polly choose? (You may presume that none of these sections interfere with each other) Your Answer:
Diablo Electronics manufactures four unique products (A, B, C, and D) that are fabricated and assembledin five different workstations (V, W, X, Y, and Z) using a small batch process. Each workstation is staffedby a worker who is dedicated to work a single shift per day at an assigned workstation. Batch setuptimes have been reduced to such an extent that they can be considered negligible. A flowchart denotesthe path each product follows through the manufacturing process as shown in Figure 5.2, where eachproduct’s price, demand per week, and processing times per unit are indicated as well. Inverted trianglesrepresent purchased parts and raw materials consumed per unit at different workstations. Diablo canmake and sell up to the limit of its demand per week, and no penalties are incurred for not being able tomeet all the demand.Which of the five workstations (V, W, X, Y, or Z) has the highest utilization, and thus serves as the bottle-neck for Diablo Electronics?