Rob van Stee
Abstract
For this column, I would like to report on some conferences that I attended recently, with special attention given (of course) to results in online algorithms. Most of the papers discussed below consider online scheduling, another favorite problem area of mine. Generally, for a job j we will denote its processing time by pj , its weight by wj (if applicable), its release time by rj , and its deadline by dj . In the discussion below, I have tried to point out interesting open problems wherever possible. Enjoy.
- Susanne Albers and Matthias Hellwig. On the value of job migration in online makespan minimization. In Epstein and Ferragina {7}, pages 84--95. Google Scholar
- Martin Babka, Jan Bulánek, Vladimír Cunát, Michal Koucký, and Michael Saks. On online labeling with polynomially many labels. In Epstein and Ferragina {7}, pages 121--132. Google Scholar
- János Balogh, József Békési, Gyorgy Dosa, Hans Kellerer, and Zsolt Tuza. Black and white bin packing. In Proc. 10th Workshop on Approximation and Online Algorithms (WAOA 2012). To appear.Google Scholar
- Yair Bartal, Stefano Leonardi, Gil Shallom, and René Sitters. On the value of preemption in scheduling. In Josep Díaz, Klaus Jansen, José D. P. Rolim, and Uri Zwick, editors, APPROXRANDOM, volume 4110 of Lecture Notes in Computer Science, pages 39--48. Springer, 2006. Google ScholarDigital Library
- Ho-Leung Chan, Tak Wah Lam, and Rongbin Li. Online flow time scheduling in the presence of preemption overhead. In Gupta et al. {11}, pages 85--97.Google Scholar
- Matthias Englert, Deniz Özmen, and MatthiasWestermann. The power of reordering for online minimum makespan scheduling. In FOCS, pages 603--612. IEEE Computer Society, 2008. Google ScholarDigital Library
- Leah Epstein and Paolo Ferragina, editors. Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, volume 7501 of Lecture Notes in Computer Science. Springer, 2012.Google Scholar
- Leah Epstein, Lukasz Jez, Jiří Sgall, and Rob van Stee. Online scheduling of jobs with fixed start times on related machines. In Gupta et al. {11}, pages 134--145.Google Scholar
- Leah Epstein and Asaf Levin. Improved randomized results for the interval selection problem. Theoretical Computer Science, 411(34-36):3129--3135, 2010. Google ScholarDigital Library
- Stanley P. Y. Fung, Chung Keung Poon, and Duncan K. W. Yung. On-line scheduling of equal-length intervals on parallel machines. Inf. Process. Lett., 112(10):376--379, 2012. Google ScholarDigital Library
- Anupam Gupta, Klaus Jansen, José D. P. Rolim, and Rocco A. Servedio, editors. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings, volume 7408 of Lecture Notes in Computer Science. Springer, 2012.Google Scholar
- Mehdi Heydari, Seyed Sadjadi, and Emran Mohammadi. Minimizing total flow time subject to preemption penalties in online scheduling. The International Journal of Advanced Manufacturing Technology, 47:227--236, 2010. 10.1007/s00170-009-2190-9.Google ScholarCross Ref
- John F. Rudin III and R. Chandrasekaran. Improved bounds for the online scheduling problem. SIAM J. Comput., 32(3):717--735, 2003. Google ScholarDigital Library
- Akira Mtsubayashi. Optimal online page migration on three points. In Proc. 10th Workshop on Approximation and Online Algorithms (WAOA 2012). To appear.Google Scholar
- Jiří Sgall. Open problems in throughput scheduling. In Epstein and Ferragina {7}, pages 2--11. Google Scholar
- Gerhard J. Woeginger. On-line scheduling of jobs with fixed start and end times. Theoret. Comput. Sci., 130:5--16, 1994. Google ScholarDigital Library
Index Terms
- SIGACT news online algorithms column 21: APPROX and ALGO
Recommendations
SIGACT news online algorithms column 10: competitiveness via doubling
We discuss what we refer to, tentatively, as the "doubling" method for designing online and offline approximation algorithms. The rough idea is to use geometrically increasing estimates on the optimal solution to produce fragments of the algorithm's ...
SIGACT news online algorithms column 24: 2014 so far
In this column, I will discuss some recent papers in online algorithms. It is pleasing to see there were a number of papers about online algorithms in the top conferences this year. If I have missed your paper and you want to write about it or about any ...
SIGACT News Online Algorithms Column 39
For this issue, I am pleased to present an extensive survey by Debasis Dwibedy and Rakesh Mohanty on online makespan scheduling. This is a topic which continues to inspire new research and it is great that these authors have provided an updated survey.
Comments