Campbell's position-order-weight algorithms

To sequence the l tasks in the m serial processors is a NP-hard problem,in which lies no valid analytic solution.And the scheduling programs will go up sharply when there's a bit increase in tasks,so that it's difficult to acquire the best idea.Hence,it's necessary to seek a new simple algorithm.After analyzing some basic methods in this study,we put forward the Campbell's position-order weight algorithms.According to Johnson's rule and the positions of simulating sub-schedules in the simulating array,we can obtain the subsequences to Campbell's in the new way.Then,we schedule them by the method of order-weight algorithms in order to achieve the attainment of the shortest working span.Finally,an example is given.And the result show that the position-order-weight algorithms of Campbell's is simple and valid.