Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource
 

Summary: LP Rounding and an Almost Harmonic
Algorithm for Scheduling with Resource
Dependent Processing Times
Alexander Grigoriev1
, Maxim Sviridenko2
, and Marc Uetz1
1
Maastricht University, Quantitative Economics, P.O.Box 616, 6200 MD Maastricht,
The Netherlands. Email: {a.grigoriev, m.uetz}@ke.unimaas.nl
2
IBM T. J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598,
USA. Email: sviri@us.ibm.com
Abstract We consider a scheduling problem on unrelated parallel ma-
chines with the objective to minimize the makespan. In addition to its
machine dependence, the processing time of any job is dependent on the
usage of a scarce renewable resource, e.g. workers. A given amount of
that resource can be distributed over the jobs in process at any time.
The more of the resource is allocated to a job, the smaller is its process-
ing time. This model generalizes the classical unrelated parallel machine
scheduling problem by adding a time-resource tradeoff. It is also a natu-

  

Source: Al Hanbali, Ahmad - Department of Applied Mathematics, Universiteit Twente

 

Collections: Engineering