Skip to main content
SpringerLink
Log in

Scheduling and fixed-parameter tractability

  • Full Length Paper
  • Series B
  • Published:
Mathematical Programming Submit manuscript

Abstract

Fixed-parameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixed-parameter algorithms are appealing for many reasons, no such algorithms are known for many fundamental scheduling problems. In this paper we present the first fixed-parameter algorithms for classical scheduling problems such as makespan minimization, scheduling with job-dependent cost functions—one important example being weighted flow time—and scheduling with rejection. To this end, we identify crucial parameters that determine the problems’ complexity. In particular, we manage to cope with the problem complexity stemming from numeric input values, such as job processing times, which is usually a core bottleneck in the design of fixed-parameter algorithms. We complement our algorithms with \(\mathsf {W[1]}\)-hardness results showing that for smaller sets of parameters the respective problems do not allow fixed-parameter algorithms. In particular, our positive and negative results for scheduling with rejection explore a research direction proposed by Dániel Marx.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  1. Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proc. FOCS, pp. 32–43 (1999)

  2. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1(1), 55–66 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM Trans. Algorithms 3(4), 39 (2007)

    Article  MathSciNet  Google Scholar 

  5. Bansal, N., Pruhs, K.: The geometry of scheduling. In: Proc. FOCS, pp. 407–414 (2010)

  6. Bansal, N., Pruhs, K.: Weighted geometric set multi-cover via quasi-uniform sampling. In: Algorithms-ESA, pp. 145–156. Springer, Berlin (2012)

  7. Bessy, S., Giroudeau, R.: Some parametric complexity results on a coupled-task scheduling problem, personal communication (2013)

  8. Bodlaender, H.L., Fellows, M.R.: \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling. Oper. Res. Lett. 18(2), 93–97 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  9. Brauner, N., Crama, Y., Grigoriev, A., van de Klundert, J.: A framework for the complexity of high-multiplicity scheduling problems. J. Comb. Optim. 9(3), 313–323 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Chekuri, C., Khanna, S.: Approximation schemes for preemptive weighted flow time. In: Proc. STOC, pp. 297–305 (2002)

  11. Chekuri, C., Khanna, S., Zhu, A.: Algorithms for minimizing weighted flow time. In: Proc. STOC, pp. 84–93 (2001)

  12. Chu, G., Gaspers, S., Narodytska, N., Schutt, A., Walsh, T.: On the complexity of global scheduling constraints under structural restrictions. In: Proc. IJCAI (2013)

  13. Chudak, F.A., Hochbaum, D.S.: A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine. Oper. Res. Lett. 25(5), 199–204 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  14. Coffman E.G. Jr., Garey, M.R., Johnson, D.S.: An application of bin-packing to multiprocessor scheduling. SIAM J. Comput. 7, 1–17 (1978)

  15. Ebenlendr, T., Krčál, M., Sgall, J.: Graph balancing: a special case of scheduling unrelated parallel machines. In: Proc. SODA, pp. 483–490 (2008)

  16. Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. J. Algorithms 49(1), 175–191 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  17. Fellows, M.R., Gaspers, S., Rosamond, F.A.: Parameterizing by the number of numbers. Theory Comput. Syst. 50(4), 675–693 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  18. Fellows, M.R., Koblitz, N.: Fixed-parameter complexity and cryptography. In: San Juan, P.R. (ed.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes Comput. Sci., vol. 673, pp. 121–131 (1993)

  19. Fellows, M.R., McCartin, C.: On the parametric complexity of schedules to minimize tardy tasks. Theor. Comput. Sci. 298(2), 317–324 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  20. Friesen, D.K.: Tighter bounds for the multifit processor scheduling algorithm. SIAM J. Comput. 13, 170–181 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  21. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., San Francisco (1979)

    MATH  Google Scholar 

  22. Goemans, M.X., Rothvoß, T.: Polynomiality for bin packing with a constant number of item types. In: Proc. SODA, pp. 830–839 (2014)

  23. Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 263–269 (1969)

    Google Scholar 

  24. Heinz, S.: Complexity of integer quasiconvex polynomial optimization. J. Complex. 21(4), 543–556 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  25. Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: theoretical and practical results. J. ACM 34, 144–162 (1987)

    Article  MathSciNet  Google Scholar 

  26. Hoogeveen, H., Skutella, M., Woeginger, G.J.: Preemptive scheduling with rejection. Math. Program. 94(2–3, Ser. B), 361–374 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  27. Jansen, K., Kratsch, S., Marx, D., Schlotter, I.: Bin packing with fixed number of bins revisited. J. Comput. Syst. Sci. 79(1), 39–49 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  28. Köppe, M.: On the complexity of nonlinear mixed-integer optimization. In: Lee, J., Leyffer, S. (eds.) Mixed Integer Nonlinear Programming, The IMA Volumes in Mathematics and its Applications, vol. 154, pp. 533–557 (2012)

  29. Langston, M.A.: Processor scheduling with improved heuristic algorithms. Ph.D. thesis, Texas A&M University (1981)

  30. Lenstra, J., Kan, A.R., Brucker, P.: Complexity of machine scheduling problems. In: Studies in Integer Programming, Ann. Discrete Math., vol. 1, pp. 343–362 (1977)

  31. Lenstra, J.K., Shmoys, D.B., Tardos, É.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46(1–3), 259–271 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  32. Marx, D.: Fixed-parameter tractable scheduling problems. In: Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091), vol. 1, p. 86 (2011)

  33. Marx, D., Schlotter, I.: Stable assignment with couples: parameterized complexity and local search. Discret. Optim. 8(1), 25–40 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  34. Mnich, M., Wiese, A.: Scheduling and fixed-parameter tractability. In: Proc. IPCO 2014, Lecture Notes Comput. Sci., vol. 8494, pp. 381–392 (2014)

  35. Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23, 116–127 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  36. Shmoys, D.B., Tardos, É.: An approximation algorithm for the generalized assignment problem. Math. Program. 62(1–3), 461–474 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  37. Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3, 59–66 (1956)

    Article  Google Scholar 

  38. Svensson, O.: Santa claus schedules jobs on unrelated machines. SIAM J. Comput. 41(5), 1318–1341 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  39. Sviridenko, M., Wiese, A.: Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines. In: Proc. IPCO 2013, Lecture Notes Comput. Sci., vol. 7801, pp. 387–398 (2013)

Download references

Acknowledgments

We thank the reviewers of IPCO 2014 and Mathematical Programming for their remarks on improving the presentation of the results. We further thank an anonymous reviewer of an earlier version for suggestions how to improve the algorithms in Sect. 4 and to prove Theorem 9, as well as Akiyoshi Shioura for helpful discussions about convexity. Finally, we would like to thank the anonymous reviewers for pointing out the IP formulation in Sect. 2.2 which is simpler than our original formulation.

Author information

Authors and Affiliations

  1. Cluster of Excellence MMCI, Campus E1-7, 66123, Saarbrücken, Germany

    Matthias Mnich

  2. Max-Planck-Institute for Computer Science, Campus E1-4, 66123, Saarbrücken, Germany

    Andreas Wiese

Authors
  1. Matthias Mnich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Wiese
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas Wiese.

Additional information

A preliminary version of this article appeared in the proceedings of IPCO 2014 [34].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mnich, M., Wiese, A. Scheduling and fixed-parameter tractability. Math. Program. 154, 533–562 (2015). https://doi.org/10.1007/s10107-014-0830-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-014-0830-9

Keywords

Mathematics Subject Classification

Search

Navigation