Abstract
Scheduling with testing is a recent online problem within the framework of explorable uncertainty motivated by environments where some preliminary action can influence the duration of a task. Jobs have an unknown processing time that can be explored by running a test. Alternatively, jobs can be executed for the duration of a given upper limit. We consider this problem within the setting of multiple identical parallel machines and present competitive deterministic algorithms and lower bounds for the objective of minimizing the makespan of the schedule. In the non-preemptive setting, we present the SBS algorithm whose competitive ratio approaches 3.1016 if the number of machines becomes large. We compare this result with a simple greedy strategy and a lower bound which approaches 2. In the case of uniform testing times, we can improve the SBS algorithm to be 3-competitive. For the preemptive case we provide a 2-competitive algorithm and a tight lower bound which approaches the same value.
Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 277991500/GRK2201, and by the European Research Council, Grant Agreement No. 691672.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Albers, S.: Better bounds for online scheduling. SIAM J. Comput. 29(2), 459–473 (1999). https://doi.org/10.1137/S0097539797324874
Albers, S.: On randomized online scheduling. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 134–143. STOC 2002, Association for Computing Machinery, New York, NY, USA (2002). https://doi.org/10.1145/509907.509930
Albers, S., Eckl, A.: Explorable uncertainty in scheduling with non-uniform testing times. In: Kaklamanis, C., Levin, A. (eds.) WAOA 2020. LNCS, vol. 12806, pp. 127–142. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-80879-2_9
Albers, S., Eckl, A.: Scheduling with testing on multiple identical parallel machines (2021). arXiv: https://arxiv.org/abs/2105.02052
Albers, S., Hellwig, M.: Semi-online scheduling revisited. Theoret. Comput. Sci. 443, 1–9 (2012). https://doi.org/10.1016/j.tcs.2012.03.031
Albers, S., Hellwig, M.: Online makespan minimization with parallel schedules. Algorithmica 78(2), 492–520 (2017). https://doi.org/10.1007/s00453-016-0172-5
Azar, Y., Regev, O.: On-line bin-stretching. Theoret. Comput. Sci. 268(1), 17–41 (2001). https://doi.org/10.1016/S0304-3975(00)00258-9
Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 51–58. STOC 1992, Association for Computing Machinery, New York, NY, USA (1992). https://doi.org/10.1145/129712.129718
Bartal, Y., Karloff, H., Rabani, Y.: A better lower bound for on-line scheduling. Inf. Process. Lett. 50(3), 113–116 (1994). https://doi.org/10.1016/0020-0190(94)00026-3
Bruce, R., Hoffmann, M., Krizanc, D., Raman, R.: Efficient update strategies for geometric computing with uncertainty. Theoret. Comput. Sci. 38(4), 411–423 (2005). https://doi.org/10.1007/s00224-004-1180-4
Chen, B., van Vliet, A., Woeginger, G.J.: A lower bound for randomized on-line scheduling algorithms. Inf. Process. Lett. 51(5), 219–222 (1994). https://doi.org/10.1016/0020-0190(94)00110-3
Chen, B., van Vliet, A., Woeginger, G.J.: An optimal algorithm for preemptive on line scheduling. In: van Leeuwen, J. (ed.) Algorithms ESA 1994. LNCS, vol. 855, pp. 300–306. Springer, Heidelberg (1994). https://doi.org/10.1007/BFb0049417
Durr, C., Erlebach, T., Megow, N., Meißner, J.: Scheduling with explorable uncertainty. In: Karlin, A.R. (ed.) 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), vol. 94, pp. 30:1–30:14. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2018). https://doi.org/10.4230/LIPIcs.ITCS.2018.30
Dürr, C., Erlebach, T., Megow, N., Meißner, J.: An adversarial model for scheduling with testing. Algorithmica 82(12), 3630–3675 (2020). https://doi.org/10.1007/s00453-020-00742-2
Englert, M., Özmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. In: 2008 49th Annual IEEE Symposium on Foundations of Computer Science, pp. 603–612 (2008). https://doi.org/10.1109/FOCS.2008.46
Epstein, L.: A survey on makespan minimization in semi-online environments. J. Sched. 21(3), 269–284 (2018). https://doi.org/10.1007/s10951-018-0567-z
Erlebach, T., Hoffmann, M.: Query-competitive algorithms for computing with uncertainty. Bull. EATCS 2(116), 1–19 (2015)
Erlebach, T., Hoffmann, M., Krizanc, D., Mihal’ák, M., Raman, R.: Computing minimum spanning trees with uncertainty. In: Albers, S., Weil, P. (eds.) 25th International Symposium on Theoretical Aspects of Computer Science. LIPIcs, vol. 1, pp. 277–288. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2008). https://doi.org/10.4230/LIPIcs.STACS.2008.1358
Faigle, U., Kern, W., Turan, G.: On the performance of on-line algorithms for partition problems. Acta Cybern. 9(2), 107–119 (1989)
Feder, T., Motwani, R., O’Callaghan, L., Olston, C., Panigrahy, R.: Computing shortest paths with uncertainty. J. Algorithms 62(1), 1–18 (2007). https://doi.org/10.1016/j.jalgor.2004.07.005
Feder, T., Motwani, R., Panigrahy, R., Olston, C., Widom, J.: Computing the median with uncertainty. SIAM J. Comput. 32(2), 538–547 (2003). https://doi.org/10.1137/S0097539701395668
Fleischer, R., Wahl, M.: On-line scheduling revisited. J. Sched. 3(6), 343–353 (2000)
Galambos, G., Woeginger, G.J.: An on-line scheduling heuristic with better worst-case ratio than Graham’s list scheduling. SIAM J. Comput. 22(2), 349–355 (1993). https://doi.org/10.1137/0222026
Goerigk, M., Gupta, M., Ide, J., Schöbel, A., Sen, S.: The robust knapsack problem with queries. Comput. Oper. Res. 55, 12–22 (2015). https://doi.org/10.1016/j.cor.2014.09.010
Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Techn. J. 45(9), 1563–1581 (1966). https://doi.org/10.1002/j.1538-7305.1966.tb01709.x
Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416–429 (1969). https://doi.org/10.1137/0117039
Gupta, M., Sabharwal, Y., Sen, S.: The update complexity of selection and related problems. In: Chakraborty, S., Kumar, A. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011). Leibniz International Proceedings in Informatics (LIPIcs), vol. 13, pp. 325–338. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2011). https://doi.org/10.4230/LIPIcs.FSTTCS.2011.325
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM 34(1), 144–162 (1987). https://doi.org/10.1145/7531.7535
Kahan, S.: A model for data in motion. In: Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, pp. 265–277. STOC 1991, ACM, New York, NY, USA (1991). https://doi.org/10.1145/103418.103449
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617–643 (2000). https://doi.org/10.1145/347476.347479
Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. J. Algorithms 20(2), 400–430 (1996). https://doi.org/10.1006/jagm.1996.0019
Kellerer, H., Kotov, V., Gabay, M.: An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. J. Sched. 18(6), 623–630 (2015). https://doi.org/10.1007/s10951-015-0430-4
Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Oper. Res. Lett. 21(5), 235–242 (1997). https://doi.org/10.1016/S0167-6377(98)00005-4
Khanna, S., Tan, W.C.: On computing functions with uncertainty. In: Proceedings of the Twentieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 171–182. PODS 2001, Association for Computing Machinery, New York, NY, USA (2001). https://doi.org/10.1145/375551.375577
Megow, N., Meißner, J., Skutella, M.: Randomization helps computing a minimum spanning tree under uncertainty. SIAM J. Comput. 46(4), 1217–1240 (2017). https://doi.org/10.1137/16M1088375
Olston, C., Widom, J.: Offering a precision-performance tradeoff for aggregation queries over replicated data. In: 26th International Conference on Very Large Data Bases (VLDB 2000), pp. 144–155. VLDB 2000, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2000)
Rudin III, J.F.: Improved bounds for the on-line scheduling problem. Ph.D. Thesis (2001)
Sgall, J.: A lower bound for randomized on-line multiprocessor scheduling. Inf. Process. Lett. 63(1), 51–55 (1997). https://doi.org/10.1016/S0020-0190(97)00093-8
Singla, S.: The price of information in combinatorial optimization. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. p. 2523–2532. SODA ’18, Society for Industrial and Applied Mathematics, USA (2018). https://doi.org/10.1137/1.9781611975031.161
Weitzman, M.L.: Optimal search for the best alternative. Econometrica 47(3), 641–654 (1979). https://doi.org/10.2307/1910412
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Albers, S., Eckl, A. (2021). Scheduling with Testing on Multiple Identical Parallel Machines. In: Lubiw, A., Salavatipour, M., He, M. (eds) Algorithms and Data Structures. WADS 2021. Lecture Notes in Computer Science(), vol 12808. Springer, Cham. https://doi.org/10.1007/978-3-030-83508-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-83508-8_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-83507-1
Online ISBN: 978-3-030-83508-8
eBook Packages: Computer ScienceComputer Science (R0)