The focus of this paper is to analyze unrelated parallel-machine resource allocation scheduling problem with learning effect and deteriorating jobs. The goal is to find the optimal sequence of jobs and the optimal resource allocation separately for minimizing the cost function including the total load, the total completion time, the total absolute deviation of completion time and the total resource cost. We show that the problem is polynomial time solvable if the number of machines is a given constant.
['Yuan-Yuan Lu', 'Jian Jin', 'Ping Ji', 'Ji-Bo Wang']
Resource-dependent scheduling with deteriorating jobs and learning effects on unrelated parallel machine