Parallel machine scheduling with a convex resource consumption function

Parallel machine scheduling with a convex resource consumption function

0.00 Avg rating0 Votes
Article ID: iaor20083738
Country: Netherlands
Volume: 173
Issue: 1
Start Page Number: 92
End Page Number: 107
Publication Date: Aug 2006
Journal: European Journal of Operational Research
Authors: ,
Keywords: allocation: resources
Abstract:

We consider some problems of scheduling jobs on identical parallel machines where job-processing times are controllable through the allocation of a nonrenewable common limited resource. The objective is to assign the jobs to the machines, to sequence the jobs on each machine and to allocate the resource so that the makespan or the sum of completion times is minimized. The optimization is done for both preemptive and nonpreemptive jobs. For the makespan problem with nonpreemptive jobs we apply the equivalent load method in order to allocate the resources, and thereby reduce the problem to a combinatorial one. The reduced problem is shown to be NP-hard. If preemptive jobs are allowed, the makespan problem is shown to be solvable in O(n2) time. Some special cases of this problem with precedence constraints are presented and the problem of minimizing the sum of completion times is shown to be solvable in O(n log n) time.

Reviews

Required fields are marked *. Your email address will not be published.