TP AP SP

123456789101112131415
Across
  1. 4. The cells in which assignments are not allowed, such type of problem called………assignment problem
  2. 8. The assignment problem is a special case of the……..problem
  3. 9. If the number of sources is equal to the number of destinations, then assignment problem is called
  4. 11. The time for which a machine remains idle during the total elapsed time is called…….time.
  5. 12. A path which is formed by allowing horizontal and vertical lines and all the corner cells of which are occupied is called a……path.
  6. 13. The transportation problem is one of the subclasses of ……..
  7. 14. The problem is to find a sequence among all possible sequences for processing the jobs so that the total elapsed time for all the jobs will be
  8. 15. Assignment problem is a completely……….form of a transportation problem
Down
  1. 1. One can find the initial basic feasible solution by using ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐?
  2. 2. In assignment problem the units available at each origin and units demanded at each destination are all equal to
  3. 3. Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from O origins and D destinations
  4. 5. Maximization assignment problem converted in to minimization assignment problem by……….all the elements from the highest element of the matrix.
  5. 6. Time required by each job on each machine is called……time
  6. 7. The allocations are said to be in………positions, if it is impossible to form a closed path (loop).
  7. 10. The time between starting the first job and completing the last job is called total……time