{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:42:23Z","timestamp":1760730143004},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,3,5]],"date-time":"2010-03-05T00:00:00Z","timestamp":1267747200000},"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":[[2011,6]]},"DOI":"10.1007\/s10951-010-0168-y","type":"journal-article","created":{"date-parts":[[2010,3,4]],"date-time":"2010-03-04T17:46:13Z","timestamp":1267724773000},"page":"239-256","source":"Crossref","is-referenced-by-count":27,"title":["Inverse scheduling: two-machine flow-shop problem"],"prefix":"10.1007","volume":"14","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":[[2010,3,5]]},"reference":[{"key":"168_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":"168_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":"168_CR3","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1007\/s10951-009-0117-9","volume":"12","author":"P. Brucker","year":"2009","unstructured":"Brucker, P., & Shakhlevich, N. V. (2009). Inverse scheduling with maximum lateness objective. Journal of Scheduling, 12, 475\u2013488.","journal-title":"Journal of Scheduling"},{"key":"168_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 problems under the Hamming distance. European Journal of Operational Research, 170, 887\u2013899.","journal-title":"European Journal of Operational Research"},{"key":"168_CR5","unstructured":"G\u0171ller, C., & Hamacher, H. W. (2010, to appear). Capacity inverse minimum cost flow problem. Journal of Combinatorial Optimization."},{"key":"168_CR6","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":"168_CR7","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":"168_CR8","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S. M. Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). On two and three-stage production scheduling with setup times included. Naval Research Logistics Quarterly, 1, 61\u201367.","journal-title":"Naval Research Logistics Quarterly"},{"key":"168_CR9","first-page":"159","volume-title":"Handbook of combinatorial optimization","author":"N. Katoh","year":"1998","unstructured":"Katoh, N., & Ibaraki, T. (1998). Resource allocation problems. In Du, D.-Z., & Pardalos, P. M. (Eds.), Handbook of combinatorial optimization (Vol.\u00a02, pp. 159\u2013260). Dordrecht: Kluwer Academic."},{"key":"168_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1504\/IJSOM.2005.006316","volume":"1","author":"C. Koulamas","year":"2005","unstructured":"Koulamas, C. (2005). Inverse, scheduling with controllable job parameters. International Journal of Services and Operations Management, 1, 35\u201343.","journal-title":"International Journal of Services and Operations Management"},{"key":"168_CR11","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":"168_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10878-006-9006-8","volume":"12","author":"L. C. Liu","year":"2006","unstructured":"Liu, L. C., & Zhang, J. Z. (2006). Inverse maximum flow problems under the weighted Hamming distance. Journal of Combinatorial Optimization, 12, 395\u2013408.","journal-title":"Journal of Combinatorial Optimization"},{"key":"168_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717921","volume-title":"Inverse problem theory and methods for model parameter estimation","author":"A. Tarantola","year":"2005","unstructured":"Tarantola, A. (2005). Inverse problem theory and methods for model parameter estimation. Philadelphia: SIAM."},{"key":"168_CR14","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.orl.2008.12.001","volume":"37","author":"L. Z. Wang","year":"2009","unstructured":"Wang, L. Z. (2009). Cutting plane algorithms for the inverse mixed integer linear programming problem. Operations Research Letters, 37, 114\u2013116.","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0168-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-010-0168-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-010-0168-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-010-0168-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["168"],"URL":"https:\/\/doi.org\/10.1007\/s10951-010-0168-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,5]]}}}