Machine Scheduling with Resource Dependent Processing Times
AbstractWe consider several parallel machine scheduling settings with the objective to minimize the schedule makespan. The most general of these settings is unrelated parallel machine scheduling. We assume that, in addition to its machine dependence, the processing time of any job is dependent on the usage of a scarce renewable resource. A given amount of that resource, e.g. workers, can be distributed over the jobs in process at any time, and the more of that resource is allocated to a job, the smaller is its processing time. This model generalizes classical machine scheduling problems, adding a time-resource tradeoff. It is also a natural variant of a generalized assignment problem studied previously by Shmoys and Tardos. On the basis of integer programming formulations for relaxations of the respective problems, we use LP rounding techniques to allocate resources to jobs, and to assign jobs to machines. Combined with Graham''s list scheduling, we thus prove the existence of constant factor approximation algorithms. Our performance guarantee is 6.83 for the most general case of unrelated parallel machine scheduling. We improve this bound for two special cases, namely to 5.83 whenever the jobs are assigned to machines beforehand, and to (5+e), e>0, whenever the processing times do not depend on the machine. Moreover, we discuss tightness of the relaxations, and derive inapproximability results.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization in its series Research Memoranda with number 049.
Date of creation: 2005
Date of revision:
Contact details of provider:
Web page: http://www.maastrichtuniversity.nl/web/UMPublications.htm
operations research and management science;
Other versions of this item:
- Grigoriev, Alexander & Sviridenko, Maxim & Uetz, Marc, 2007. "Machine scheduling with resource dependent processing times," Open Access publications from Maastricht University urn:nbn:nl:ui:27-15695, Maastricht University.
- Grigoriev, Alexander & Sviridenko, Maxim & Uetz, Marc, 2006. "Machine scheduling with resource dependent processing times," Open Access publications from Maastricht University urn:nbn:nl:ui:27-12047, Maastricht University.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kellerer, H. & Strusevich, V. A., 2003. "Scheduling parallel dedicated machines under a single non-shared resource," European Journal of Operational Research, Elsevier, vol. 147(2), pages 345-364, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Charles Bollen).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.