New Models of Parallel Machine Weighted Set Order Problem
Abstract：From the practical application of the parallel machine scheduling problem with complete Order the largest number, the amount of uncertainty - uncertain processing time is introduced and three uncertainty models of the problem are established in the article. A numerical example is given and the model is solved by the use of Hybrid Intelligent Algorithm. The result shows that the model is reasonable and the algorithm is effective.
Keywords：Uncertainty Theorycomplete ordersuncertain measureparallel machine
Publication Date：2011-01-01
Online Publishing Date：2026-08-28(First online date of this platform, not the publication date of the document)
Pages：5( 41-45 )