- Departments / Centres
Single Commodity Static flows - the basic maximum flow problem - Variations of the maximum flow problem - Flows in graphs with gains – Multi-commodity flows.
Network simplex method - Network approach to transportation problems - critical path method - Resource leveling - Time/cost trade off – Compression and decompression - PERT network - probabilistic aspect of PERT - practical problems - Formulation and solution.
Equipment replacement policies in deterministic and Stochastic cases - replacement models for unbounded horizons and uncertain cost-replacement in anticipation of failure -group replacement policy.
Basic concepts - Failure density - Failure rate analysis-hazard functions - hazard models - Normal, Exponential, Poisson, Hyper - exponential, Erlang, gamma and Weibull distributions – Reliability of systems - Series parallel, K-out-of-n-system- perfect and imperfect switches.
Simulation and Reliability Predictions - Maintenance- preventive and corrective – Maintainability Equation – Availability - Maintainability trade-off - Reliability improvement and allocation.
1. Kennington. J and Helgason R,"Algorithms for Network Programming", 1st Edition 1981, John Wiley.
2. Ford, L.R & Fulkerson, D.R, "Flows in Networks", Princeton University Press.