{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:11:14Z","timestamp":1770981074455,"version":"3.50.1"},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T00:00:00Z","timestamp":1454025600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["13-01-12108,13-08-13190,15-07-07489, 15-07-03141"],"award-info":[{"award-number":["13-01-12108,13-08-13190,15-07-07489, 15-07-03141"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001654","name":"German Academic Exchange Service London Office","doi-asserted-by":"publisher","award":["A\/14\/00328"],"award-info":[{"award-number":["A\/14\/00328"]}],"id":[{"id":"10.13039\/501100001654","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s11590-016-1003-y","type":"journal-article","created":{"date-parts":[[2016,1,29]],"date-time":"2016-01-29T07:37:10Z","timestamp":1454053030000},"page":"165-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan"],"prefix":"10.1007","volume":"11","author":[{"given":"Alexander A.","family":"Lazarev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry I.","family":"Arkhipov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,29]]},"reference":[{"issue":"6","key":"1003_CR1","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1134\/S1064230706060098","volume":"45","author":"AA Lazarev","year":"2006","unstructured":"Lazarev, A.A.: The pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine. J. Comput. Syst. Sci. Int. M. SP MAIK Nauka\/Interperiodica 45(6), 943\u2013949 (2006)","journal-title":"J. Comput. Syst. Sci. Int. M. SP MAIK Nauka\/Interperiodica"},{"issue":"5","key":"1003_CR2","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10951-011-0231-3","volume":"14","author":"SA Kravchenko","year":"2011","unstructured":"Kravchenko, S.A., Werner, F.: Parallel machine problems with equal processing times. J. Sched. 14(5), 435\u2013444 (2011)","journal-title":"J. Sched."},{"issue":"2","key":"1003_CR3","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"MR Garey","year":"1981","unstructured":"Garey, M.R., Johnson, D.S., Simons, B.B., Tarjan, R.E.: Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J. Comput. 10(2), 256\u2013269 (1981)","journal-title":"SIAM J. Comput."},{"key":"1003_CR4","doi-asserted-by":"crossref","unstructured":"Simons, B.B.: A fast algorithm for single processor scheduling. In: 19th Annual Symposium on Foundations of Computer Science (Ann Arbor, Mich., 1978)","DOI":"10.1109\/SFCS.1978.4"},{"issue":"1","key":"1003_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008215702611","volume":"13","author":"HP Benson","year":"1998","unstructured":"Benson, H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Glob. Optim. 13(1), 1\u201324 (1998)","journal-title":"J. Glob. Optim."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1003-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1003-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1003-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1003-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:44Z","timestamp":1559394704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1003-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,29]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["1003"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1003-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,29]]}}}