The document discusses solving an assignment problem to minimize crew waiting time for an airline with flights between Delhi and Kolkata. It involves: 1) Calculating waiting times for all flight pairings assuming crews based in Delhi or Kolkata; 2) Developing an opportunity cost matrix from the minimum waiting times; 3) Applying row and column reduction to the matrix; 4) Finding an optimal assignment of 4 flight pairings that minimizes total waiting time of 40.5 hours.