Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
- First Online:
- Cite this article as:
- Hsu, CJ. & Yang, DL. Optim Lett (2014) 8: 519. doi:10.1007/s11590-012-0594-1
- 232 Downloads
This paper is to analyze unrelated parallel-machine scheduling resource allocation problems with position-dependent deteriorating jobs. Two general resource consumption functions, the linear and convex resource, are investigated. The objectives are to minimize the cost function that includes the weights of total load, total completion time, total absolute deviation of completion time, and total resource cost. Moreover, we try to minimize the cost function that includes the weights of total load, total waiting time, total absolute deviation of waiting time, and total resource cost. Although each job processing time can be compressed through incurring an additional cost, we show that the problems are polynomial time solvable when the number of machines is fixed.