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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brucker, P., Knust, S.: Complexity results for scheduling problems, http://www.mathematik.uni-osnabrueck.de/research/OR/class/
Bruno, J.L., Coffman, E.G., Sethi, R.: Algorithms for minimizing mean flow-time. In: IFIPS Congress, vol. 74, pp. 504–510 (1974)
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)
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)
Coffman, E.G., Sethi, R.: A generalized bound on LPT sequencing. In: Joint Int. Conf. on Measurements and Modeling of Computer Systems, SIGMETRICS (1976)
Coffman, E.G., Sethi, R.: Algorithms minimizing mean flow-time: schedule length properties. Acta Informatica 6, 1–14 (1976)
Dror, M., Kubiak, W., Dell’Olmo, P.: Strong-weak chain constrained scheduling. Ricerca Operativa 27, 35–49 (1998)
Du, J., Leung, J.Y.-T., Young, G.H.: Scheduling chain-structured tasks to minimize makespan and mean flow-time. Inform. and Comput. 92(2), 219–236 (1991)
Eck, B.T., Pinedo, M.: On the minimization of the makespan subject to flowtime optimality. Operations Research 41, 797–800 (1993)
Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39(1), 43–57 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)
Graham, R.L.: Bounds for Certain Multiprocessing Anomalies. Bell Systems Technical Journal 45, 1563–1581 (1966)
Graham, R.L.: Bounds on Multiprocessing Timing Anomalies. SIAM J. Appl. Math. 17, 263–269 (1969)
Hu, T.C.: Parallel sequencing and assembly line problems. Oper. Res. 9, 841–848 (1961)
Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Practical and theoretical results. J. of the ACM 34(1), 144–162 (1987)
Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Management Sci. 19, 544–546 (1973)
Lawler, E.L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2, 75–90 (1978)
Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22–35 (1978)
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)
Sahni, S.: Algorithms for scheduling independent tasks. J. of the ACM 23, 555–565 (1976)
Smith, W.E.: Various optimizers for single-stage production. Naval Research Logistics Quarterly 3, 59–66 (1956)
Tamir, T.: Scheduling with Bully Selfish Jobs, http://www.faculty.idc.ac.il/tami/Papers/FUNfull.pdf
Ullman, J.D.: NP-complete scheduling problems. J. Comput. System Sci. 10, 384–393 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tamir, T. (2010). Scheduling with Bully Selfish Jobs. In: Boldi, P., Gargano, L. (eds) Fun with Algorithms. FUN 2010. Lecture Notes in Computer Science, vol 6099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13122-6_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-13122-6_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13121-9
Online ISBN: 978-3-642-13122-6
eBook Packages: Computer ScienceComputer Science (R0)