Production and Operations Analysis, Seventh Edition
7th Edition
ISBN: 9781478623069
Author: Steven Nahmias, Tava Lennon Olsen
Publisher: Waveland Press, Inc.
expand_more
expand_more
format_list_bulleted
Videos
Question
Chapter 9, Problem 38AP
Summary Introduction
Interpretation: The order in which shoes are to be repaired for the minimizations of the total make span for the given jobs is to be determined.
Concept Introduction:
Lateness of process is defined as the length of time which is past its deadline that it is finished already. In this L’s Algorithm is used to determine the sequence for the minimization of maximum lateness. This algorithm schedules the arriving task simultaneously on one processor by using precedence constraints.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Consider the problem of assigning multiple jdentical machines to an individual operator for the following situations: the loading and unloading time is 5 minutes, the independent operator activity time is 2 minutes, the independent machine activity time is 15 minutes.
(a) How many machines should be assigned so that the operator will not be idle? What is the machine idle time in this case?
(b) How many machines should be assigned so that machines will not be idle? What is the operator idle time in this case?
Tyler bakes Cookies (C) and Breads (B) with the help of two ovens in his little bakery. The time taken by Oven A to bake each cookie batch is 14 minutes and the time taken by Oven B is 12 minutes. The time taken by Oven A to bake a batch of bread is 16 minutes and the time taken by Oven B is 17 minutes. Each week both Ovens can be used for 50 hours each to bake Cookies and Breads. The rest of the time is used for baking other products. Moreover, Tyler starts each week with a stock of 25 batches of Cookies and 30 batches of Breads because the Cookies and Breads he produces can be considered to be “fresh” for a maximum of 2 weeks. There is an average weekly demand of 70 batches of Cookies and 50 batches of Breads. For each batch of Cookies, Tyler makes $30 in profit and for each batch of Breads Tyler makes $25 in profit. If there are any “close to losing freshness” goods at the end of the week, Tyler sells them at heavily discounted prices on weekends with a profit of $5 per batch of…
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.
Chapter 9 Solutions
Production and Operations Analysis, Seventh Edition
Ch. 9.5 - Prob. 1PCh. 9.5 - Prob. 2PCh. 9.5 - Prob. 3PCh. 9.5 - Prob. 4PCh. 9.5 - Prob. 5PCh. 9.6 - Prob. 6PCh. 9.6 - Prob. 7PCh. 9.6 - Prob. 8PCh. 9.6 - Prob. 9PCh. 9.6 - Prob. 10P
Ch. 9.7 - Prob. 11PCh. 9.7 - Prob. 12PCh. 9.7 - Prob. 13PCh. 9.7 - Prob. 14PCh. 9.7 - Prob. 15PCh. 9.7 - Prob. 16PCh. 9.7 - Prob. 17PCh. 9.8 - Prob. 18PCh. 9.8 - Prob. 19PCh. 9.8 - Prob. 20PCh. 9.8 - Prob. 21PCh. 9.8 - Prob. 22PCh. 9.9 - Prob. 23PCh. 9.9 - Prob. 24PCh. 9.9 - Prob. 25PCh. 9.10 - Prob. 27PCh. 9.10 - Prob. 28PCh. 9.10 - Prob. 29PCh. 9 - Prob. 30APCh. 9 - Prob. 31APCh. 9 - Prob. 32APCh. 9 - Prob. 33APCh. 9 - Prob. 34APCh. 9 - Prob. 35APCh. 9 - Prob. 36APCh. 9 - Prob. 37APCh. 9 - Prob. 38APCh. 9 - Prob. 39APCh. 9 - Prob. 40APCh. 9 - Prob. 41APCh. 9 - Prob. 42APCh. 9 - Prob. 43APCh. 9 - Prob. 44APCh. 9 - Prob. 45APCh. 9 - Prob. 46APCh. 9 - Prob. 47AP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.Similar questions
- 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.arrow_forwardA 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: Solve the problem (provide exact values for all variables and the optimal objective function).arrow_forwardAn industrial engineer has designed two alternative methods for accomplishing a production job. Both methods involve the acquisition of the same working place and other capital equipment to be used for this job only. Method A calls for a crew consisting of three men each costing Php30/hr. This method will result in the production of 10 units per hour of which two will be reject. Method B calls for a crew of two men each costing Php35/hr and should result in the production of eight units per hour of which one will be reject. The cost of the direct material lost in each reject is Php20. If a certain total number of units is to be produced find which method is economical?arrow_forward
- The single machine-scheduling problem consists of: Select one: None is correct n jobs with the same single operation on each of the jobs. n jobs with m operations on each of the jobs. n jobs with different operations on each of the jobs.arrow_forwardThe Sure To Peal Paint Company stores all its metal compressed gas containers in a warehouse. These long cylindrical metal tanks contain various gases used in manufacturing cans of spray paint. The gas tanks are delivered to the warehouse by truck. Two receiving dock workers unload the containers from the delivery trucks and place them on four wheel trucks. Two materials handlers are responsible for pushing the loaded trucks into the warehouse, unloading the tanks and setting them up on end. The two materials handlers spend a major portion of their day moving loads of the gas tanks into the warehouse and placing them into the proper storage locations. In total, there are five different types of gases that in equal proportion make up 98% of all gas handled. Question: Management would like to identify a better way to handle these gas tanks. How can the handling operation be improved?arrow_forwardRaquel’s Landscaping Company has contracted for several landscaping jobs. Each job requires preparing the areas (identifying the locations and types of plants, preparing the soil, etc.) and then planting the trees, bushes, and shrubs. The expected time for each of the jobs is shown next. Job Preparingthe Area (days) Planting(days) R 3 2 S 1 3 T 4 5 U 8 5 V 6 4 W 4 3 Raquel is concerned with efficiency. She believes it is probably more efficient to use SPT (shortest processing time) as her priority rule. (a) Develop a sequence using SPT based on processing time for preparing the area. (If two of more jobs have the same processing time, list them alphabetically.) Preparing the Area select a job select a job select a job…arrow_forward
- An order for 200 units of a product is processed on work centers A and B. The set up time on A is 45 minutes and the run time is 5 minutes per piece. The set up time on B is 40 minutes and the run time is 8 minutes per piece. The wait time between the two operations is 2 hours. The move time between A and B is 15 minutes. Wait time after operation B is 1 hour and the move time into stores is 50 minutes. There is no queue at either work station. Calculate the total manufacturing lead time for the order.arrow_forwardDaniel works as a programmer for a large software company. He writes and tests utility programs such as compilers. His company operates two computing shifts: during the day for program development and online applications are running at night batch production jobs. Daniel has access to workload data and learns that the evening batch runs are complementary to daytime programming tasks; that is, adding programming work during the night shift would not adversely affect the performance of the computer to other users. Daniel comes back after normal hours to develop a program to manage his own stock portfolio. His drain on the system is minimal, and he uses very few expendable supplies, such as printer paper. Discuss the ethical principles that Daniel violated as an IT Professional.arrow_forwardAn independent accountant is planning to prepare tax returns for six of her clients.Prior to her actually preparing each return, her secretary checks the client’s file to besure all the necessary documentation is there and obtains all the tax forms needed forthe preparation of the return. Based on past experience with the clients, her secretaryestimates that the following times (in hours) are required for preparation of the returnand for the accountant to complete the necessary paperwork prior to filing each return:Client Secretary Time Accountant Time1 1.2 2.52 1.6 4.53 2.0 2.04 1.5 6.05 3.1 5.06 0.5 1.5In what order should the work be completed in order to minimize the total timerequired for all six clients?arrow_forward
- 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…arrow_forwardYou work for a small shipping company and warehouse. The owners have decided to update the software used for tracking, shipping, receiving, and inventory. Fifteen computers need to be updated. Hours of operation are 7 a.m. to 7 p.m. Monday through Saturday. Each computer must be updated manually by one of two trained employees, both of whom must be borrowed from other managers. The update procedure consumes 4 hours of the updater's time and generates an additional 1.5 hours of computer downtime. The work must be performed at a central loading station, away from the current location of the computer. How does the project portfolio management approach lead to enhanced strategic management for an organization and give an example how you woulduse this in a work place?arrow_forwardFive sorority sisters plan to attend a social function. Each requires hair styling andfitting for a gown. Assume that the times required are independent exponentiallydistributed random variables with the mean times for the fittings of 0.6, 1.2, 1.5,0.8, and 1.1 hours, respectively, and mean times for the stylings of 0.8, 1.6, 1.0,0.7, and 1.3 hours, respectively. Assume that the fittings are done before thestylings and that there is only a single hair stylist and a single seamstress available.In what sequence should they be scheduled in order to minimize the total expectedtime required for fittings and stylings?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,
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Process selection and facility layout; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=wjxS79880MM;License: Standard YouTube License, CC-BY