Abstract
In this paper, we consider the classical scheduling problem on parallel machines with capacity constraints. We are given m identical machines, where each machine k can process up to \(c_k\) jobs. The goal is to assign the \(n\le \sum _{k=1}^{m}c_k\) independent jobs on the machines subject to the capacity constraints such that the makespan is minimized. This problem is a generalization of the c-partition problem where \(c_k=c\) for each machine. The c-partition problem is strongly NP-hard for \(c\ge 3\) and the best known approximation algorithm of which has a performance ratio of 4 / 3 due to Babel et al. [2]. For the general problem where machines could have different capacities, the best known result is a 1.5-approximation algorithm with running time \(O(n\log n+m^2n)\) [14]. In this paper, we improve the previous result substantially by establishing an efficient polynomial time approximation scheme (EPTAS). The key idea is to establish a non-standard ILP (Integer Linear Programming) formulation for the scheduling problem, where a set of crucial constraints (called proportional constraints) is introduced. Such constraints, along with a greedy rounding technique, allow us to derive an integer solution from a relaxed fractional one without violating constraints.
G. Zhang—Research supported in part by NSFC (11271325).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1, 55–66 (1998)
Babel, L., Kellerer, H., Kotov, V.: The \(k\)-partitioning problem. Math. Methods Oper. Res. 47, 59–82 (1998)
Barna, S., Aravind, S.: A new approximation technique for resource-allocation problems. In: Proceedings of the 1st Annual Symposium on Innovations in Computer Science, pp. 342–357 (2010)
Bruglieri, M., Ehrgott, M., Hamacher, H.W., Maffioli, F.: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discret. Appl. Math. 154(9), 1344–1357 (2006)
Chen, L., Jansen, K., Zhang, G.C.: On the optimality of approximation schemes for the classical scheduling problem. In: Proceedings of SODA 2014, pp. 657–668 (2014)
Dell’Amico, M., Lori, M., Martello, S., Monaci, M.: Lower bounds and heuristic algorithms for the \(k_i\)-partitioning problem. Eur. J. Oper. Res. 171, 725–742 (2004)
Eisenbrand, F., Shmonin, G.: Caratheodory bounds for integer cones. Oper. Res. Lett. 34, 564–568 (2006)
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)
Jansen, K.: An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables. SIAM J. Discret. Math. 24, 457–485 (2010)
Jansen, K., Robenek, C.: Scheduling jobs on identical and uniform processors revisited. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 109–122. Springer, Heidelberg (2012). doi:10.1007/978-3-642-29116-6_10
Jansen, K., Klein, K., Verschae, J.: Closing the gap for makespan scheduling via sparsification techniques. In: Proceedings of ICALP, pp. 72:1–72:13 (2016)
Kannan, R.: Minkowski’s convex body theorem and integer programming. Math. Oper. Res. 12, 415–440 (1987)
Kellerer, H., Kotov, V.: A 3/2-approximation algorithm for \(k_i\)-partitioning. Oper. Res. Lett. 39, 359–362 (2011)
Kellerer, H., Kotov, V.: A 7/6-approximation algorithm for 3-partitioning and its application to multiprocessor scheduling. Inf. Syst. Oper. Res. 37, 48–56 (1999)
Kellerer, H., Woeginger, G.: A tight bound for 3-partitioning. Discret. Appl. Math. 45, 249–259 (1993)
Magazine, M.J., Ball, M.O.: Sequencing of insertions in printed circuit board assembly. Oper. Res. 36, 192–201 (1988)
Rushmeier, R.A., Hoffman, K.L., Padberg, M.: Recent advances in exact optimization of airline scheduling problems. Technical report, George Mason University (1995)
Woeginger, G.: A comment on scheduling two parallel machines with capacity constraints. Discret. Optim. 2, 269–272 (2005)
Zhang, C., Wang, G., Liu, X., Liu, J.: Approximating scheduling machines with capacity constraints. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 283–292. Springer, Heidelberg (2009). doi:10.1007/978-3-642-02270-8_29
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Chen, L., Jansen, K., Luo, W., Zhang, G. (2016). An Efficient PTAS for Parallel Machine Scheduling with Capacity Constraints. In: Chan, TH., Li, M., Wang, L. (eds) Combinatorial Optimization and Applications. COCOA 2016. Lecture Notes in Computer Science(), vol 10043. Springer, Cham. https://doi.org/10.1007/978-3-319-48749-6_44
Download citation
DOI: https://doi.org/10.1007/978-3-319-48749-6_44
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-48748-9
Online ISBN: 978-3-319-48749-6
eBook Packages: Computer ScienceComputer Science (R0)