To search, Click below search items. |
| All Published Papers Search Service |
|
|
|
Title |
A Decomposition Method for Single-Machine Scheduling With Dynamic Arrivals |
|
Author |
Pei-Chann Chang, Shih-Hsin Chen |
| Citation |
Vol. 6 No. 3 pp. 115-121 |
|
Abstract |
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. |
|
Keywords |
|
|
URL |
