An approximation algorithm for identical parallel machine scheduling with resource dependent processing times

Authors:
Hans Kellerer
Affiliations:
Institut für Statistik und Operations Research, Universität Graz, Universitätsstraíe 15, A-8010, Graz, Austria
Venue:
Operations Research Letters
Year:
2008

Citing 2
Cited 2

Machine scheduling with resource dependent processing times

Mathematical Programming: Series A and B
Unrelated parallel machine scheduling with resource dependent processing times

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Parallel machine scheduling with flexible resources

Computers and Industrial Engineering
Scheduling jobs with time-resource tradeoff via nonlinear programming

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a (3.5+@?)-approximation algorithm for a scheduling problem on identical parallel machines with the objective to mimimize the makespan. The processing times depend on the usage of a single renewable resource where at any point of time at most k units from the resource are available.