Skip to main content
Springer Nature Link
Log in

Scheduling Partially Ordered Jobs Faster Than 2n

  • Conference paper
Algorithms – ESA 2011 (ESA 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6942))

Included in the following conference series:

  • 2650 Accesses

Abstract

In the SCHED problem we are given a set of n jobs, together with their processing times and precedence constraints. The task is to order the jobs so that their total completion time is minimized. SCHED is a special case of the Traveling Repairman Problem with precedences. A natural dynamic programming algorithm solves both these problems in 2n n O(1) time, and whether there exists an algorithms solving SCHED in O(c n) time for some constant c < 2 was an open problem posted in 2004 by Woeginger. In this paper we answer this question positively.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Binkele-Raible, D., Brankovic, L., Cygan, M., Fernau, H., Kneis, J., Kratsch, D., Langer, A., Liedloff, M., Pilipczuk, M., Rossmanith, P., Wojtaszczyk, J.O.: Breaking the 2n-barrier for irredundance: Two lines of attack. Accepted for Publication in Journal of Discrete Algorithms (2011)

    Google Scholar 

  2. Björklund, A.: Determinant sums for undirected hamiltonicity. In: 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 173–182. IEEE Computer Society, Los Alamitos (2010)

    Google Scholar 

  3. Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets möbius: fast subset convolution. In: 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 67–74 (2007)

    Google Scholar 

  4. Björklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39(2), 546–563 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Applied Mathematics 98(1-2), 29–38 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. CoRR abs/1103.0534 (2011)

    Google Scholar 

  7. Cygan, M., Pilipczuk, M.: Exact and approximate bandwidth. Theor. Comput. Sci. 411(40-42), 3701–3713 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cygan, M., Pilipczuk, M., Wojtaszczyk, J.O.: Capacitated domination faster than o(2n). In: Kaplan, H. (ed.) SWAT 2010. LNCS, vol. 6139, pp. 74–80. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Fomin, F., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)

    Book  MATH  Google Scholar 

  10. Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 1–32 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. J. Comput. Syst. Sci. 62(2), 367–375 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lenstra, J.K., Kan, A.R.: Complexity of scheduling under precedence constraints. Operations Research 26, 22–35 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lokshtanov, D., Marx, D., Saurabh, S.: Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 777–789 (2011)

    Google Scholar 

  14. Margot, F., Queyranne, M., Wang, Y.: Decompositions, network flows, and a precedence constrained single-machine scheduling problem. Operations Research 51(6), 981–992 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mucha, M., Sankowski, P.: Maximum matchings via gaussian elimination. In: 45th Symposium on Foundations of Computer Science (FOCS), pp. 248–255 (2004)

    Google Scholar 

  16. Patrascu, M., Williams, R.: On the possibility of faster SAT algorithms. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1065–1075 (2010)

    Google Scholar 

  17. van Rooij, J.M.M., Nederlof, J., van Dijk, T.C.: Inclusion/exclusion meets measure and conquer. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 554–565. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  18. Woeginger, G.J.: Space and time complexity of exact algorithms: Some open problems (Invited talk). In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 281–290. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Woeginger, G.J.: Open problems around exact algorithms. Discrete Applied Mathematics 156(3), 397–405 (2008)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, Poland

    Marek Cygan, Marcin Pilipczuk & Michał Pilipczuk

  2. Google Inc., Cracow, Poland

    Jakub Onufry Wojtaszczyk

Authors
  1. Marek Cygan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marcin Pilipczuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michał Pilipczuk
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jakub Onufry Wojtaszczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, University of Rome " La Sapienza", via Ariosto 25, 00185, Roma, Italy

    Camil Demetrescu

  2. School of Computer Science, Reykjavik University, Menntavegur 1, 101, Reykjavik, Iceland

    Magnús M. Halldórsson

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O. (2011). Scheduling Partially Ordered Jobs Faster Than 2n . In: Demetrescu, C., Halldórsson, M.M. (eds) Algorithms – ESA 2011. ESA 2011. Lecture Notes in Computer Science, vol 6942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23719-5_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23719-5_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23718-8

  • Online ISBN: 978-3-642-23719-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics