| Summary: | 碩士 === 朝陽科技大學 === 工業工程與管理系 === 104 === The total completion time is an important performance criterion for production schedules. Reducing the total completion time can reduce the number of WIP effectively which can then reduce production costs.
This study aims to investigate the identical parallel-machine total completion time scheduling problem with preemption and release times.
This problem is denoted by P_m |pmtn,r_i |∑▒C_i , and is proved to be NP-hard.
In this study, we present a branch-and- bound algorithm in which the linear program for a given job completion sequence from Kravchenko(2009) and the lower bound from Baptiste (2009) are used along with an upper bound designed by the author. A large number of randomly generated problems are used to evaluate the performance of the proposed algorithm.
The upper bound has an average percentage deviation of 0.18%, and it equals to the optimal value for over 80% of the problems. The lower bound has an average percentage deviation of 5.36%. The proposed branch-and- bound algorithm can solve 11x4 problems within a reasonable amount of time.
|
|---|
