Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1704793 | Applied Mathematical Modelling | 2012 | 7 Pages |
Abstract
We consider single-machine scheduling problems in which the processing time of a job is a function of 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. We show that the problems remain polynomially solvable under the proposed model.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Cai-Min Wei, Ji-Bo Wang, Ping Ji,