Sequencing problems can be classified as follows-
Solutions of these sequencing problems depend on a number of factors like-
With every increase in the number of machines (m) and the number of tasks (n), these sequencing problems get tougher. In reality, no most advantageous solutions exist in real for sequencing problems having larger ‘m’ and ‘n’. Thus, for effective scheduling problems, it is simulation technique which proves to be the most efficient solution.
Links of Previous Main Topic:-
Links of Next Finance Topics:-