{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:50Z","timestamp":1740145190956,"version":"3.37.3"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["399\/17"],"award-info":[{"award-number":["399\/17"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006221","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2018095"],"award-info":[{"award-number":["2018095"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11590-021-01772-7","type":"journal-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T14:03:58Z","timestamp":1624889038000},"page":"1181-1196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6098-9792","authenticated-orcid":false,"given":"Nir","family":"Halman","sequence":"first","affiliation":[]},{"given":"Uriel","family":"Vinetz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,28]]},"reference":[{"issue":"2","key":"1772_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1080\/00207168808803664","volume":"25","author":"A Amir","year":"1988","unstructured":"Amir, A., Kaplan, E.H.: Relocation problems are hard. Int. J. Comput. Math. 25(2), 101\u2013110 (1988)","journal-title":"Int. J. Comput. Math."},{"key":"1772_CR2","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1137\/130925153","volume":"28","author":"N Halman","year":"2014","unstructured":"Halman, N., Klabjan, D., Li, C.-L., Orlin, J., Simchi-Levi, D.: Fully polynomial time approximation schemes for stochastic dynamic programs. SIAM J. Discrete Math. 28, 1725\u20131796 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"1772_CR3","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1287\/moor.1090.0391","volume":"34","author":"N Halman","year":"2009","unstructured":"Halman, N., Klabjan, D., Mostagir, M., Orlin, J., Simchi-Levi, D.: A fully polynomial time approximation scheme for single-item stochastic inventory control with discrete demand. Math. Oper. Res. 34, 674\u2013685 (2009)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1772_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1177\/239980838601300101","volume":"13","author":"EH Kaplan","year":"1986","unstructured":"Kaplan, E.H.: Relocation models for public housing redevelopment programs. Environ. Plan. B Plan. Des. 13(1), 5\u201319 (1986)","journal-title":"Environ. Plan. B Plan. Des."},{"issue":"4","key":"1772_CR5","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.disopt.2006.06.003","volume":"3","author":"AV Kononov","year":"2006","unstructured":"Kononov, A.V., Lin, B.M.T.: On relocation problems with multiple identical working crews. Discrete Optim. 3(4), 366\u2013381 (2006)","journal-title":"Discrete Optim."},{"issue":"2","key":"1772_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10951-009-0151-7","volume":"13","author":"AV Kononov","year":"2010","unstructured":"Kononov, A.V., Lin, B.M.T.: Minimizing the total weighted completion time in the relocation problem. J. Sched. 13(2), 123\u2013129 (2010)","journal-title":"J. Sched."},{"issue":"2","key":"1772_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10951-015-0455-8","volume":"19","author":"BMT Lin","year":"2016","unstructured":"Lin, B.M.T., Hwang, F.J., Kononov, A.: Relocation scheduling subject to fixed processing sequences. J. Sched. 19(2), 153\u2013163 (2016)","journal-title":"J. Sched."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01772-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01772-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01772-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T12:44:08Z","timestamp":1650113048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01772-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1772"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01772-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2021,6,28]]},"assertion":[{"value":"10 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}