Single-machine scheduling with convex resource dependent processing times and deteriorating jobs |
| |
Authors: | Xue-Ru Wang Jian-Jun Wang |
| |
Institution: | 1. School of Science, Shenyang Aerospace University, Shenyang 110136, China;2. Faculty of Management and Economics, Dalian University of Technology, Dalian 116024, China;3. College of Business, East Carolina University, Greenville, NC 27858, USA |
| |
Abstract: | In this study, we consider scheduling problems with convex resource dependent processing times and deteriorating jobs, in which the processing time of a job is a function of its starting time and its convex resource allocation. The objective is to find the optimal sequence of jobs and the optimal convex resource allocation separately. This paper focus on the single-machine problems with objectives of minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost, and a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. It shows that the problems remain polynomially solvable under the proposed model. |
| |
Keywords: | Scheduling Single-machine Deteriorating jobs Resource allocation |
本文献已被 ScienceDirect 等数据库收录! |
|