{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T04:05:15Z","timestamp":1783397115263,"version":"3.54.6"},"reference-count":24,"publisher":"Informa UK Limited","issue":"4","funder":[{"DOI":"10.13039\/501100003182","name":"SB RAS","doi-asserted-by":"publisher","award":["I.5.1"],"award-info":[{"award-number":["I.5.1"]}],"id":[{"id":"10.13039\/501100003182","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003182","name":"SB RAS","doi-asserted-by":"publisher","award":["0314-2019-0014"],"award-info":[{"award-number":["0314-2019-0014"]}],"id":[{"id":"10.13039\/501100003182","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["17-01-00170"],"award-info":[{"award-number":["17-01-00170"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["17-07-00513"],"award-info":[{"award-number":["17-07-00513"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["18-01-00747"],"award-info":[{"award-number":["18-01-00747"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2021,7,4]]},"DOI":"10.1080\/10556788.2020.1734802","type":"journal-article","created":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T10:57:10Z","timestamp":1583751430000},"page":"821-841","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":7,"title":["Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass"],"prefix":"10.1080","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5671-8562","authenticated-orcid":false,"given":"I. D.","family":"Chernykh","sequence":"first","affiliation":[{"name":"Discrete Optimization in Operations Research Lab, Sobolev Institute of Mathematics, Novosibirsk, Russia"},{"name":"Department of Mathematics and Mechanics, Novosibirsk State University, Novosibirsk, Russia"},{"name":"Department of Algebra and Mathematical Logic, Novosibirsk Technical State University, Novosibirsk, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9390-4935","authenticated-orcid":false,"given":"E. V.","family":"Lgotina","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Mechanics, Novosibirsk State University, Novosibirsk, Russia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2020,3,9]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.30.4.303"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1287\/opre.47.1.165"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.06.050"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.01.034"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1023\/B:ANOR.0000030683.64615.c8"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_22"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44914-2_23"},{"key":"CIT0008","unstructured":"I. Chernykh and A. Pyatkin, Refinement of the optima localization for the two-machine routing open shop, in Proceedings of the 8th International Conference on Optimization and Applications (OPTIMA17). Vol. 1987. CEUR Workshop Proceedings (1987). 2017, pp. 131\u2013138."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-976-7_39"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-87358-3.50012-2"},{"key":"CIT0011","doi-asserted-by":"crossref","unstructured":"M. Golovachev and A.V. Pyatkin, Routing open shop with two nodes, unit processing times and equal number of jobs and machines, in Mathematical Optimization Theory and Operations Research, MOTOR 2019, Ekaterinburg, Russia, July 8\u201312, 2019, Proceedings, M. Khachay, Y. Kochetov, and P. Pardalos, eds., Lecture Notes in Computer Science Vol. 11548. 2019, pp. 264\u2013276.","DOI":"10.1007\/978-3-030-22629-9_19"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1145\/321978.321985"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1016\/0895-7177(93)90196-6"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1134\/S1990478912030064"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2014051"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018986731638"},{"key":"CIT0017","volume-title":"Sequencing and Scheduling: Algorithms and Complexity. Logistics of Production and Inventory","author":"Lawler E.L.","year":"1993"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20323"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-7801-0_9"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00115-8"},{"key":"CIT0021","doi-asserted-by":"crossref","unstructured":"R. van Bevern and A.V. Pyatkin, Completing partial schedules for open shop with unit processing times and routing, in Proceedings of the 11th International Computer Science Symposium in Russia (CSR16). Lecture Notes in Computer Science, Vol. 9691. 2016, pp. 73\u201387.","DOI":"10.1007\/978-3-319-34171-2_6"},{"key":"CIT0022","first-page":"42","volume":"16","author":"van Bevern R.","year":"2019","journal-title":"Siberian Electron. Math. Rep."},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.2.288"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2010.01.066"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556788.2020.1734802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T12:13:02Z","timestamp":1662379982000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556788.2020.1734802"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,9]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7,4]]}},"alternative-id":["10.1080\/10556788.2020.1734802"],"URL":"https:\/\/doi.org\/10.1080\/10556788.2020.1734802","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,9]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=goms20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-01-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-02-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}