{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:40:44Z","timestamp":1759848044927},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,8,5]],"date-time":"2009-08-05T00:00:00Z","timestamp":1249430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s10951-009-0117-9","type":"journal-article","created":{"date-parts":[[2009,8,4]],"date-time":"2009-08-04T15:56:30Z","timestamp":1249401390000},"page":"475-488","source":"Crossref","is-referenced-by-count":32,"title":["Inverse scheduling with maximum lateness objective"],"prefix":"10.1007","volume":"12","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":[[2009,8,5]]},"reference":[{"key":"117_CR1","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"R. K. Ahuja","year":"2001","unstructured":"Ahuja, R. K., & Orlin, J. B. (2001). Inverse optimization. Operations Research, 49, 771\u2013783.","journal-title":"Operations Research"},{"key":"117_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms. Berlin: Springer."},{"key":"117_CR3","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0020-0190(98)00131-8","volume":"67","author":"K. Choi","year":"1998","unstructured":"Choi, K., Jung, G., Kim, T., & Jung, S. (1998). Real-time scheduling algorithm for minimizing maximum weighted error with O(Nlog\u2009N+cN) complexity. Information Processing Letters, 67, 311\u2013315.","journal-title":"Information Processing Letters"},{"key":"117_CR4","doi-asserted-by":"crossref","first-page":"887","DOI":"10.1016\/j.ejor.2004.07.059","volume":"170","author":"C. W. Duin","year":"2006","unstructured":"Duin, C. W., & Volgenant, A. (2006). Some inverse optimization problem under the Hamming distance. European Journal of Operational Research, 170, 887\u2013899.","journal-title":"European Journal of Operational Research"},{"key":"117_CR5","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":"117_CR6","first-page":"269","volume":"69","author":"D. S. Hochbaum","year":"1995","unstructured":"Hochbaum, D. S., & Hong, S.-P. (1995). About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Mathematical Programming, 69, 269\u2013309.","journal-title":"Mathematical Programming"},{"key":"117_CR7","unstructured":"Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43). Management Science Research Project, University of California, Los Angeles, USA."},{"key":"117_CR8","first-page":"159","volume-title":"Handbook of combinatorial optimization","author":"N. Katoh","year":"1998","unstructured":"Katoh, N., & Ibaraki, T. (1998). Resource allocation problems. In D.-Z. Du & P. M. Pardalos (Eds.) Handbook of combinatorial optimization (Vol. 2, pp. 159\u2013260). Norwell: Kluwer Academic."},{"key":"117_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"},{"key":"117_CR10","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10878-006-9006-8","volume":"12","author":"L. Liu","year":"2006","unstructured":"Liu, L., & Zhang, J. (2006). Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization, 12, 395\u2013408.","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0117-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0117-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0117-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:42Z","timestamp":1559468382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0117-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,5]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["117"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0117-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,5]]}}}