Unrelated parallel machine scheduling with resource dependent processing times
AbstractWe consider machine scheduling problems where jobs have to be processed on unrelated parallel machines in order to minimize the schedule makespan. The processing time of any job is dependent on the usage of a scarce resource that can be distributed over the jobs in process. The more of that resource is allocated to a job, the smaller its processing time. This model is a natural variant of a generalized assignment problem studied previously by Shmoys and Tardos, the main di®erence lying in the fact that we assume that the resource is renewable, and not a total budget constraint. Using linear programming based rounding techniques, combined with a simple greedy algorithm, we derive the ¯rst constant-factor approximation algorithm for this problem. Our approach can be adapted to yield an approximation algorithm for the problem with dedicated machines, too. Moreover, we prove a non-approximability result for the problem with dedicated machines, and we derive a lower bound for the employed analysis.
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 033.
Date of creation: 2004
Date of revision:
Contact details of provider:
Web page: http://www.maastrichtuniversity.nl/web/UMPublications.htm
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.
- Iida, Hiroshi, 2008. "Partition のある風景," ãã¸ãã¹åµé ã»ã³ã¿ã¼ãã£ã¹ã«ãã·ã§ã³ã»ãã¼ãã¼ (Discussion papers of the Center for Business Creation) 10252/918, Otaru University of Commerce.
- Grigoriev,Alexander & Uetz,Marc, 2005. "Scheduling Parallel Jobs with Linear Speedup," Research Memoranda 014, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Charles Bollen).
If references are entirely missing, you can add them using this form.