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
Question
Chapter 9.6, Problem 7P
Summary Introduction
Interpretation: The sequence of the projects that the individual should followin order to minimize the maximum lateness is to be determined.
Concept Introduction: The activities under a project are programmed based on the needs of the individual and attaining ease is the priority of the individual.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Jobs A, B, E, F and G must go through Machines M1 and M2 in that sequence. Use Johnson’s Rule to determine the optimal sequence in which to schedule the jobs to minimise the total required time. How much total time is required to process all the seven jobs? Illustrate this using a Gant Chart.
Job
Processing time on M1
Processing time on M2
A
4
5
B
16
14
C
8
7
D
12
13
E
3
9
F
9
6
G
8
5
Mike Reynolds has four assignments due in class tomorrow, and his class times are as follows:
Class
Time
Marketing 304
9 a.m.
OM 385
12 p.m.
Finance 216
2 p.m.
Psychology 200
5:30 p.m.
Each class lasts one hour, and Mike has no other classes. It is now midnight, and Mike estimates that the finance, OM, marketing, and psychology assignments will take him two, three, five, and four hours, respectively. Assume that all time till the last class begins can be spent on completing assignments but each assignment should be done till the time of the class on the same subject. (Mike can prepare assignments for the next classes during previous classes.)
Use the Excel to determine how he should schedule the work. Use minus sign to enter negative lateness values, if any. Enter the half an hour value as 0.5, e.g., 3:30 p.m. should be entered as 15.5. If your answer is zero, enter "0". Round your answers for the due date, lateness, and tardiness to one decimal place. Round your…
An assembly department has six jobs waiting to be processed. It is now time zero and all jobs are ready to begin.
Job
Processing Time
Due Date
A
5
12
B
7
18
C
8
6
D
3
10
E
9
22
F
12
17
Which scheduling will be better to use, EDD or SPT and why
Suppose there is a new method called Earliest difference first that arranges the jobs based on the difference between due date and the processing time, would this method be better than the results of part (1)
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
- Thomas has four assignments due in class tomorrow, and his class times are as follows. Class Time Marketing 304 8 am OM 385 10 am Finance 216 2 pm Psychology 4:30 pm Each class lasts one hour, and Thomas has no other classes. It is now midnight, and Thomas estimates that the marketing, OM, finance, and psychology assignments will take him six, three, four, and two hours, respectively. Use the Excel Sequencing template to determine how he should schedule the work. Can he complete all of it on time? (Hint: Using SPT and EDD. First, convert times to due dates past midnight).arrow_forwardSix ships are docked in a harbor awaiting unloading. The times required to unload the ships are random variables with respective means of 0.6, 1.2, 2.5, 3.5, 0.4, and 1.8 hours. The ships are given a priority weighting based on tonnage. The respective tonnages are 12, 18, 9, 14, 4, and 10. In what sequence should the ships be unloaded in order to minimize the expected weighted time?arrow_forwardThe chief of police, Karen Stanley, of the Make-BelievePolice Department needs to assign five detective squadsto five pending criminal cases. Karen wants to comeup with an optimum assignment that will minimize thetotal time it takes to conclude the cases. Data on past performance of each detective squad to complete each case assigned in terms of average number of days ispresented in the following table.Average Completion Time (in Days)Detective Squad Case-1 Case-2 Case-3 Case-4 Case-5A 15 8 4 8 28B 21 8 13 7 32C 11 4 5 6 20D 9 12 8 13 20E 14 24 25 27 9Use the assignment method to solve the problemIf Squad D cannot be assigned to Case-5 as a result ofa conflict of interest, solve the problem given this new constraint.arrow_forward
- Write down linear programming for this assignment problem consistent with the objective of Fix- it Shoparrow_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_forwardOne 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.arrow_forward
- 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.arrow_forwardPlease formulate the problem as AN OPTIMIZATION MODEL only and I will finish the rest. Health Center is planning to open its facilities 24 hours a day and wants to determine an optimal schedule. for their nurses. A nurse's work schedule is 8 hours in a row and can only start at the beginning of each shift. The personnel requirement for each shift is shown in Table 1. Table 1 – Personnel Requirementarrow_forwardIn 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:arrow_forward
- Five employees are available to perform four jobs. Thetime it takes each person to perform each job is given inTable 50. Determine the assignment of employees to jobsthat minimizes the total time required to perform the fourjobs. Please also provide the graph.arrow_forward3. George Heinrich Printing Company wants to schedule the following seven jobs where each job must be processed by two machines A and B, first on machine A and then machine B. The processing times at machine A and B are as follows: Job i 1 2 3 4 5 6 7Processing time on machine A (ai) 15 7 4 7 10 4 7Processing time on machine B (bi) 3 9 10 6 9 5 8 (a) Suppose the inter-arrival times between jobs can be treated as zero and Johnson’srule is used to sequence and process the jobs, what is the completion time of eachjob and what is the total throughput time (makespan) of all jobs? (b) Now suppose that FIFO system (i. e., schedule job l before job 2, etc.) of schedulingand processing the jobs is used. What is the completion time of each job and whatis the total throughput time (makespan) of all jobs? (c) What would be the difference in the average time a job spends in the shop in (a)and (b) above?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
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.
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY