Abstract
In the Scheduling Machines with Capacity Constraints problem, we are given k identical machines, each of which can process at most m i jobs. \(M \leq \sum_{i = 1}^{k}{m_i}\) jobs are also given, job j has a non-negative processing time length t j ≥0. The task is to find a schedule such that the makespan is minimized and the capacity constraints are met. In this paper, we present a 3-approximation algorithm using an extension of Iterative Rounding Method introduced by Jain [4]. To the best of the authors’ knowledge, this is the first attempt to apply Iterative Rounding Method to scheduling problem with capacity constraints.
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
Angel, E., Bampis, E., Kononov, A.: A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 194–205. Springer, Heidelberg (2001)
Gairing, M., Monien, B., Woclaw, A.: A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor. Comput. Sci. 380(1-2), 87–99 (2007)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144–162 (1987)
Jain, K.: A factor 2 approximation algorithm for the generalized Steiner network problem. Combinatorica 21, 39–60 (2001)
Khachiyan, L.G.: A polynomial algorithm for linear programming. Doklady Akademiia Nauk USSR 244, 1093–1096 (1979); A translation appears in: Soviet Mathematics Doklady 20, 191–194, (1979) (in Russian)
Lenstra, J.K., Shmoys, D.B., Tardos, É.: Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46, 259–271 (1990)
Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: The Thirty-Ninth Annual ACM Symposium on Theory of Computing, San Diego, California, USA, pp. 661–670 (2007)
Tsai, L.H.: Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling. SIAM Journal on Computing 21, 59–94 (1992)
Woeginger, G.J.: A comment on scheduling two parallel machines with capacity constraints. Discrete Optimization 2(3), 269–272 (2005)
Yang, H., Ye, Y., Zhang, J.: An approximation algorithm for scheduling two parallel machines with capacity constraints. Discrete Applied Mathematics 130(3), 449–467 (2003)
Zhang, J., Ye, Y.: On the Budgeted MAX-CUT problem and its Application to the Capacitated Two-Parallel Machine Scheduling. Working Paper, Department of Management Sciences, The University of Iowa (2001)
Etschmaier, M.M., Mathaisel, D.F.X.: Airline Scheduling: An Overview. Transportation Science 19(2), 127–138 (1985)
Rushmeier, R.A., Hoffman, K.L., Padberg, M.: Recent Advances in Exact Optimization of Airline Scheduling Problems. Technical Report, George Mason University (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, C., Wang, G., Liu, X., Liu, J. (2009). Approximating Scheduling Machines with Capacity Constraints. In: Deng, X., Hopcroft, J.E., Xue, J. (eds) Frontiers in Algorithmics. FAW 2009. Lecture Notes in Computer Science, vol 5598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02270-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-02270-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02269-2
Online ISBN: 978-3-642-02270-8
eBook Packages: Computer ScienceComputer Science (R0)