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.7, Problem 13P
Summary Introduction
Interpretation: The optimal schedule for J and M in order to minimize the total time required for both using J’s algorithm.
Concept Introduction: The method of
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
What is true about the assignment problem if the solution has reached the table below?
Project A
Project B
Project C
Project D
Expert W
0
100
200
0
Expert X
0
0
200
300
Expert Y
0
100
300
0
Expert Z
200
100
0
0
a. The minimum number of vertical and horizontal lines needed to cross out 0s is three.
b. Optimal assignment of projects cannot be determined yet.
c. Optimal assignment of projects can now be determined.
Two law students, John and Marsha, are planning an all-nighter to prepare for theirlaw boards the following day. Between them they have one set of materials in thefollowing five subjects: contracts, torts, civil law, corporate law, and patents.Based on their previous experience, they estimate that they will need the following amount of time (in hours) with each set of materials:Contracts Torts Civil Corporate PatentsJohn 1.2 2.2 0.7 0.5 1.5Marsha 1.8 0.8 3.1 1.1 2.3They agree that Marsha will get the opportunity to see each set of notes beforeJohn. Assume that they start their studying at 8:00 P.M. Determine the exact timesthat each will begin and end studying each subject in order to minimize the totaltime required for both to complete studying all five subjects
A consulting firm has four projects to consider. Each project will require time (in days) in the next three months according to the table below.
Project
Time in first month
Time in second month
Time in third month
Revenue
A
6
8
6
22000
B
5
6
8
18000
C
8
7
6
16000
D
5
5
4
15000
Revenue from each project is also shown. There is 20 days’ time available in the first month, 22 days’ time available in the second month, and 22 days’ time available in the third month to do these projects. The management wants to select at most 3 projects. If project B is selected, then project C must also be selected. The objective of the firm is to maximize the total revenue.
Formulate an integer optimization model for this problem by defining the decision variables, the objective function and all the constraints.…
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
- Fowle Marketing Research, Inc. is faced with the problem of assigning three available project leaders (agents) to each of three new research studies (tasks). Fowle’s management realizes, however, that the time required to complete each study will depend on the experience and ability of the project leader assigned to the study. Since the three studies have been judged to have approximately the same priority, the company would like to determine the assignments that will minimize the total number of days required to complete all three. If a project leader is to be assigned to one and only one client, what assignments should be made (optimal solutions)? How many days are required (objective function value).With three project leaders and three clients, there are total of nine possible assignment alternatives. The alternatives and the estimated project completion times in days are summarized in Table Client Project Leader 1 2…arrow_forwardTwo law students, John and Marsha, are planning an all-nighter to prepare for their law boards the following day. Between them they have one set of materials in the following five subjects: contracts, torts, civil law, corporate law, and patents. Based on their previous experience, they estimate that they will need the following amount of time (in hours) with each set of materials: (given) They agree that Marsha will get the opportunity to see each set of notes before John. Assume that they start their studying at 8:00 P.M. Determine the exact times that each will begin and end studying each subject in order to minimize the total time required for both to complete studying all five subjects.arrow_forwardFour jobs are to be assigned to employees. There are 5 available employees. Durations for each job/employee combination are given in the following table. Build an assignment model to minimize the total time. What is the minimum optimal time? Employees Jobs 1 2 3 4 5 A 15 20 18 28 16 B 16 25 14 18 20 C 25 30 27 32 17 D 32 25 20 26 20arrow_forward
- Finco has the following investments available:Investment A For each dollar invested at time 0, we receive $0.10 at time 1 and $1.30 at time 2. (Time 0 =now;time= 1 one year from now; and so on.)Investment B For each dollar invested at time 1, we receive $1.60 at time 2.Investment C For each dollar invested at time 2, we receive $1.20 at time 3.At any time, leftover cash may be invested in T-bills, whichpay 10% per year. At time 0, we have $100. At most, $50can be invested in each of investments A, B, and C. Formulate an LP that can be used to maximize Finco’s cash onhand at time 3.arrow_forwarddevelope a space matrix for macdonalds. Below are the instructions. The steps required to develop a SPACE Matrix are as follows: 1. Select a set of variables to define financial position (FP), competitive position (CP), stability position (SP), and industry position (IP). 2. Assign a numerical value ranging from +1 (worst) to +7 (best) to each of the variables that make up the FP and IP dimensions. Assign a numerical value ranging from -1 (best) to -7 (worst) to each of the variables that make up the SP and CP dimensions. On the FP and CP axes, make comparison to competitors. On the IP and SP axes, make comparison to other industries. 3. Compute an average score for FP, CP, IP, and SP by summing the values given to the variables of each dimension and then by dividing by the number of variables included in the respective dimension. 4. Plot the average scores for FP, IP, SP, and CP on the appropriate axis in the SPACE Matrix. 5. Add the two scores on the x-axis and plot the resultant…arrow_forwardDaniel needs to assign his mechanics to four pending jobs. The table below shows how much time (in minutes) it takes each mechanic to perform each job. Help Daniel determine the optimal assignments. In the optimal solution, who should be assigned to work on Job 4?arrow_forward
- The honorary business fraternity at Tech is planning an all-day bake sale on Saturday of a home football game as a charity fund-raising project. The members will bake cakes, cupcakes, and cookies in one member’s apartment oven starting at 5 p.m. on Friday after the members get out of class until midnight. All the items bake at the same temperature (350 degrees) but for different times—40 minutes for a cake, 25 minutes for cupcakes, and 8 minutes for cookies—so they will bake one item at a time. The oven has enough space to bake a batch of 12 cakes or 48 cupcakes or 60 cookies at a time. The recipe for a cake calls for 2 eggs, 0.5 cups of butter, 1.5 cups of flour, and 1 cup of sugar. A batch of 12 cupcakes requires 2 eggs, 0.5 cups of butter, 1.5 cups of flour, and 1 cup of sugar; and the recipe for a batch of 60 cookies calls for 2 eggs, 1 cup of butter, 2 cups of flour, and 1 cup of sugar. A local grocery store has donated 10 dozen eggs and 30 pounds each of butter, sugar, and…arrow_forwardThe Swift Corporation wants to schedule the following seven-job problem to be processedon two machines A and B. Each job must be processed by two machines A and B, firston machine A and then machine B. The operation processing times at machine A and Bare as follows: Jobi 1 2 3 4 5 6 7 Processing time on machine A (ai) 9 8 7 12 6 8 15 Processing time on machine B (bi) 6 5 7 19 12 11 7 Suppose jobs arrived in their natural order (i.e., job l before job 2, etc.), and FIFOsystems of scheduling and processing the jobs is used. What is the completion timeof each job and what is the total throughput time (makespan) of all jobs?arrow_forwardBrenda Last, an undergraduate business major at State University, is attempting to determine her course schedule for the fall semester. She is considering seven 3-credit-hour courses, which are shown in the following table. Also included are the average number of hours she expects to have to devote to each course each week (based on information from other students) and her minimum expected grade in each course, based on an analysis of the grading records of the teachers in each course: Course Average Hours per Week Minimum Grade Management I 5 B Principles of Accounting 10 C Corporate Finance 8 C Quantitative Methods 12 D Marketing Management 7 C Java Programming 10 D English Literature 8 B An A in a course earns 4 quality credits per hour, a B earns 3 quality credits, a C earns 2 quality credits, a D earns 1 quality credit, and an F earns no quality credits per hour. Brenda wants to select a schedule that…arrow_forward
- A diet is being prepared for the University of Arizona dorms. The objective is to feed the students at the least cost, but the diet must have between 1,800 and 3,600 calories. No more than 1,400 calories can be starch, and no fewer than 400 can be protein. The varied diet is to be made of two foods: A and B. Food A costs $0.75 per pound and contains 600 calories, 400 of which are protein and 200 starch. No more than two pounds of food A can be used per resident. Food B costs $0.15 per pound and contains 900 calories, of which 700 are starch, 100 are protein, and 100 are fat. (Answers in Appendix D)a. Write the equations representing this information.b. Solve the problem graphically for the amounts of each food that should be used.arrow_forwardInstruction: Formulate the dual problems for X2 the following linear programming model No need to compute/doing a tableau 1. Maximize Z = 2X1 + X2 Subject to: X2 < 10 2X1 + 5X2 < 60 X1 + X2 <18 3X1 + X2 < 44 2. Maximize Z = 2X1 + X2 +3X3 Subject X1 + X2 + 2X3 < 400 2X1 + X2 + X3 < 500 3. Maximize Z = 80X1 + 60X2 Subject X1 + X2 = 200 X1 < 50 X2 > 80arrow_forwardA toy manufacturer preparing a production schedule for two new toys, trucks spinning tops,must use the information concerning their construction times below.Machine A Machine B FinishTruck 2hr 3hr 5hrSpinning Top 1hr 1hr 1hrFor example, each truck requires 2 hours on machine A. The available employee hours per weekare as follows: For operating machine A; 80 hours; for B, 50 hours; for finishing 70 hours. If theprofits on each truck and spinning top are R7 and R2, respectively, how many of each toyshould be made per week to maximize profit? What is the maximum profit?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,
Inventory Management | Concepts, Examples and Solved Problems; Author: Dr. Bharatendra Rai;https://www.youtube.com/watch?v=2n9NLZTIlz8;License: Standard YouTube License, CC-BY