摘要
一、评 述 m x n同顺序排列问题的典型解法是佩卓(V.A.Petrov)
This paper deals with a new heuristic method for obtaining a solution to the n-part w-machine scheduling with the objective of minimizing makespan. The basic idea of the method is based on the fact that the makespan is affected not only by the part with the longest processing time, but also by the machine with the biggest load. The evaluatory conclusion shows that the new heuristic method can achieve the equivalent solution to that of CDS method, but its calculation time is much less than that of CDS method. Also, this paper workes out rules for checking the optimal solution and the lower limit of the makespan.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1991年第1期24-29,共6页
Systems Engineering-Theory & Practice
