No Access
SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
https://doi.org/10.1142/S0217595912500303Cited by:21 (Source: Crossref)
Abstract
We consider single-machine scheduling problem in which the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two goals separately, namely, minimizing a cost function containing makespan, total completion time, total absolute differences in completion times, and total resource cost; minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times, and total resource cost. The problem is modeled as an assignment problem, and thus can be solved in polynomial time. Some extensions of the problem are also shown.
