{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:00:50Z","timestamp":1648648850576},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T00:00:00Z","timestamp":1468281600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1007\/s10878-016-0054-4","type":"journal-article","created":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T11:31:55Z","timestamp":1468323115000},"page":"133-140","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing the number of tardy jobs in two-machine settings with common due date"],"prefix":"10.1007","volume":"34","author":[{"given":"Federico","family":"Della Croce","sequence":"first","affiliation":[]},{"given":"Christos","family":"Koulamas","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"T\u2019kindt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"key":"54_CR1","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy A, Guha S, Naor J, Schieber B (2001) Approximating the throughput of multiple machines in real-time scheduling. SIAM J Comput 31:331\u2013352","journal-title":"SIAM J Comput"},{"key":"54_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF00288885","volume":"9","author":"EG Coffman","year":"1978","unstructured":"Coffman EG, Leung JY-T, Ting DW (1978) Bin packing: maximizing the number of pieces packed. Acta Inform 9:263\u2013271","journal-title":"Acta Inform"},{"key":"54_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Math 5:287\u2013326","journal-title":"Ann Discret Math"},{"key":"54_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0167-6377(94)90041-8","volume":"16","author":"J Jozefowska","year":"1994","unstructured":"Jozefowska J, Jurisch B, Kubiak W (1994) Scheduling shops to minimize the weighted number of late jobs. Oper Res Lett 16:277\u2013283","journal-title":"Oper Res Lett"},{"key":"54_CR5","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1002\/(SICI)1520-6750(199808)45:5<525::AID-NAV6>3.0.CO;2-5","volume":"45","author":"C Koulamas","year":"1998","unstructured":"Koulamas C, Kyparisis GJ (1998) Open shop scheduling to minimize late jobs. Nav Res Logist 45:525\u2013532","journal-title":"Nav Res Logist"},{"key":"54_CR6","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1016\/j.ejor.2006.10.021","volume":"183","author":"BMT Lin","year":"2007","unstructured":"Lin BMT, Kononov AV (2007) Customer order scheduling to minimize the number of late jobs. Eur J Oper Res 183:944\u2013948","journal-title":"Eur J Oper Res"},{"key":"54_CR7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.tcs.2013.05.023","volume":"511","author":"C Lent\u00e9","year":"2013","unstructured":"Lent\u00e9 C, Liedloff M, Soukhal A, T\u2019kindt V (2013) On an extension of the sort & search method with application to scheduling theory. Theor Comput Sci 511:13\u201322","journal-title":"Theor Comput Sci"},{"key":"54_CR8","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1287\/opre.51.5.826.16757","volume":"51","author":"S Martello","year":"2003","unstructured":"Martello S, Toth P (2003) An exact algorithm for the two-constraint 0\/1 knapsack problem. Oper Res 51:826\u2013835","journal-title":"Oper Res"},{"key":"54_CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0167-6377(93)90041-E","volume":"13","author":"N Megiddo","year":"1993","unstructured":"Megiddo N, Tamir A (1993) Linear time algorithms for some separable quadratic programming problems. Oper Res Lett 13:203\u2013211","journal-title":"Oper Res Lett"},{"key":"54_CR10","volume-title":"Linear and combinatorial programming","author":"KG Murty","year":"1976","unstructured":"Murty KG (1976) Linear and combinatorial programming. Wiley, New York"},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"Woeginger GJ (2003) Exact algorithms for \n                        $$NP$$\n                        \n                            \n                                            \n                                \n                                    N\n                                    P\n                                \n                            \n                        \n                    -hard problems: a survey. In: Juenger M, Reinelt G, Rinaldi G (eds) Combinatorial optimization\u2014Eureka! You shrink! (Lecture Notes in Computer Science), vol 2570, p 185\u2013207","DOI":"10.1007\/3-540-36478-1_17"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0054-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0054-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0054-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0054-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,9]],"date-time":"2017-06-09T07:09:47Z","timestamp":1496992187000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0054-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,12]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["54"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0054-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,12]]}}}