Summary: | 碩士 === 國立臺灣科技大學 === 資訊管理系 === 101 === Deteriorating jobs scheduling has received great attention in the past two decades. In many realistic situations, a job processed later needs more time for processing than the same job when it is processed earlier; this phenomenon is known as deteriorating jobs. We consider the case of deteriorating jobs whose processing times are a simple linear increasing function of their starting time. On the other hand, the production efficiency can be increased by grouping jobs with similar processing requirements. This phenomenon is known as the group technology(GT) in the literature. However, there exist only a few result considering scheduling problems with deteriorating jobs and group technology simultaneously.
In this paper, we consider two group scheduling problems of minimizing the makespan with deteriorating jobs. One is a group scheduling problem with deteriorating jobs under GT assumption, and the other is a problem with the same model without GT assumption. We provide a polynomial-time algorithm and a branch-and-bound algorithm to solve the problems respectively.
|