{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:59:47Z","timestamp":1768453187938,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0196-6774(03)00078-6","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T15:02:03Z","timestamp":1058367723000},"page":"175-191","source":"Crossref","is-referenced-by-count":138,"title":["Techniques for scheduling with rejection"],"prefix":"10.1016","volume":"49","author":[{"given":"Daniel W.","family":"Engels","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David R.","family":"Karger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stavros G.","family":"Kolliopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudipta","family":"Sengupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.N.","family":"Uma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joel","family":"Wein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(03)00078-6_BIB001","series-title":"Proceedings of the 7th ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"95","article-title":"Multiprocessor scheduling with rejection","author":"Bartal","year":"1996"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB002","series-title":"Proceedings of the 8th ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"609","article-title":"Approximation techniques for average completion time scheduling","author":"Chekuri","year":"1997"},{"issue":"2","key":"10.1016\/S0196-6774(03)00078-6_BIB003","doi-asserted-by":"crossref","DOI":"10.1002\/(SICI)1099-1425(199903\/04)2:2<73::AID-JOS18>3.0.CO;2-Q","article-title":"A min-sum 1.5-approximation algorithm for scheduling unrelated parallel machines","volume":"2","author":"Chudak","year":"1999","journal-title":"J. Scheduling"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB004","first-page":"180","article-title":"Improved approximation algorithms for uncapacitated facility location","volume":"1412","author":"Chudak","year":"1998"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB005","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","article-title":"Formulating the single machine sequencing problem with release dates as a mixed integer program","volume":"26","author":"Dyer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0196-6774(03)00078-6_BIB006","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB007","series-title":"Proceedings of the 8th ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"591","article-title":"Improved approximation algorithms for scheduling with release dates","author":"Goemans","year":"1997"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB008","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0196-6774(03)00078-6_BIB009","series-title":"Proceedings of the 9th ACM\u2013SIAM Symposium on Discrete Algorithms","article-title":"Greedy strikes back: Improved facility location algorithms","author":"Guha","year":"1998"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB010","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.22.3.513","article-title":"Scheduling to minimize average completion time: off-line and on-line approximation algorithms","volume":"3","author":"Hall","year":"1997","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0196-6774(03)00078-6_BIB011","series-title":"Proceedings of the 7th ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"142","article-title":"Scheduling to minimize average completion time: off-line and on-line algorithms","author":"Hall","year":"1996"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB012","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","author":"Ibarra","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB013","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","article-title":"A functional equation and its application to resource allocation and sequencing problems","volume":"16","author":"Lawler","year":"1969","journal-title":"Manage. Sci."},{"key":"10.1016\/S0196-6774(03)00078-6_BIB014","unstructured":"E.L. Lawler, D.B. Shmoys, Weighted number of late jobs (preliminary version) Chapter 5, in: J.K. Lenstra, D.B. Shmoys (Eds.), Scheduling, Wiley, in press"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB015","unstructured":"W.L. Maxwell, Personal communication, 1996"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB016","first-page":"367","article-title":"Approximation bounds for a general class of precedence constrained parallel machine scheduling problems","volume":"1412","author":"Munier","year":"1998"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB017","series-title":"Decomposition Methods for Complex Factory Scheduling Problems","author":"Ovacik","year":"1997"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB018","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01585872","article-title":"Minimizing average completion time in the presence of release dates","volume":"82","author":"Phillips","year":"1998","journal-title":"Math. Programming B"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB019","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","article-title":"Scheduling independent tasks on parallel processors","volume":"12","author":"Rothkopf","year":"1966","journal-title":"Manage. Sci."},{"key":"10.1016\/S0196-6774(03)00078-6_BIB020","series-title":"Randomization and Approximation Techniques in Computer Science, Proceedings of the International Workshop RANDOM '97","first-page":"119","article-title":"Random-based scheduling: New approximations and LP lower bounds","volume":"1269","author":"Schulz","year":"1997"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB021","series-title":"Algorithms, ESA '97, Proceedings of the 5th Annual European Symposium on Algorithms","first-page":"416","article-title":"Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria","volume":"1284","author":"Schulz","year":"1997"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB022","article-title":"Preemptive multiprocessor scheduling with rejection","author":"Seiden","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-6774(03)00078-6_BIB023","series-title":"Proceedings of the 29th Annual ACM Symposium on Theory of Computing","first-page":"265","article-title":"Approximation algorithms for facility location problems","author":"Shmoys","year":"1997"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB024","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quarterly"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB025","unstructured":"R.N. Uma, Theoretical and experimental perspectives on hard scheduling problems, PhD thesis, Polytechnic University, Brooklyn, NY, July 2000"},{"key":"10.1016\/S0196-6774(03)00078-6_BIB026","series-title":"Proceedings of the 10th ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"820","article-title":"When does a dynamic programming formulation guarantee the existence of an FPTAS?","author":"Woeginger","year":"1999"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000786?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000786?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T13:26:01Z","timestamp":1552829161000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677403000786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0196677403000786"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(03)00078-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}