On Minimizing the Makespan When Some Jobs Cannot Be Assigned on the Same Machine
We study the classical scheduling problem of assigning jobs to machines in order to minimize the makespan. It is well-studied and admits an EPTAS on identical machines and a (2-1/m)-approximation algorithm on unrelated machines. In this paper we study a variation in which the input jobs are partitioned into bags and no two jobs from the same bag are allowed to be assigned on the same machine. Such a constraint can easily arise, e.g., due to system stability and redundancy considerations. Unfortunately, as we demonstrate in this paper, the techniques of the above results break down in the presence of these additional constraints.
Our first result is a PTAS for the case of identical machines. It enhances the methods from the known (E)PTASs by a finer classification of the input jobs and careful argumentations why a good schedule exists after enumerating over the large jobs. For unrelated machines, we prove that there can be no (log n)^{1/4-epsilon}-approximation algorithm for the problem for any epsilon > 0, assuming that NP nsubseteq ZPTIME(2^{(log n)^{O(1)}}). This holds even in the restricted assignment setting. However, we identify a special case of the latter in which we can do better: if the same set of machines we give an 8-approximation algorithm. It is based on rounding the LP-relaxation of the problem in phases and adjusting the residual fractional solution after each phase to order to respect the bag constraints.
approximation algorithms
scheduling
makespan minimization
31:1-31:14
Regular Paper
Syamantak
Das
Syamantak Das
Andreas
Wiese
Andreas Wiese
10.4230/LIPIcs.ESA.2017.31
Hans L. Bodlaender, Klaus Jansen, and Gerhard J. Woeginger. Scheduling with incompatible jobs. Discrete Applied Mathematics, 55(3):219-232, 1994.
Deeparnab Chakrabarty, Sanjeev Khanna, and Shi Li. On (1, ε)-restricted assignment makespan minimization. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1087-1101. SIAM, 2015.
Chandra Chekuri and Sanjeev Khanna. On multi-dimensional packing problems. In SODA, volume 99, pages 185-194. Citeseer, 1999.
Trivikram Dokka, Anastasia Kouvela, and Frits C. R. Spieksma. Approximating the multi-level bottleneck assignment problem. Oper. Res. Lett., 40(4):282-286, 2012.
Tomáš Ebenlendr, Marek Krčál, and Jiří Sgall. Graph balancing: A special case of scheduling unrelated parallel machines. Algorithmica, 68(1):62-80, 2014.
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, and Andreas Wiese. Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods, pages 11-22. Springer, 2010. URL: http://dx.doi.org/10.1007/978-3-642-15775-2_2.
http://dx.doi.org/10.1007/978-3-642-15775-2_2
Guy Even, Magnús M. Halldórsson, Lotem Kaplan, and Dana Ron. Scheduling with conflicts: online and offline algorithms. J. Scheduling, 12(2):199-224, 2009.
Ronald L Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45(9):1563-1581, 1966.
Ronald L. Graham. Bounds on multiprocessing timing anomalies. SIAM journal on Applied Mathematics, 17(2):416-429, 1969.
D. Hochbaum, editor. Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1997.
Dorit S Hochbaum and David B Shmoys. Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of the ACM (JACM), 34(1):144-162, 1987.
Klaus Jansen. An eptas for scheduling jobs on uniform processors: using an milp relaxation with a constant number of integral variables. SIAM Journal on Discrete Mathematics, 24(2):457-485, 2010.
Klaus Jansen, Kim-Manuel Klein, and José Verschae. Closing the Gap for Makespan Scheduling via Sparsification Techniques. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), volume 55 of LIPIcs, pages 72:1-72:13, Dagstuhl, Germany, 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.72.
http://dx.doi.org/10.4230/LIPIcs.ICALP.2016.72
Klaus Jansen, Kati Land, and Marten Maack. Estimating The Makespan of The Two-Valued Restricted Assignment Problem. In 15th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2016), volume 53 of LIPIcs, pages 24:1-24:13, Dagstuhl, Germany, 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. URL: http://dx.doi.org/10.4230/LIPIcs.SWAT.2016.24.
http://dx.doi.org/10.4230/LIPIcs.SWAT.2016.24
Klaus Jansen and Lars Rohwedder. On the configuration-lp of the restricted assignment problem. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017). SIAM, 2017. to appear.
Jan Karel Lenstra, David B. Shmoys, and Eva Tardos. Approximation algorithms for scheduling unrelated parallel machines. In SFCS'87: Proceedings of the 28th Annual Symposium on Foundations of Computer Science, pages 217-224, Washington, DC, USA, 1987. IEEE Computer Society. URL: http://dx.doi.org/10.1109/SFCS.1987.8.
http://dx.doi.org/10.1109/SFCS.1987.8
Joseph YT Leung. Bin packing with restricted piece sizes. Information Processing Letters, 31(3):145-149, 1989.
Bill McCloskey and AJ Shankar. Approaches to bin packing with clique-graph conflicts. Computer Science Division, University of California, 2005.
E. V. Shchepin and N. Vakhania. An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters, 33:127-133, 2005.
Mohit Singh. Iterative methods in combinatorial optimization. PhD thesis, Carnegie Mellon University, 2008.
Ola Svensson. Santa claus schedules jobs on unrelated machines. SIAM Journal on Computing, 41(5):1318-1341, 2012.
José Verschae and Andreas Wiese. On the configuration-lp for scheduling on unrelated machines. Journal of Scheduling, 17(4):371-383, 2014.
D. Zuckerman. Linear degree extractors and the inapproximability of max clique and chromatic number. Theory of Computing, 3:103-128, 2007.
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode