| Summary: | 碩士 === 國立交通大學 === 電機與控制工程學系 === 87 ===
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 belong to the NP-Complete combinatorial problems, for which the development of efficient optimum-producing polynomial algorithm is unlikely. Therefore, practical schedules are commonly generaterd by simple heuristic algorithm or experienced schedulers. The interaction of jobs, as they complete for limited resources, is not visible, and overall shop goal such as on-time delivery of jobs are beyond control. Thus, there is a need for improving the scheduling operation in complex manufacturing environment.
Lagrangian relaxation technique has been used to solve scheduling problems. After obtaining the dual solution, list-scheduling method is applied to produce feasible schedule. However, according to the idea of controlled parameters in suboptimal solution, we realize that using heuristic method to solve schedule problem have some room to improve. Therefore we try to improve list schedule and hope to get a better schedule result.
In this paper we propose the compound incremental cost function method to improve list schedule. Using compound incremental cost function method, we can obtain a better schedule result.
|
|---|
