A single-machine deteriorating job scheduling problem with release times

• Main Authors: Yu-Hsiang Chung, 鐘愉翔
• Other Authors: Chin-Chia Wu
• Format: Others
• Language: zh-TW
• Published: 2007
• Online Access: http://ndltd.ncl.edu.tw/handle/74936576364397622325

碩士 === 逢甲大學 === 統計與精算所 === 95 === This paper investigates a single-machine deteriorating job scheduling problem with job release times where its objective is to minimize the makespan. The problem is known to be NP-hard. Therefore, a branch-and-bound algorithm incorporating with several dominance properties and lower bounds is proposed to derive the optimal solution for the problem. In addition, easy-implemented heuristic algorithms are also provided to obtain the near-optimal solution. The computational experiments indicate that the branch-and-bound algorithm can solve most of the problems within a reasonable amount of time up to 28 jobs, and the heuristic is quite accurate with an average error percentage of less than 0.3%.