期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2006
卷号：6
期号：3A
页码：115-121
出版社：International Journal of Computer Science and Network Security
摘要：This research develops a new decomposition method for single machine scheduling problem with dynamic arrivals in minimizing the total weighted completion times. We investigated the two decomposition methods proposed by earlier researchers. Different prospects of the approaches are analyzed. We proofed that the new decomposition method is feasible and can find the optimal solution for the original problems by combining the solutions from each subsets. This new method use the WSPT schedule as a decomposition procedure instead of a B&B schedule by other researcher, thus the total computational time is greatly reduced and the algorithm is much easier to be implemented. A branch and bound procedure using the decomposition procedure is developed to further test the efficiency of different decomposition approaches. The experimental results show that the new approach is much more efficient when compared with other decomposition methods.
