{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T08:47:29Z","timestamp":1746780449846,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,4,2]],"date-time":"2016-04-02T00:00:00Z","timestamp":1459555200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/D059518"],"award-info":[{"award-number":["EP\/D059518"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10951-016-0471-3","type":"journal-article","created":{"date-parts":[[2016,4,2]],"date-time":"2016-04-02T03:14:41Z","timestamp":1459566881000},"page":"659-685","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines"],"prefix":"10.1007","volume":"19","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalia V.","family":"Shakhlevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"key":"471_CR1","volume-title":"Network flows: Theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows: Theory, algorithms, and applications. Englewood Cliffs, NJ: Prentice Hall."},{"key":"471_CR2","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"RK Ahuja","year":"2001","unstructured":"Ahuja, R. K., & Orlin, J. B. (2001). Inverse optimization. Operations Research, 49, 771\u2013783.","journal-title":"Operations Research"},{"key":"471_CR3","first-page":"245","volume":"2","author":"P Brucker","year":"2006","unstructured":"Brucker, P., & Kravchenko, S. (2006). Scheduling equal processing time jobs to minimize the weighted number of late jobs. Journal of Mathematical Modelling and Algorithms, 2, 245\u2013252.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"471_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s101070050058","volume":"85","author":"BV Cherkassky","year":"1999","unstructured":"Cherkassky, B. V., & Goldberg, A. V. (1999). Negative-cycle detection algorithms. Mathematical Programming, 85, 277\u2013311.","journal-title":"Mathematical Programming"},{"key":"471_CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1467-9574.1990.tb01276.x","volume":"44","author":"MI Dessouky","year":"1990","unstructured":"Dessouky, M. I., Lageweg, B. J., Lenstra, J. K., & Van de Velde, S. L. (1990). Scheduling identical jobs on uniform parallel machines. Statistica Neerlandica, 44, 115\u2013123.","journal-title":"Statistica Neerlandica"},{"key":"471_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s10479-008-0479-y","volume":"169","author":"MC Dourado","year":"2009","unstructured":"Dourado, M. C., Rodrigues, R. F., & Szwarcfiter, J. L. (2009). Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs. Annals of Operations Research, 169, 81\u201391.","journal-title":"Annals of Operations Research"},{"key":"471_CR7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C Heuberger","year":"2004","unstructured":"Heuberger, C. (2004). Inverse combinatorial optimization: A survey on problems, methods and results. Journal of Combinatorial Optimization, 8, 329\u2013361.","journal-title":"Journal of Combinatorial Optimization"},{"key":"471_CR8","volume-title":"The Art of Computer Programming. Sorting and Searching","author":"D Knuth","year":"1998","unstructured":"Knuth, D. (1998). The Art of Computer Programming. Sorting and Searching (Second ed., Vol. 3). Reading, MA: Addison-Wesley.","edition":"Second"},{"key":"471_CR9","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/j.ejor.2005.09.017","volume":"176","author":"Y Lin","year":"2007","unstructured":"Lin, Y., & Wang, X. (2007). Necessary and sufficient conditions of optimality for some classical scheduling problems. European Journal of Operational Research, 176, 809\u2013818.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0471-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-016-0471-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0471-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-016-0471-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T15:16:00Z","timestamp":1553613360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-016-0471-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,2]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["471"],"URL":"https:\/\/doi.org\/10.1007\/s10951-016-0471-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2016,4,2]]}}}