TRANSPORTATION PROBLEM Formulation Optimal solution, unbalanced transportation – – problem Assignment problem Formulation Optimal solution - Variants of Assignment –Degeneracy. – – Problem-Traveling Salesman problem. Introduction Flow sequencing n jobs through two machines n jobs SEQUENCING – – –Shop – – through machines Job shop sequencing two jobs through machines. – – ‘m’ UNIT III – REPLACEMENT : Introduction Replacement of items that deteriorate with time when money value – – is not considered and considered Replacement of items that fail completely, group replacement. – UNIT IV – THEORY OF GAMES : Introduction Minimax (maximin) Criterion and optimal strategy Solution – – – of games with saddle points Rectangular games without saddle points 2 X 2 games dominance – – – principle– m X 2 & 2 X n games -graphical method. UNIT V – WAITING : Introduction Single Channel Poisson arrivals exponential service times with – – – – finite queue length and non finite queue length models– Multichannel Poisson arrivals exponential – – service times with finite queue length and queue length and non finite queue length models. UNIT VI – Introduction Single item Deterministic models Purchase inventory models with INVENTORY : – – – one price break and multiple price breaks shortages are not allowed Stochastic models demand may – – – be discrete variable or continuous variable Instantaneous production. Instantaneous demand and – continuous demand and no set up cost. UNIT VII – DYNAMIC PROGRAMMING : Introduction Bellman’s Principle of optimality Applications of – – dynamic programming- capital budgeting problem shortest path problem linear programming – – problem. UNIT VIII –
TRANSPORTATION PROBLEM – Formulation – Optimal solution, unbalanced transportation problem –Degeneracy. Assignment problem – Formulation – Optimal solution - Variants of Assignment Problem-Traveling Salesman problem. SEQUENCING – Introduction – Flow –Shop sequencing – n jobs through two machines – n jobs through machines – Job shop sequencing – two jobs through ‘m’ machines. UNIT – III REPLACEMENT : Introduction – Replacement of items that deteriorate with time – when money value is not considered and considered – Replacement of items that fail completely, group replacement. UNIT – IV THEORY OF GAMES : Introduction – Minimax (maximin) – Criterion and optimal strategy – Solution of games with saddle points – Rectangular games without saddle points – 2 X 2 games – dominance principle– m X 2 & 2 X n games -graphical method. UNIT – V WAITING : Introduction – Single Channel – Poisson arrivals – exponential service times – with finite queue length and non finite queue length models– Multichannel – Poisson arrivals – exponential service times with finite queue length and queue length and non finite queue length models. UNIT – VI INVENTORY : Introduction – Single item – Deterministic models – Purchase inventory models with one price break and multiple price breaks – shortages are not allowed – Stochastic models – demand may be discrete variable or continuous variable – Instantaneous production. Instantaneous demand and continuous demand and no set up cost. UNIT – VII DYNAMIC PROGRAMMING : Introduction – Bellman’s Principle of optimality – Applications of dynamic programming- capital budgeting problem – shortest path problem – linear programming problem. UNIT – VIII