{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:11:11Z","timestamp":1742911871314,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319130743"},{"type":"electronic","value":"9783319130750"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13075-0_51","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T16:37:06Z","timestamp":1415983026000},"page":"646-657","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties"],"prefix":"10.1007","author":[{"given":"Nevzat Onur","family":"Domani\u00e7","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Gregory","family":"Plaxton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,8]]},"reference":[{"issue":"1","key":"51_CR1","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1006\/jagm.1995.1030","volume":"19","author":"A Aggarwal","year":"1995","unstructured":"Aggarwal, A., Barnoy, A., Khuller, S., Kravets, D., Schieber, B.: Efficient minimum cost matching and transportation using the quadrangle inequality. Journal of Algorithms 19(1), 116\u2013143 (1995)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"51_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2005.04.050","volume":"176","author":"RE Burkard","year":"2007","unstructured":"Burkard, R.E.: Monge properties, discrete convexity and applications. European Journal of Operational Research 176(1), 1\u201314 (2007)","journal-title":"European Journal of Operational Research"},{"key":"51_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)"},{"issue":"4","key":"51_CR4","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1086\/261411","volume":"94","author":"Gabrielle Demange","year":"1986","unstructured":"Demange, G., Gale, D., Sotomayor, M.A.O.: Multi-item auctions. The Journal of Political Economy, 863\u2013872 (1986)","journal-title":"Journal of Political Economy"},{"key":"51_CR5","doi-asserted-by":"crossref","unstructured":"Domani\u00e7, N.O., Plaxton, C.G.: Scheduling unit jobs with a common deadline to minimize the sum of weighted completion times and rejection penalties. Tech. Rep. TR-14-11, Department of Computer Science, University of Texas at Austin (September 2014)","DOI":"10.1007\/978-3-319-13075-0_51"},{"issue":"1","key":"51_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"DW Engels","year":"2003","unstructured":"Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. Journal of Algorithms 49(1), 175\u2013191 (2003)","journal-title":"Journal of Algorithms"},{"issue":"6","key":"51_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"L Epstein","year":"2002","unstructured":"Epstein, L., Noga, J., Woeginger, G.J.: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters 30(6), 415\u2013420 (2002)","journal-title":"Operations Research Letters"},{"issue":"2","key":"51_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"HN Gabow","year":"1985","unstructured":"Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences 30(2), 209\u2013221 (1985)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"51_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/nav.3800140304","volume":"14","author":"F Glover","year":"1967","unstructured":"Glover, F.: Maximum matching in a convex bipartite graph. Naval Research Logistics Quarterly 14(3), 313\u2013316 (1967)","journal-title":"Naval Research Logistics Quarterly"},{"key":"51_CR10","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"51_CR11","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities, 2nd edn. Cambridge University Press (1952)"},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1287\/ijoc.1070.0232","volume":"20","author":"I Katriel","year":"2008","unstructured":"Katriel, I.: Matchings in node-weighted convex bipartite graphs. INFORMS Journal on Computing 20, 205\u2013211 (2008)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"51_CR13","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1086\/261158","volume":"91","author":"Herman B. Leonard","year":"1983","unstructured":"Leonard, H.B.: Elicitation of honest preferences for the assignment of individuals to positions. The Journal of Political Economy, 461\u2013479 (1983)","journal-title":"Journal of Political Economy"},{"key":"51_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF00264533","volume":"15","author":"W Lipski Jr","year":"1981","unstructured":"Lipski Jr, W., Preparata, F.P.: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica 15, 329\u2013346 (1981)","journal-title":"Acta Informatica"},{"key":"51_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-45030-3_49","volume-title":"Algorithms and Computation","author":"CG Plaxton","year":"2013","unstructured":"Plaxton, C.G.: Vertex-weighted matching in two-directional orthogonal ray graphs. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 524\u2013534. Springer, Heidelberg (2013)"},{"issue":"1","key":"51_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. Journal of Scheduling 16(1), 3\u201328 (2013)","journal-title":"Journal of Scheduling"},{"issue":"4","key":"51_CR17","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s10878-010-9350-6","volume":"23","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., Gaspar, N., Yedidsion, L.: A bicriteria approach to scheduling a single machine with job rejection and positional penalties. Journal of Combinatorial Optimization 23(4), 395\u2013424 (2012)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"51_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01753437","volume":"1","author":"LS Shapley","year":"1971","unstructured":"Shapley, L.S., Shubik, M.: The assignment game I: The core. International Journal of Game Theory 1(1), 111\u2013130 (1971)","journal-title":"International Journal of Game Theory"},{"issue":"1","key":"51_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick, S.A.: Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research 212(1), 1\u201311 (2011)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"51_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0305-0548(95)00015-E","volume":"23","author":"SA Slotnick","year":"1996","unstructured":"Slotnick, S.A., Morton, T.E.: Selecting jobs for a heavily loaded shop with lateness penalties. Computers and Operations Research 23(2), 131\u2013140 (1996)","journal-title":"Computers and Operations Research"},{"key":"51_CR21","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0898-1221(96)00079-X","volume":"31","author":"G Steiner","year":"1996","unstructured":"Steiner, G., Yeomans, J.S.: A linear time algorithm for determining maximum matchings in convex, bipartite graphs. Computers and Mathematics with Applications 31, 91\u201396 (1996)","journal-title":"Computers and Mathematics with Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13075-0_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:13:29Z","timestamp":1676420009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13075-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319130743","9783319130750"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13075-0_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}