Convex resource allocation for minimizing the makespan in a single machine with job release dates

Authors:
Moshe Kaspi;Dvir Shabtay
Affiliations:
Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel;Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel
Venue:
Computers and Operations Research
Year:
2004

Citing 2
Cited 5

Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases, and extensions

Mathematics of Operations Research
Bicriterion Single Machine Scheduling with Resource Dependent Processing Times

SIAM Journal on Optimization

Tabu-search for single machine scheduling with controllable processing times

Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Single-machine group scheduling with resource allocation and learning effect

Computers and Industrial Engineering
Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time

Computers and Operations Research
Parallel machine scheduling problem to minimize the makespan with resource dependent processing times

Applied Soft Computing
Single-machine due-window assignment and scheduling with resource allocation, aging effect, and a deteriorating rate-modifying activity

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of scheduling jobs on a single machine where job-processing times are controllable through the allocation of a common limited resource. The release dates are known and the job-processing time is described by a convex decreasing resource consumption function. Our objective is to simultaneously determine the optimal job permutation and the resource allocation, such that the maximal completion time is minimized. We provide an O(n) time optimization algorithm for the case of identical job release dates, and an O(n2) time optimization algorithm for the case of non-identical job release dates.