EBK PRODUCTION AND OPERATIONS ANALYSIS
7th Edition
ISBN: 9781478628385
Author: Olsen
Publisher: WAVELAND PRESS (ECONTENT)
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 9.7, Problem 12P
Summary Introduction
Interpretation: The possible schedules if the jobs are processed in any order. Also, the time required to evaluate the feasible schedules if the computer program could evaluate 100 schedules every second.
Concept Introduction: The method of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Suppose that 12 jobs must be processed through six machines. If the jobs may beprocessed in any order, how many different possible schedules are there? If youwere to run a computer program that could evaluate 100 schedules every second,how much time would the program require to evaluate all feasible schedules?
What are the benefits and drawbacks of the shortest processing time rule (SPT)?
Using 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.
Chapter 9 Solutions
EBK PRODUCTION AND OPERATIONS ANALYSIS
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
- What are the advantages and disadvantages of the shortest processing time (SPT) rule?arrow_forwardThe company has received 7 special jobs. These jobs have to go through Process X, Process Y and then Process Z in sequence. Each of the processes is operated by a dedicated machine. What is the optimal sequence to schedule the jobs? Show your steps. If there is more than one optimal sequence under the adapted Johnson’s rule, show them all.arrow_forwardConsider 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)?arrow_forward
- 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…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_forwardAt the campus copy shop, six jobs have arrived in the order shown (A, B, C, D, E, and F) at the beginning of the day 1 (today, which is a work day). All of the jobs are due at various times today. Your job is to evaluate four common sequencing rules. JOB DUE (IN HOURS) DURATION (HOURS REQUIRED) A 8 (this job is due in 8 hours) 1.65 B 5.5 (this job is due in 5.5 hours) 1.20 C 4.5 (this job is due after lunch in 4.5 hours) 0.85 D 6 (this job is due in 6…arrow_forward
- I need a b c pleasearrow_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_forwardDan's Auto Detailing business performs two major activities: exterior cleanup and interior detailing. Based on the size of car and condition, time estimates for six cars on Monday morning are as shown in the accompanying table. Car Number 1 5 6 Exterior Interior 55 75 4 65 35 50 60 45 90 35 40 a. Sequence the cars so that all exterior cleanup is done first and total completion time is minimized. The sequence is -Select-- -Select- -Select- -Select- -Select-- -Select- 2 3 80 20arrow_forward
- A computer center has two identical computers for batch processing. Thecomputers are used as parallel processors. Job times are estimated by the user, but experience has shown that an exponential distribution gives an accurate description of the actual job times. Suppose that at a point in time there are eight jobs remaining to be processed with the following expected job times (expressed in minutes):Job 1 2 3 4 5 6 7 8Expected time 4 8 1 50 1 30 20 6a. In what sequence should the jobs be processed in order to minimize theexpected completion time of all eight jobs (i.e., the makespan)?b. Assume that computer A is occupied with a job that has exactly two minutes of processing time remaining and computer B is idle. If job times are deterministic, show the start and end times of each job on each computer using the sequence derived in part (a).arrow_forwardConsider 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.arrow_forwardThe framing department has five jobs waiting to be processed. It is now time zero and all jobs are ready to begin. Each has only one operation remaining. All jobs arrived at the same time, and FCFS begins with job a, then b, etc. Processing Time (days) Due Date (days) Jobs a b C d e A B On day 9 On day 13 If the Earliest Due Date (EDD) rule is used, when will job a be finished? On day 17 4 On day 19 6 2 7 8 8 7 9 6 14arrow_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