Due-date Assignment and Single-machine Resource Allocation Scheduling with Deteriorating Jobs
This paper investigated due-date assignment and single-machine resource allocation scheduling problems with position-dependent deteriorating jobs. Two generally resource consumption functions, the linear resource consumption function and the convex resource consumption function, were explored. The objectives were to determining the optimal due-date, the optimal resource allocation, and the optimal job sequence so that the cost function associated with the jobs due-date and the processing time reduction as well as job absolute value in lateness will be minimized. We showed that the proposed problems are polynomial time solvable.
Chou-Jung Hsu
Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 54243, Taiwan, R.O.C.
国际会议
长春
英文
787-791
2011-09-03(万方平台首次上网日期,不代表论文的发表时间)