Principles of operations management 9th by heizer and render module c

32 158 0
Principles of operations management 9th by heizer and render module c

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

Thông tin tài liệu

C MODULE Transportation Models PowerPoint presentation to accompany Heizer and Render Operations Management, Eleventh Edition Principles of Operations Management, Ninth Edition PowerPoint slides by Jeff Heyl © 2014 © 2014 Pearson Pearson Education, Education, Inc.Inc MC - Outline ► ► ► ► Transportation Modeling Developing an Initial Solution The Stepping-Stone Method Special Issues in Modeling © 2014 Pearson Education, Inc MC - Learning Objectives When you complete this chapter you should be able to: Develop an initial solution to a transportation models with the northwestcorner and intuitive lowest-cost methods Solve a problem with the stepping-stone method Balance a transportation problem Deal with a problem that has degeneracy © 2014 Pearson Education, Inc MC - Transportation Modeling ▶ An interactive procedure that finds the least costly means of moving products from a series of sources to a series of destinations ▶ Can be used to help resolve distribution and location decisions © 2014 Pearson Education, Inc MC - Transportation Modeling ▶ A special class of linear programming ▶ Need to know The origin points and the capacity or supply per period at each The destination points and the demand per period at each The cost of shipping one unit from each origin to each destination © 2014 Pearson Education, Inc MC - Transportation Problem TABLE C.1 Transportation Costs per Bathtub for Arizona Plumbing TO FROM ALBUQUERQUE BOSTON CLEVELAND Des Moines $5 $4 $3 Evansville $8 $4 $3 Fort Lauderdale $9 $7 $5 © 2014 Pearson Education, Inc MC - Transportation Problem Des Moines (100 units capacity) Albuquerque (300 units required) Figure C.1 © 2014 Pearson Education, Inc Cleveland (200 units required) Boston (200 units required) Evansville (300 units capacity) Fort Lauderdale (300 units capacity) MC - Transportation Matrix Figure C.2 To From Albuquerque $5 Des Moines Evansville Fort Lauderdale Warehouse requirement Boston $4 $3 $8 $4 $3 $9 $7 $5 300 Cost of shipping unit from Fort Lauderdale factory to Boston warehouse © 2014 Pearson Education, Inc Cleveland 200 200 Factory capacity 100 300 300 Des Moines capacity constraint Cell representing a possible source-todestination shipping assignment (Evansville to Cleveland) 700 Cleveland warehouse demand Total demand and total supply MC - Northwest-Corner Rule ▶ Start in the upper left-hand cell (or northwest corner) of the table and allocate units to shipping routes as follows: Exhaust the supply (factory capacity) of each row before moving down to the next row Exhaust the (warehouse) requirements of each column before moving to the next column Check to ensure that all supplies and demands are met © 2014 Pearson Education, Inc MC - Northwest-Corner Rule ▶ Assign 100 tubs from Des Moines to Albuquerque (exhausting Des Moines’s supply) ► Assign 200 tubs from Evansville to Albuquerque (exhausting Albuquerque’s demand) ► Assign 100 tubs from Evansville to Boston (exhausting Evansville’s supply) ► Assign 100 tubs from Fort Lauderdale to Boston (exhausting Boston’s demand) ► Assign 200 tubs from Fort Lauderdale to Cleveland (exhausting Cleveland’s demand and Fort Lauderdale’s supply) © 2014 Pearson Education, Inc MC - 10 Intuitive Lowest-Cost Method To From (A) Albuquerque (D) Des Moines (E) Evansville (F) Fort Lauderdale Warehouse requirement 300 300 (B) Boston $5 $4 $8 $4 200 $9 (C) Cleveland 100 100 $7 200 $3 $3 $5 200 Factory capacity 100 300 300 700 Total Cost = $3(100) + $3(100) + $4(200) + $9(300) = $4,100 Figure C.4 © 2014 Pearson Education, Inc MC - 18 Intuitive Lowest-Cost Method To From (A) Albuquerque (B) Boston $5 This isMoines a feasible solution, (D) Des and an improvement over $8 the(E)previous solution, but not200 Evansville necessarily the lowest cost alternative $9 (F) Fort Lauderdale Warehouse requirement 300 300 200 $4 $4 (C) Cleveland 100 100 $7 $3 $3 $5 200 Factory capacity 100 300 300 700 Total Cost = $3(100) + $3(100) + $4(200) + $9(300) = $4,100 Figure C.4 © 2014 Pearson Education, Inc MC - 19 Stepping-Stone Method Select any unused square to evaluate Beginning at this square, trace a closed path back to the original square via squares that are currently being used Beginning with a plus (+) sign at the unused corner, place alternate minus and plus signs at each corner of the path just traced © 2014 Pearson Education, Inc MC - 20 Stepping-Stone Method Calculate an improvement index by first adding the unit-cost figures found in each square containing a plus sign and subtracting the unit costs in each square containing a minus sign Repeat steps though until you have calculated an improvement index for all unused squares If all indices are ≥ 0, you have reached an optimal solution © 2014 Pearson Education, Inc MC - 21 Stepping-Stone Method To From (A) Albuquerque (D) Des Moines 100 (E) Evansville 200 – $8 + $9 (F) Fort Lauderdale Warehouse requirement $5 300 (B) Boston + 100 – 100 200 (C) Cleveland $4 $3 $4 $3 $7 $5 200 200 99 201 Factory capacity Des MoinesBoston index 100 300 = $4 – $5 + $8 – $4 300 = +$3 700 $5 100 – + 200 $4 + $8 99 – $4 100 Figure C.5 © 2014 Pearson Education, Inc MC - 22 Stepping-Stone Method To From (D) Des Moines (E) Evansville (A) Albuquerque 100 200 $4 Start + $3 $8 $4 $3 + $9 300 (C) Cleveland $5 – (F) Fort Lauderdale Warehouse requirement (B) Boston 100 – 100 + 200 $7 200 – $5 200 Factory capacity 100 300 300 700 Des Moines-Cleveland index Figure C.6 © 2014 Pearson Education, Inc = $3 – $5 + $8 – $4 + $7 – $5 = +$4 MC - 23 Stepping-Stone Method To From 100 (D) Des Moines (E) Evansville 200 (B) Boston (C) Cleveland $5 $4 $3 $8 $4 $3 100 Evansville-Cleveland index (F) Fort Lauderdale Warehouse requirement (A) Albuquerque $9 $5 = $3$7– $4 100 200+ $7 Factory capacity 100 300 – $5 300= +$1 (Closed path = EC – EB + FB – FC) 300 200 200 700 Fort Lauderdale-Albuquerque index = $9 – $7 + $4 – $8 = –$2 (Closed path = FA – FB + EB – EA) © 2014 Pearson Education, Inc MC - 24 Stepping-Stone Method If an improvement is possible, choose the route (unused square) with the largest negative improvement index On the closed path for that route, select the smallest number found in the squares containing minus signs Add this number to all squares on the closed path with plus signs and subtract it from all squares with a minus sign © 2014 Pearson Education, Inc MC - 25 Stepping-Stone Method To From (D) Des Moines (E) Evansville (F) Fort Lauderdale Warehouse requirement (A) Albuquerque 100 200 – (C) Cleveland $5 $4 $3 $8 $4 $3 $9 + (B) Boston 100 + 100 – $7 200 $5 Factory capacity 100 300 300 300 Add 100 200units on 200route FA 700 Subtract 100 from routes FB Add 100 to route EB Subtract 100 from route EA Figure C.7 © 2014 Pearson Education, Inc MC - 26 Stepping-Stone Method To From (D) Des Moines (A) Albuquerque 100 (E) Evansville 100 (F) Fort Lauderdale 100 Warehouse requirement 300 (B) Boston (C) Cleveland $5 $4 $3 $8 $4 $3 200 $9 $7 200 200 200 $5 Factory capacity 100 300 300 700 Total Cost = $5(100) + $8(100) + $4(200) + $9(100) + $5(200) = $4,000 © 2014 Pearson Education, Inc Figure C.8 MC - 27 Special Issues in Modeling ▶ Demand not equal to supply ▶ Called an unbalanced problem ▶ Common situation in the real world ▶ Resolved by introducing dummy sources or dummy destinations as necessary with cost coefficients of zero © 2014 Pearson Education, Inc MC - 28 Special Issues in Modeling Total Cost = 250($5) + 50($8) + 200($4) + 50($3) + 150($5) + 150(0) = $3,350 To From (D) Des Moines (E) Evansville (A) Albuquerque 250 50 © 2014 Pearson Education, Inc 300 (C) Cleveland Dummy $5 $4 $3 $8 $4 $3 $5 200 $9 (F) Fort Lauderdale Warehouse requirement (B) Boston $7 200 50 150 200 150 150 Factory capacity 250 300 300 850 New Des Moines capacity MC - 29 Special Issues in Modeling ▶ Degeneracy ▶ To use the stepping-stone methodology, the number of occupied squares in any solution must be equal to the number of rows in the table plus the number of columns minus ▶ If a solution does not satisfy this rule it is called degenerate © 2014 Pearson Education, Inc MC - 30 Special Issues in Modeling To From Customer Customer Customer $8 $2 $6 $9 $9 Warehouse 100 Warehouse $10 $7 Warehouse Customer demand 100 100 $10 100 20 80 100 $7 Warehouse supply 100 120 80 300 Initial solution is degenerate Place a zero quantity in an unused square and proceed computing improvement indices © 2014 Pearson Education, Inc MC - 31 All rights reserved No part of this publication may be reproduced, stored in a retrieval system, or transmitted, in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the publisher Printed in the United States of America © 2014 Pearson Education, Inc MC - 32 ... 200 (C) Cleveland 100 100 $3 $3 $5 200 Factory capacity 100 300 300 700 Second, $3 is again the lowest cost cell so ship 100 units from Evansville to Cleveland and cross off column C as Cleveland... $5 300 Cost of shipping unit from Fort Lauderdale factory to Boston warehouse © 2014 Pearson Education, Inc Cleveland 200 200 Factory capacity 100 300 300 Des Moines capacity constraint Cell representing... Boston 300 (C) Cleveland 100 100 $7 200 $3 $3 $5 200 Factory capacity 100 300 300 700 Third, $4 is the lowest cost cell so ship 200 units from Evansville to Boston and cross off column B and row

Ngày đăng: 10/01/2018, 15:15

Mục lục

  • Slide 1

  • Outline

  • Learning Objectives

  • Transportation Modeling

  • Slide 5

  • Transportation Problem

  • Slide 7

  • Transportation Matrix

  • Northwest-Corner Rule

  • Slide 10

  • Slide 11

  • Slide 12

  • Intuitive Lowest-Cost Method

  • Slide 14

  • Slide 15

  • Slide 16

  • Slide 17

  • Slide 18

  • Slide 19

  • Stepping-Stone Method

Tài liệu cùng người dùng

Tài liệu liên quan