{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:34:27Z","timestamp":1743021267804,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020254"},{"type":"electronic","value":"9783642020261"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02026-1_38","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T16:31:23Z","timestamp":1245256283000},"page":"403-410","source":"Crossref","is-referenced-by-count":1,"title":["Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine"],"prefix":"10.1007","author":[{"given":"Jianfeng","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzhong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianzhao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guo","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","volume":"2","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P.: Polynomial Time Algorithms for Minimizing the Weighted Number of Late Jobs on a Single Machine with Equal Processing Times. Journal of Scheduling\u00a02, 245\u2013252 (1999)","journal-title":"Journal of Scheduling"},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M.Y., Potts, C.N., Tautenhahn, T., Van De Velde, S.: Scheduling a Batching Machine. Journal of Scheduling\u00a01, 31\u201354 (1998)","journal-title":"Journal of Scheduling"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48686-0_23","volume-title":"Computing and Combinatorics","author":"X. Deng","year":"1999","unstructured":"Deng, X., Zhang, Y.: Minizing Mean Response Time in Batch Processing System. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 231\u2013240. Springer, Heidelberg (1999)"},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. 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. Ann Disc Math\u00a05, 287\u2013326 (1979)","journal-title":"Ann Disc Math"},{"key":"38_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"E.L. Lawler","year":"1990","unstructured":"Lawler, E.L.: A Dynamic Programming Algorithm for Preemptive Scheduling of a Single Machine To Minimize the Number of Late Jobs. Annals of Operation Research\u00a026, 125\u2013133 (1990)","journal-title":"Annals of Operation Research"},{"key":"38_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"E.L. Lawler","year":"1996","unstructured":"Lawler, E.L., Moore, J.M.: A Functional Equation and Its Application to Resource Allocation and Sequencing Problems. Management Science\u00a016, 77\u201384 (1996)","journal-title":"Management Science"},{"key":"38_CR7","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1287\/opre.40.4.764","volume":"40","author":"C.Y. Lee","year":"1992","unstructured":"Lee, C.Y., Uzsoy, R., Martin Vega, L.A.: Efficient Algorithms for Scheduling Semiconductor Burn-in Operations. Operation Research\u00a040, 764\u2013775 (1992)","journal-title":"Operation Research"},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0167-6377(02)00186-4","volume":"31","author":"Z. Liu","year":"2003","unstructured":"Liu, Z., Yuan, J., Edwin Cheng, T.C.: On Schedulimg an Unbounded Batch Machine. Operations Research Letters\u00a031, 42\u201348 (2003)","journal-title":"Operations Research Letters"},{"key":"38_CR9","first-page":"85","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1992","unstructured":"Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1992)"},{"key":"38_CR10","unstructured":"Woeginger, G.J.: When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS. Technical Report Woe-27. Tu-Graz, Austria (1998)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02026-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:52:32Z","timestamp":1714621952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02026-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020254","9783642020261"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02026-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}