A Sectional-Processing Algorithm for Long-Horizon Scheduling Problems

• Main Authors: Huang, Jung Shou, 黃榮壽
• Other Authors: Shin-Yeu Lin
• Format: Others
• Language: zh-TW
• Published: 1998
• Online Access: http://ndltd.ncl.edu.tw/handle/62995093105321722640

碩士 === 國立交通大學 === 電機與控制工程學系 === 86 === Scheduling is one of the most basic but the most difficult problem to be solved in the manufacturing system. The difficulty is that the most scheduling problems belongs to the NP-Complete combinatorial problems, for which the development of efficient optimum-producing polynomial algorithm is unlikely. Therefore, practical schedules are commonly generate by simple heuristic algorithm or experienced schedulers. The interaction of jobs, as they complete for limits resources, is not visible, and overall shop goLagrangian relaxation technique has been used to solved scheduling problems. After obtaining the dual solution, list- scheduling method is applied to produce feasible schedule. We can use this method to obtain better results for small-size scheduling problems, but we may not obtain better result efficiently for the long-horizon scheduling problems. This likely comes from the ineffectiveness of the list-scheduling approach for constructing a feasible schedule and the computation complexity of the dynamic prog The simulation results show that the sectional-processing algorithm can improve results and efficiency for the long-horizon scheduling problems.