ADMS 3351 Lecture Notes - Statistical Process Control, Net Present Value, Bread Machine
16 Jul 2013
School
Department
Course
Professor
Document Summary
Chapter 3: a-c-d-e-g, also shown in the network above as the bold path, 26 weeks, 6+7+2+4+7, 6 weeks, 15-9, a-b-d-e-h, also shown in the network above as the bold path. C (7)g (7)f (3)e (4)d (2)b (3)69613131515191915182619261916191513136151215a (6)0606c (3)g (2)h (3)d (2)e (5)b (4)151471257912151115121012712774515 a (1)0101f (2)79108c, 3 weeks; f, 1 week; and g, 1 week. Note that g has both d and f as immediate predecessors. Shorten c, d, and g one week each. C and d are on parallel critical paths, reducing them will only reduce project completion time by 1 week: a-c-f-g-i; and a-d-f-g-i. Project completion time is reduced from 18 to 16 weeks. C (4)g (2)h (3)d (4)e (6)b (2)353751137137101515151312715973973 a (3)0303f (6)713137i (3)151818154. 1-3-6-9-10: the most logical option would be to cut activity 3 by 3 weeks, and then reduce activity 6 or 9 by one week. This is the lowest cost option, and does not create an additional critical path.
