Research On M*n Different Ordinal Scheduling Algorithm

The production scheduling problem is very important in the domain of automatic management, and m*n Different Ordinal Scheduling Problem is a practical Production Scheduling Problem. And m*n Different Ordinal Scheduling Algorithm is one of the important problem of scheduling theory, which can not only promote the study of scheduling theory, but also make the production plans of enterprise reasonable.M*n Different Ordinal Scheduling Problem is a class of large combinatorial optimum problem with sequence and resources constraints, which is a classical NP-hard. Nonstandard m*n Different Ordinal Scheduling Problem slacks the resources constraints, and gets larger search space. The fact that it is impossible to find the global optimum in polynomial complexity has been proved. In this paper, through the analysis and study of m*n Different Ordinal Scheduling Problem, m*n Different Ordinal Scheduling Algorithm Based on Assigned Function and Nonstandard m*n Different Ordinal Scheduling Algorithm are proposed. This algorithm adapts the engineering practice, and it can find the better solution in polynomial complexity. The main idea of this paper is described as follows.First, the author briefly introduces the studying level of Scheduling Problem and the advantage of m*n Different Ordinal Scheduling Algorithm Based on Assigned Function and Nonstandard m*n Different Ordinal Scheduling Algorithm.Second, the detailed description of m*n Different Ordinal Scheduling Algorithm Based on Assigned Function and Nonstandard m*n Different Ordinal Scheduling Algorithm are presented, including the description of m*n Different Ordinal Scheduling Problem, cost function, detailed steps of the algorithm and...