{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T11:50:40Z","timestamp":1719057040800},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:00:00Z","timestamp":1307750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2012,1]]},"DOI":"10.1007\/s00224-011-9336-5","type":"journal-article","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T12:09:45Z","timestamp":1307707785000},"page":"124-146","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling with Bully Selfish Jobs"],"prefix":"10.1007","volume":"50","author":[{"given":"Tami","family":"Tamir","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,11]]},"reference":[{"key":"9336_CR1","unstructured":"Brucker, P., Knust, S.: Complexity results for scheduling problems. http:\/\/www.mathematik.uni-osnabrueck.de\/research\/OR\/class\/"},{"key":"9336_CR2","first-page":"504","volume-title":"IFIPS Congress","author":"J.L. Bruno","year":"1974","unstructured":"Bruno, J.L., Coffman, E.G., Sethi, R.: Algorithms for minimizing mean flow-time. In: IFIPS Congress, vol. 74, pp. 504\u2013510 (1974)"},{"key":"9336_CR3","first-page":"213","volume-title":"Proc. of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"C. Chekuri","year":"2000","unstructured":"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\u2013222 (2000)"},{"issue":"1\u20132","key":"9336_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0166-218X(98)00143-7","volume":"98","author":"C. Chekuri","year":"1999","unstructured":"Chekuri, C., Motwani, R.: Precedence constrained scheduling to minimize sum of weighted completion times on a single machine. Discrete Appl. Math. 98(1\u20132), 29\u201338 (1999)","journal-title":"Discrete Appl. Math."},{"key":"9336_CR5","volume-title":"Proc. of the Joint International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS","author":"E.G. Coffman","year":"1976","unstructured":"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)"},{"key":"9336_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263740","volume":"6","author":"E.G. Coffman","year":"1976","unstructured":"Coffman, E.G., Sethi, R.: Algorithms minimizing mean flow-time: schedule length properties. Acta Inform. 6, 1\u201314 (1976)","journal-title":"Acta Inform."},{"key":"9336_CR7","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/opre.41.4.797","volume":"41","author":"B.T. Eck","year":"1993","unstructured":"Eck, B.T., Pinedo, M.: On the minimization of the makespan subject to flowtime optimality. Oper. Res. 41, 797\u2013800 (1993)","journal-title":"Oper. Res."},{"issue":"1","key":"9336_CR8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00453-003-1077-7","volume":"39","author":"L. Epstein","year":"2004","unstructured":"Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. Algorithmica 39(1), 43\u201357 (2004)","journal-title":"Algorithmica"},{"issue":"3","key":"9336_CR9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0166-218X(96)00110-2","volume":"70","author":"L. Finta","year":"1996","unstructured":"Finta, L., Liu, Z.: Single machine scheduling subject to precedence delays. Discrete Appl. Math. 70(3), 247\u2013266 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9336_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"9336_CR11","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45, 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"key":"9336_CR12","first-page":"263","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17, 263\u2013269 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"9336_CR13","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D.S. Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems: Practical and theoretical results. J. ACM 34(1), 144\u2013162 (1987)","journal-title":"J. ACM"},{"key":"9336_CR14","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1080\/07408171003670975","volume":"42","author":"E. Kim","year":"2010","unstructured":"Kim, E., Posner, M.E.: Parallel machine scheduling with S-precedence constraints. IIE Trans. 42, 525\u2013537 (2010)","journal-title":"IIE Trans."},{"key":"9336_CR15","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"E.L. Lawler","year":"1973","unstructured":"Lawler, E.L.: Optimal sequencing of a single machine subject to precedence constraints. Manag. Sci. 19, 544\u2013546 (1973)","journal-title":"Manag. Sci."},{"key":"9336_CR16","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","volume":"2","author":"E.L. Lawler","year":"1978","unstructured":"Lawler, E.L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2, 75\u201390 (1978)","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"9336_CR17","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"J.K. Lenstra","year":"1978","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Complexity of scheduling under precedence constraints. Oper. Res. 26(1), 22\u201335 (1978)","journal-title":"Oper. Res."},{"issue":"4","key":"9336_CR18","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/ijoc.2.4.346","volume":"2","author":"J.Y.-T. Leung","year":"1990","unstructured":"Leung, J.Y.-T., Young, G.H.: Minimizing total tardiness on a single machine with precedence constraints. ORSA J. Comput. 2(4), 346\u2013352 (1990)","journal-title":"ORSA J. Comput."},{"issue":"5","key":"9336_CR19","doi-asserted-by":"crossref","first-page":"1241","DOI":"10.1137\/S0097539799358094","volume":"35","author":"M. Queyranne","year":"2006","unstructured":"Queyranne, M., Schulz, A.S.: Approximation bounds for a general class of precedence constrained parallel machine scheduling problems. SIAM J. Comput. 35(5), 1241\u20131253 (2006)","journal-title":"SIAM J. Comput."},{"key":"9336_CR20","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23, 555\u2013565 (1976)","journal-title":"J. ACM"},{"key":"9336_CR21","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3, 59\u201366 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"9336_CR22","volume-title":"The 20th Int. Conf. on Parallel and Distributed Processing (IPDPS)","author":"P. Sucha","year":"2006","unstructured":"Sucha, P., Hanzalek, Z.: Scheduling of tasks with precedence delays and relative deadlines\u2014framework for time-optimal dynamic reconfiguration of FPGAs. In: The 20th Int. Conf. on Parallel and Distributed Processing (IPDPS)(2006)"},{"key":"9336_CR23","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"J.D. Ullman","year":"1975","unstructured":"Ullman, J.D.: NP-complete scheduling problems. J. Comput. Syst. Sci. 10, 384\u2013393 (1975)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9336-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-011-9336-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-011-9336-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:23Z","timestamp":1558684463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-011-9336-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,11]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9336"],"URL":"https:\/\/doi.org\/10.1007\/s00224-011-9336-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,11]]}}}