Unit-1
Unit-2
- Transportation Problem
- Modi Method (U-V Method)
- Stepping Stone Method
- Degeneracy
- Assignment problem
- Optimal solution
- Variants of
assignment problem travelling salesman problem.
- Shop sequencing – N jobs through two machines
- N jobs through three
machines
- Job shop sequencing
- Two jobs through ‘M’ machines.
- Transportation Problem
- Modi Method (U-V Method)
- Stepping Stone Method
- Degeneracy
- Assignment problem
- Optimal solution
- Variants of assignment problem travelling salesman problem.
- Shop sequencing – N jobs through two machines
- N jobs through three machines
- Job shop sequencing
- Two jobs through ‘M’ machines.
Unit-3
- Replacement of items that deteriorate with time
- When money value is not counted
- When money value is counted
- Replacement of items that fail completely
- Group replacement.
- mini. max
- max. mini
- 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.
No comments:
Post a Comment