Abstract
We consider a scheduling problem on unrelated parallel machines 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 processing time. This model generalizes the classical unrelated parallel machine scheduling problem by adding a time-resource tradeoff. It is also a natural variant of a generalized assignment problem studied by Shmoys and Tardos. On the basis of an integer linear programming formulation for (a relaxation of) the problem, we adopt a randomized LP rounding technique from Kumar et al. (FOCS 2005) in order to obtain a deterministic, integral LP solution that is close to optimum. We show how this rounding procedure can be used to derive a deterministic 3.75-approximation algorithm for the scheduling problem. This improves upon previous results, namely a deterministic 6.83-approximation, and a randomized 4-approximation. The improvement is due to the better LP rounding and a new scheduling algorithm that can be viewed as a restricted version of the harmonic algorithm for bin packing.
This work was done while the second author was visiting Maastricht University, supported by METEOR, the Maastricht Research School of Economics of Technology and Organizations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, Z.-L.: Simultaneous Job Scheduling and Resource Allocation on Parallel Machines. Annals of Operations Research 129, 135–153 (2004)
Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent Rounding in Bipartite Graphs. In: Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 323–332 (2002)
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287–326 (1979)
Grigoriev, A., Sviridenko, M., Uetz, M.: Unrelated Parallel Machine Scheduling with Resource Dependent Processing Times. In: Jünger, M., Kaibel, V. (eds.) Proceedings 11th Conference on Integer Programming and Combinatorial Optimization. LNCS, vol. 3509, pp. 182–195. Springer, Heidelberg (2005)
Grigoriev, A., Uetz, M.: Scheduling Jobs with Linear Speedup. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 203–215. Springer, Heidelberg (2006)
Jansen, K.: Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. Algorithmica 39, 59–81 (2004)
Jansen, K., Mastrolilli, M.: Approximation schemes for parallel machine scheduling problems with controllable processing times. Computers and Operations Research 31, 1565–1581 (2004)
Kelley, J.E., Walker, M.R.: Critical path planning and scheduling: An introduction. Mauchly Associates, Ambler, PA (1959)
Kellerer, H., Strusevich, V.A.: Scheduling parallel dedicated machines under a single non-shared resource. European Journal of Operational Research 147, 345–364 (2003)
Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation Algorithms for Scheduling on Multiple Machines. In: Proc. 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 254–263 (2005)
Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, Series A 46, 259–271 (1990)
Mounie, G., Rapine, C., Trystram, D.: Efficient Approximation Algorithms for Scheduling Malleable Tasks. In: Proc. 11th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 23–32 (1999)
Shmoys, D.B., Tardos, E.: An approximation algorithm for the generalized assignment problem. Mathematical Programming, Series A 62, 461–474 (1993)
Skutella, M.: Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research 23, 909–929 (1998)
Turek, J., Wolf, J.L., Yu, P.S.: Approximate Algorithms for Scheduling Parallelizable Tasks. In: Proc. 4th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 323–332 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grigoriev, A., Sviridenko, M., Uetz, M. (2006). LP Rounding and an Almost Harmonic Algorithm for Scheduling with Resource Dependent Processing Times. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2006 2006. Lecture Notes in Computer Science, vol 4110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11830924_15
Download citation
DOI: https://doi.org/10.1007/11830924_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38044-3
Online ISBN: 978-3-540-38045-0
eBook Packages: Computer ScienceComputer Science (R0)