Principles Of Operations Management
11th Edition
ISBN: 9780135173930
Author: RENDER, Barry, HEIZER, Jay, Munson, Chuck
Publisher: Pearson,
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 15, Problem 11DQ
Summary Introduction
To define: Assignment method
Introduction:
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Question:
Consider the following linear program:
Max Z = 2*x + 3*y
subject to
3*x + 4*y >= 12
3*x + 2*y >= 9
y>= 1
x,y >= 0
The number of feasible corner points is:
0
1
2
3
None of the other answers are correct.
Question 1: Alice and her family is preparing for their Thanksgiving trip. The preparation requires the
completion of the following activities along with their durations and immediate predecessor(s): (Ac-
tivity: A, Duration: 5, Predecessor(s): None);(Activity: B, Duration: 2, Predecessor(s): A);(Activity:
C, Duration: 5, Predecessor(s): A);(Activity: D, Duration: 2, Predecessor(s): B,C);(Activity: E, Du-
ration: 2, Predecessor(s): C);(Activity: F, Duration: 1, Predecessor(s): D);(Activity: G, Duration: 4,
Predecessor(s): A,B,F)
1) Draw the network diagram of this Thanksgiving trip preparation.
2) Find the earliest start times of all the activities.
3) What is the critical path?
4) What is the project duration?
QUESTION 4 (SCHEDULING: JOHNSON'S RULE)
The following schedule was prepared by the production manager of Marymount Metal Shop:
Determine a schedule that will result in the earliest completion of all jobs on this list.
CUTTING
POLISHING
Job
ABCDEFG
(ii)
(iii)
(iv)
Start
0
2
6
11
15
17
20
Finish
2
6
11
15
17
20
21
Start
2615232
11
20
24
Finish
5
9
13
20
23
24
28
What is the optimal sequence?
Draw the time-phased chart.
What is the total completion time?
What is the total idle time at Polishing work centre?
Chapter 15 Solutions
Principles Of Operations Management
Ch. 15 - Prob. 1EDCh. 15 - Prob. 1DQCh. 15 - Prob. 2DQCh. 15 - Prob. 3DQCh. 15 - Prob. 4DQCh. 15 - Prob. 5DQCh. 15 - Prob. 6DQCh. 15 - Prob. 7DQCh. 15 - Prob. 8DQCh. 15 - Prob. 9DQ
Ch. 15 - Prob. 10DQCh. 15 - Prob. 11DQCh. 15 - Prob. 12DQCh. 15 - Prob. 13DQCh. 15 - Prob. 1PCh. 15 - Prob. 2PCh. 15 - Prob. 3PCh. 15 - Prob. 4PCh. 15 - Prob. 5PCh. 15 - Prob. 6PCh. 15 - Prob. 7PCh. 15 - Prob. 8PCh. 15 - Prob. 9PCh. 15 - Prob. 10PCh. 15 - Prob. 11PCh. 15 - Prob. 12PCh. 15 - Prob. 13PCh. 15 - Prob. 14PCh. 15 - Prob. 15PCh. 15 - Prob. 16PCh. 15 - Prob. 17PCh. 15 - Prob. 18PCh. 15 - Prob. 19PCh. 15 - Prob. 20PCh. 15 - Prob. 21PCh. 15 - Prob. 22PCh. 15 - Prob. 23PCh. 15 - Prob. 24PCh. 15 - Prob. 25PCh. 15 - Prob. 26PCh. 15 - Prob. 27PCh. 15 - Prob. 28PCh. 15 - Daniels Barber Shop at Newark Airport is open 7...Ch. 15 - Given the following demand for waiters and...Ch. 15 - Prob. 1CSCh. 15 - Prob. 2CSCh. 15 - Prob. 3CSCh. 15 - Prob. 4CSCh. 15 - Prob. 1.1VCCh. 15 - Prob. 1.2VCCh. 15 - Prob. 1.3VCCh. 15 - Prob. 2.1VCCh. 15 - Prob. 2.2VCCh. 15 - Why is seniority important in scheduling servers?Ch. 15 - Prob. 2.4VC
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
- Question 1 The longest time period you can go without updating a schedule is no more than 3 weeks. True False Question 2 0 Network Loop is the process by which relationships between activities are created. Activities are linked finish-to-start start-to-start, finish -to -finish, or start-to-finish and can include lag or lead times. True False Question 3 A constraint is a restriction imposed on the start date, finish date or other aspect of an activity. Constraints are used to prescribe limitations on the schedule based on external conditions such as contractual restrictions or imposed float requirements. True Falsearrow_forwardQuestion 5: The following figure shows the product structure tree of product A. A D (2) B (2) E (1) C (1) | D (3) The company requires 200 units of product A in period 8 and 150 units in period 6. The on hand inventory for products A, B, C, D and E are 50, 150, 40, 100, 70 respectively. The lead times for products A, B, C, D and E are 1, 0, 2, 1, 1. Develop the MRP and specify gross and net requirements, projected on-hand, planned order receipts, and planned order release for all the products. Assume we use lot-for-lot ordering for all the products and not safety stock is required.arrow_forwardQUESTION THREEGiven the LP below:a) Solve the problem using big M-methodMinimize Z = 3X1 +4X2s.t 4X1 + X2 ≥ 30−X1 − 4X2 ≤ −184X1 + 3X2 ≥ 28X1, X2, ≥ 0arrow_forward
- QUESTION 10 A manufacturing facility is manufacturing a new tablet. The tables are formed by mother board, memory chips, and touch display. A tablets requires one mother board and 1 touch display. The motherboard requires two memory chips. Once that all pieces are in the plant it takes 2 weeks to assemble the final product. TH projected demand for weeks 6 to 10 are: 120, 170, 250, 200, and 125. The company has for week 6 already 60 tablets. The company also need to have at the end of week 10 an inventory of 50 tablets. Tablet (2 weeks) Touch display (1) Motherboard (1) (1 weeks) (1 weeks) Memory chip[s (2) (2 weeks) With the lot for lot policy, determine the planned order released for the memory chips and the starting week. Starting Week: Order Policy by Period:arrow_forwardQUESTION 5 A schedule for two processors has been created for the following project which has a finishing time of 30. A(6) B(11) Start C(1) F(5) G(4) D(9) FO ● H(5) E(8) ● Which is the following statements is applicable to the schedule? O A. The schedule is optimal because the finishing time is equal to the critical time. O B. The schedule is optimal because the finishing time is equal to the average time. End ● O C. The schedule is not optimal because the finishing time is greater than the critical time. O D. The schedule is not optimal because the finishing time is greater than the average time. O E. The schedule is not optimal because the finishing time is greater than both the average time and the critical time. O F. The schedule is optimal because the finishing time is less than the critical time. O G. The schedule is optimal because the finishing time is less than the average time. OH. The schedule is not optimal because the finishing time is less than the critical time. OI. The…arrow_forwardQUESTION 5 (SCHEDULING: CYCLICAL SCHEDULING) 15.26 Daniel's Barber Shop at Newark Airport is open 7 days a week but has fluctuating demand. Daniel Ball is inter- ested in treating his barbers as well as he can with steady work and preferably 5 days of work with two consecutive days off. His analysis of his staffing needs resulted in the following plan. Schedule Daniel's staff with the minimum number of barbers. DAY MON. TUE. WED. THU. FRI. SAT. SUN. 6 5 5 5 6 4 3 Barbers neededarrow_forward
- Allocate the tasks to workstations taking into consideration the precedence requirements and using the LOT rule to break ties between feasible tasks.arrow_forwardQuestion 3: 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. Part B: Use Excel Solver to solve the problem (provide exact values for all variables and the optimal objective function).arrow_forwardQuestion 4 Sunny 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 (1) cutting and sewing and (2) delivery of each of the suits. Suit 1 2 3 Cut and sew 4 7 6 Deliver 2 7 5 Determine a sequence that will minimize the total completion time for these jobs. Determine the efficiency of the sequences.arrow_forward
- Question: Pistons for automotive engines can be formed either by casting or forging technique. Traditional cast pistons are considered good enough by most engine tuners and builders when it comes to standard setups. They suffer no significant drawback in terms of compression and service life. Performance enthusiasts and custom engine builders prefer the use of forged pistons because they are more durable and easily customised to any configuration, which is essential for engine tuning. Cast pistons are made with the use of large, specialised equipment made up of a mould where the molten aluminium alloy is poured to create the piston shape. Forged pistons employ a single-cast billet of the alloy which is stamped into the required shape using a die. The shape of the die determines the size and shape of the piston. The productivity rates for both methods are different. How do i calculate this?: In this Question, we assume that one unit piston weighs 1.54kg. To calculate the cost per part…arrow_forwardQuestion Consider the following transactions occurring during a given fortnight. Remi's wage for his casual job is $600, paid on his bank transaction account (transaction 1); his scholarship allowance for studying is $150, paid on his bank transaction account (transaction 2); he pays a rent of $250 through a bank account transfer (transaction 3); the coupons on his portfolio of bonds pays $70 on his transaction account (transaction 4); he receives $350 in his transaction account for selling shares he had bought at $300 (transaction 5); he buys a TV worth $920 with his debit card (transaction 6). Draw Remi's balance sheet and represent how the six transactions above have affected it. Use one single balance sheet, indicate the value of the variations (sign followed by a number) and use only one name for each item [example: equity name appears only once even if several transactions are under equity] No explanations are required. How much of the funding of the TV comes from…arrow_forwardQuestion: B) Identify The Economic Order Quanitity And Consider The Implications For Making An Error In Calculating Economic Order Quanitity. This problem has been solved! See the answer b) Identify the economic order quanitity and consider the implications for making an error in calculating economic order quanitity.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.