Universal sequencing on an unreliable machine

SIAM Journal on Computing

Volumn 41, Issue 3, 2012, Pages 565-586

  Epstein, Leah ^a   Levin, Asaf ^b   Marchetti Spaccamela, Alberto ^c   Megow, Nicole ^d   Mestre, Julian ^e   Skutella, Martin ^f   Stougie, Leen ^g  

^a UNIVERSITY OF HAIFA   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^e UNIVERSITY OF SYDNEY   (Australia)

^f TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^g VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Machine speed; Min sum objective; Scheduling; Single machine; Universal solution; Unreliable machine; Worst case guarantee

Indexed keywords

MACHINE SPEED; MIN-SUM; SINGLE MACHINE; UNIVERSAL SOLUTIONS; UNRELIABLE MACHINE; WORST CASE GUARANTEE;

COST FUNCTIONS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SCHEDULING;

ALGORITHMS;

EID: 84865510062     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/110844210     Document Type: Article

References (43)

1. I. Adiri, J. Bruno, E. Frostig, and A.H.G. Rinnooy Kan, Single machine flow-Time scheduling with a single breakdown, Acta Inform., 26 (1989), pp. 679-696. (Pubitemid 20631693)
2. N. Bansal and K. Pruhs, The geometry of scheduling, in Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), IEEE Computer Society, Piscataway, NJ, 2010, pp. 407-414.
3. L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, and K. Pruhs, Online weighted flow time and deadline scheduling, J. Discrete Algorithms, 4 (2006), pp. 339-352. (Pubitemid 44287624)
4. A. Ben-Tal and A. Nemirovski, Robust solutions of linear programming problems contaminated with uncertain data, Math. Program., 88 (2000), pp. 411-424.
5. J.L. Carter and M.N. Wegman, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp. 143-154.
6. M. Cheung and D. Shmoys, A primal-dual approximation algorithm for min-sum singlemachine scheduling problems, in Proceedings of the 14th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2011), Lecture Notes in Comput. Sci. 6845, Springer, New York, 2011, pp. 135-146.
7. M. Chrobak, C. Kenyon, J. Noga, and N.E. Young, Incremental medians via online bidding, Algorithmica, 50 (2008), pp. 455-478. (Pubitemid 351366972)
8. M. Chrobak and C. Kenyon-Mathieu, SIGACT news online algorithms column 10: Competitiveness via doubling, SIGACT News, 37 (2006), pp. 115-126.
9. F. Diedrich, K. Jansen, U.M. Schwarz, and D. Trystram, A survey on approximation algorithms for scheduling with machine unavailability, in Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation, Springer, New York, 2009, pp. 50-64.
10. L. Epstein, A. Levin, A. Marchetti-Spaccamela, N. Megow, J. Mestre, M. Skutella, and L. Stougie, Universal sequencing on a single machine, in Proceedings of the 14th Conference on Integer Programming and Combinatorial Optimization (IPCO 2010), Lecture Notes in Comput. Sci. 6080, Springer, Heidelberg, 2010, pp. 230-243.
11. P. Erdos and G. Szekeres, A combinatorial problem in geometry, Compos. Math., 2 (1935), pp. 463-470.
12. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann. Discrete Math., 5 (1979), pp. 287-326.
13. M.T. Hajiaghayi, K. Jain, L.C. Lau, I.I. Mandoiu, A. Russell, and V.V. Vazirani, Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping, in Proceedings of the Second IWBRA, Lecture Notes in Comput. Sci. 3992, Springer, New York, 2006, pp. 758-766. (Pubitemid 44152582)
14. L.A. Hall, A.S. Schulz, D.B. Shmoys, and J. Wein, Scheduling to minimize average completion time: Off-line and on-line approximation algorithms, Math. Oper. Res., 22 (1997), pp. 513-544. (Pubitemid 127653350)
15. J.M. Hammersley, A few seedlings of research, in Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, University of California Press, Berkeley, CA, 1972, pp. 345-394.
16. W. Hohn and T. Jacobs, On the performance of Smith's rule in single-machine scheduling with nonlinear cost, in Proceedings of the 10th Latin American Symposium on Theoretical Informatics (LATIN'12), Lecture Notes in Comput. Sci. 7256, Springer, New York, 2012, pp. 482-493.
17. O.H. Ibarra and C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, J. ACM, 22 (1975), pp. 463-468.
18. L. Jia, G. Lin, G. Noubir, R. Rajaraman, and R. Sundaram, Universal approximations for TSP, Steiner tree, and set cover, in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC'05), ACM, New York, 2005, pp. 386-395. (Pubitemid 43098609)
19. D.S. Johnson and K.A. Niemi, On knapsacks, partitions, and a new dynamic programming technique for trees, Math. Oper. Res., 8 (1983), pp. 1-14. (Pubitemid 13527105)
20. I. Kacem, Approximation algorithm for the weighted flow-Time minimization on a single machine with a fixed non-availability interval, Comput. Indust. Engrg., 54 (2008), pp. 401-410. (Pubitemid 351199793)
21. I. Kacem and A.R. Mahjoub, Fully polynomial time approximation scheme for the weighted flow-Time minimization on a single machine with a fixed non-availability interval, Comput. Indust. Engrg., 56 (2009), pp. 1708-1712.
22. R.M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY), Plenum, New York, 1972, pp. 85-103.
23. H. Kellerer, M.A. Kubzin, and V.A. Strusevich, Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval, European J. Oper. Res., 199 (2009), pp. 111-116.
24. H. Kellerer and V.A. Strusevich, Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications, Algorithmica, 57 (2010), pp. 769-795.
25. S.G. Kolliopoulos and G. Steiner, Partially ordered knapsack and applications to scheduling, Discrete Appl. Math., 155 (2007), pp. 889-897. (Pubitemid 46442743)
26. P. Kouvelis and G. Yu, Robust Discrete Optimization and Its Applications, Springer, New York, 1997.
27. E.L. Lawler, A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, Ann. Oper. Res., 26 (1990), pp. 125-133.
28. C.-Y. Lee, Machine scheduling with an availability constraint, J. Global Optim., 9 (1996), pp. 395-416. (Pubitemid 126714017)
29. C.-Y. Lee, Machine scheduling with availability constraints, in Handbook of Scheduling, J.Y.- T. Leung, ed., CRC Press, Boca Raton, FL, 2004.
30. C.-Y. Lee and S.D. Liman, Single machine flow-Time scheduling with scheduled maintenance, Acta Inform., 29 (1992), pp. 375-382.
31. C. Liebchen, M.E. Lubbecke, R.H. Mohring, and S. Stiller, The concept of recoverable robustness, linear programming recovery, and railway applications, in Robust and Online Large-Scale Optimization, R.K. Ahuja, R.H. Möhring, and Chr. Zaroliagis, eds., Lecture Notes in Comput. Sci. 5868, Springer-Verlag, Berlin, 2009, pp. 1-27.
32. Y. Ma, C. Chu, and C. Zuo, A survey of scheduling with deterministic machine availability constraints, Comput. Indust. Engrg., 58 (2010), pp. 199-211.
33. M. Mastrolilli, N. Mutsanas, and O. Svensson, Approximating single machine scheduling with scenarios, in Proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2008), Lecture Notes in Comput. Sci. 5171, Springer, New York, 2008, pp. 153-164.
34. N. Megow and J. Verschae, Note on Scheduling on a Single Machine with One Nonavailability Period, unpublished manuscript, 2008.
35. K. Pruhs and G.J. Woeginger, Approximation schemes for a class of subset selection problems, Theoret. Comput. Sci., 382 (2007), pp. 151-156. (Pubitemid 47187908)
36. H. Räcke, Survey on oblivious routing strategies, in Mathematical Theory and Computational Practice, Proceedings of the 5th Conference on Computability in Europe (CiE), K. Ambos- Spies, B. Löwe, and W. Merkle, eds., Lecture Notes in Comput. Sci. 5635, Springer, New York, 2009, pp. 419-429.
37. G. Schmidt, Scheduling with limited machine availability, European J. Oper. Res., 121 (2000), pp. 1-15. (Pubitemid 30546340)
38. A.S. Schulz and M. Skutella, The power of α-points in preemptive single machine scheduling, J. Sched., 5 (2002), pp. 121-133.
39. W.E. Smith, Various optimizers for single-stage production, Naval Res. Logist. Quart., 3 (1956), pp. 59-66.
40. A. Soyster, Convex programming with set-inclusive constraints and applications to inexact linear programming, Oper. Res., 21 (1973), pp. 1154-1157.
41. S. Stiller and A. Wiese, Increasing speed scheduling and flow scheduling, in Proceedings of the 21st Symposium on Algorithms and Computation (ISAAC 2010), Lecture Notes in Comput. Sci. 6507, Springer, New York, 2010, pp. 279-290.
42. L.G. Valiant and G.J. Brebner, Universal schemes for parallel communication, in Proceedings of the 13th Annual ACM Symposium on Theory of Computation (STOC'81), ACM, New York, 1981, pp. 263-277.
43. G.Wang, H. Sun, and C. Chu, Preemptive scheduling with availability constraints to minimize total weighted completion times, Ann. Oper. Res., 133 (2005), pp. 183-192. (Pubitemid 40389748)