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
Concept explainers
Videos
Question
Chapter 9, Problem 37AP
Summary Introduction
Interpretation: The sequence which is required for the minimization of maximum lateness 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
The operations manager of a body and paint shop has five cars to schedule for repair. The estimates of the times required to do the body and paint work on each are as follows:
Using Johnson's Rule to minimize total duration, the correct sequence of these five jobs is;
a. DCAEB b. DBECA c. BEACD d. ACEBD
Car
Body Work (Hours)
Paint (Hours)
A
8
7
B
9
4
C
7
9
D
3
4
E
12
5
2. The operations manager of an assembly and paint shop has five trucks to schedule for repair. He would like to minimize the throughput time (makespan) to complete all work on these cars. Each truck requires assembly prior to painting. The estimates of the times required to do the assembly and paint work on each are as follows:Use Johnson's rule to sequence these five jobs for minimum total duration. Show your step by step work in determining the job sequence and calculate the total duration of finishing assembly and painting operations on all the five trucks ?
Five 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
2345
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 machine center in a job shop for a local fabrication company has five unprocessed jobs remaining at a particular point in time. The jobs are labeled A, B, C, D, and E in the order that they entered the shop. The respective processing times and due dates are given in the table below. What is the sequence the of jobs by CR rules? Job Processing Time Due Date A 10 32 B. 55 34 C. 11 31 60 35arrow_forwardA group of six jobs is to be processed through a two-machine flow shop. The first operation involves cleaning and the second involves painting. Determine a sequence that willminimize the total completion time for this group of jobs. Processing times are as follows:PROCESSING TIME (hours)Job Work Center 1 Work Center 2A 5 5B 4 3C 8 9D 2 7E 6 8F 12 15 To employ Johnson’s rule, create a “blank” sequence first, such as:mhhe.com/stevenson13eEXAMPLE 41st 2nd 3rd 4th 5th 6tharrow_forwardUsing the FCFS rule for scheduling, the sequence is 1-2-3 For the schedule developed using the FCFS rule, the total length of time taken to complete the three suits (including delivery) : hours (enter your response as a whole number). = G Sunny Park Tailors has been asked to make three different types of wedding suits for separate customers. The table below highlights the time taken in hours for cutting and sewing (process 1) and delivery (process 2) of each of the suits. Times Taken for Different Activities (hours) Cut and Sew 3 5 6 Suit 1 2 7 3 Deliver 4 2 ∞ N 8 Assume that orders for suits have been listed in the above table in the order in which they were received.arrow_forward
- 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 startupon 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 will be the idle time for the FIRST Workstation? O a. 0.47 O b. 0.27 Oc. 0.57 O…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_forwardIn 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_forward
- Use Johnson's rule to determine the optimal processing sequence for the jobs listed in the following table. JOB F has the ABCDEFG Processing Time (mins) ST1 30 8 10 18 5 15 14 ST2 12 16 9 7 4 5 20 Please write the optimal processing sequence for the six jobs:arrow_forwardA 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 70 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.8, 2.1, 0.9, 1.0, 1.2, 1.8, and 4.7 minutes respectively. What should be the cycle time in minutes? O a. 4.4 O b. 7.5 O c. 4.7 O d. 6.86 e. None is the correct answerarrow_forwardA nursing home must schedule nurses in a manner that balances providing adequate patient care while keeping costs down. From historical records, administrators can project the minimum number of nurses to have on hand during each day/time slot. This data is shown below. Shift Time Slot Minimum number of nurses needed 1 12 am-4 10 2 4 am-8 6 3 8 am-12 8 4 12 pm-4 12 5 4 pm-8 10 6 8 pm-12 14 Nurses must start work at the beginning of one of the four-hour shifts (starting as early as 12 am midnight or as late as 8pm evening) and work for eight hours. Nurses who begin working at 8 pm will work until 4 am the next morning. Formulate and solve the nurse-scheduling problem so as to minimize excess stagging while satisfying minimum staffing requrements. What is the value of total excess staffing?arrow_forward
- 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 150 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 Gare 2.3, 2.1,0.9, 1.0, 1.2, 1.8, and 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 will be the idle time for the LAST Workstation? O a 14 Ob. 1.7 Oc. None is the…arrow_forwardA 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 110 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.8, 2.1, 0.9, 1.0, 1.2, 1.8, and 4.7 minutes respectively. How many minimum numbers of workstations are needed? O a. 1 Ob. 2 c. 6. O d. None is the correct answer O e. 4 82°F Mostly cle acerarrow_forwardA 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 110 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 taskGneeded, task Fto be completed. The processing times for tasks, A, B, C. D, E, F, and Gare 2.8, 2.1, 0.9, 1.0, 1.2, 1.8, and 4.7 minutes respectivelV How many minimum numbers of workstations are needed? None is the correct answer O b. 6 O c. 4 O d. 2 Oe. 1arrow_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 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.
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.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY