Skip to main content
SpringerLink
Log in

Scheduling with Bully Selfish Jobs

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

In job scheduling with precedence-constraints, i≺j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do not let other jobs start their processing if they are around. Formally, we define the selfish precedence-constraint where i≺ s j means that j cannot start being processed if i has not started its processing yet. Interestingly, as was detected by a devoted kindergarten teacher whose story is told below, this type of precedence-constraints is very different from the traditional one, in a sense that problems that are known to be solvable efficiently become NP-hard and vice-versa.

The work of our hero teacher, Ms. Schedule, was initiated due to an arrival of bully jobs to her kindergarten. Bully jobs bypass all other nice jobs, but respect each other. This natural environment corresponds to the case where the selfish precedence-constraints graph is a complete bipartite graph. Ms. Schedule analyzed the minimum makespan and the minimum total flow-time problems for this setting. She then extended her interest to other topologies of the precedence-constraints graph and other special instances with uniform length jobs and/or release times.

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

Similar content being viewed by others

References

  1. Brucker, P., Knust, S.: Complexity results for scheduling problems. http://www.mathematik.uni-osnabrueck.de/research/OR/class/

  2. Bruno, J.L., Coffman, E.G., Sethi, R.: Algorithms for minimizing mean flow-time. In: IFIPS Congress, vol. 74, pp. 504–510 (1974)

    Google Scholar 

  3. Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. In: Proc. of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 213–222 (2000)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Coffman, E.G., Sethi, R.: A generalized bound on LPT sequencing. In: Proc. of the Joint International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS (1976)

    Google Scholar 

  6. Coffman, E.G., Sethi, R.: Algorithms minimizing mean flow-time: schedule length properties. Acta Inform. 6, 1–14 (1976)

    MathSciNet  MATH  Google Scholar 

  7. Eck, B.T., Pinedo, M.: On the minimization of the makespan subject to flowtime optimality. Oper. Res. 41, 797–800 (1993)

    Article  MATH  Google Scholar 

  8. Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39(1), 43–57 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Finta, L., Liu, Z.: Single machine scheduling subject to precedence delays. Discrete Appl. Math. 70(3), 247–266 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  10. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  11. Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563–1581 (1966)

    Article  Google Scholar 

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

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  14. Kim, E., Posner, M.E.: Parallel machine scheduling with S-precedence constraints. IIE Trans. 42, 525–537 (2010)

    Article  Google Scholar 

  15. Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Manag. Sci. 19, 544–546 (1973)

    Article  MATH  Google Scholar 

  16. Lawler, E.L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2, 75–90 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22–35 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  18. Leung, J.Y.-T., Young, G.H.: Minimizing total tardiness on a single machine with precedence constraints. ORSA J. Comput. 2(4), 346–352 (1990)

    Article  MATH  Google Scholar 

  19. Queyranne, M., Schulz, A.S.: Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. SIAM J. Comput. 35(5), 1241–1253 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23, 555–565 (1976)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  22. Sucha, P., Hanzalek, Z.: Scheduling of tasks with precedence delays and relative deadlines—framework for time-optimal dynamic reconfiguration of FPGAs. In: The 20th Int. Conf. on Parallel and Distributed Processing (IPDPS)(2006)

    Google Scholar 

  23. Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10, 384–393 (1975)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, The Interdisciplinary Center, Herzliya, Israel

    Tami Tamir

Authors
  1. Tami Tamir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tami Tamir.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tamir, T. Scheduling with Bully Selfish Jobs. Theory Comput Syst 50, 124–146 (2012). https://doi.org/10.1007/s00224-011-9336-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-011-9336-5

Keywords

Search

Navigation