{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T12:42:07Z","timestamp":1780576927048,"version":"3.54.1"},"reference-count":53,"publisher":"Informa UK Limited","issue":"20","funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"publisher","award":["14-41-00039"],"award-info":[{"award-number":["14-41-00039"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Production Research"],"published-print":{"date-parts":[[2020,10,17]]},"DOI":"10.1080\/00207543.2019.1668072","type":"journal-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T06:06:01Z","timestamp":1569564361000},"page":"6159-6169","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":10,"title":["NP-completeness of cell formation problem with grouping efficacy objective"],"prefix":"10.1080","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0302-2673","authenticated-orcid":false,"given":"Mikhail V.","family":"Batsyn","sequence":"first","affiliation":[{"name":"Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, Nizhny Novgorod, Russian Federation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2999-0338","authenticated-orcid":false,"given":"Ekaterina K.","family":"Batsyna","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Informatics, National Research University Higher School of Economics, Nizhny Novgorod, Russian Federation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1681-4861","authenticated-orcid":false,"given":"Ilya S.","family":"Bychkov","sequence":"additional","affiliation":[{"name":"Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, Nizhny Novgorod, Russian Federation"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2019,9,26]]},"reference":[{"key":"CIT0001","doi-asserted-by":"crossref","unstructured":"Ailon, Nir, Noa Avigdor-Elgrabli, Edo Liberty, and Anke van Zuylen. 2011. \u201cImproved Approximation Algorithms for Bipartite Correlation Clustering.\u201d InAlgorithms \u2013 ESA 2011. 19th Annual European Symposium, edited by Camil Demetrescu, and Magn\u00fas M. Halld\u00f3rsson, Lecture Notes in Computer Science 6942, 25\u201336. Cham: Springer International.","DOI":"10.1007\/978-3-642-23719-5_3"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1083626"},{"key":"CIT0003","unstructured":"Amit, Noga. 2004. \u201cThe Bicluster Graph Editing Problem.\u201d MS diss., Tel Aviv University."},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2011.12.047"},{"key":"CIT0005","unstructured":"Ballakur, A. 1985. \u201cAn Investigation of Part Family\/Machine Group Formation for Designing Cellular Manufacturing Systems.\u201d PhD diss., University of Wisconsin-Madison."},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1080\/00207548708919868"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1213451"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1549795"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2016022"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1080\/0740817X.2014.971202"},{"key":"CIT0011","volume-title":"The Introduction of Group Technology","author":"Burbidge J. L.","year":"1975"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.01.005"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.11.009"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-014-0728-8"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1080\/00207540500478843"},{"key":"CIT0016","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.08.016"},{"key":"CIT0017","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-016-2261-x"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1109\/4235.850651"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84996-017-5"},{"key":"CIT0020","unstructured":"Drange, P\u00e5l Gr\u00f8n\u00e5s, Felix Reidl, Fernando S\u00e1nchez Villaamil, and Somnath Sikdar. 2015. \u201cFast Biclustering by Dual Parameterization.\u201d In10th International Symposium on Parameterized and Exact Computation (IPEC 2015), edited by Thore Husfeldt and Iyad Kanj, Leibniz International Proceedings in Informatics, 402\u2013413. Saarbr\u00fccken: Dagstuhl."},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2014.05.005"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1193673"},{"key":"CIT0023","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2011.588622"},{"key":"CIT0024","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187326"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.1080\/00207549108930094"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2004.07.003"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1080\/09511929408944611"},{"key":"CIT0029","doi-asserted-by":"crossref","unstructured":"Guo, Jiong, Falk H\u00fcffner, Christian Komusiewicz, and Yong Zhang. 2008. \u201cImproved Algorithms for Bicluster Editing.\u201d InTheory and Applications of Models of Computation. 5th International Conference TAMC 2008, edited by Manindra Agrawal, Dingzhu Du, Zhenhua Duan, and Angsheng Li, Lecture Notes in Computer Science 4978, 445\u2013456, Cham: Springer International.","DOI":"10.1007\/978-3-540-79228-4_39"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.08.010"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/s10287-012-0146-2"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.1080\/00207549008942706"},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1470345"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1080\/07408179308964303"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1113328"},{"key":"CIT0036","doi-asserted-by":"publisher","DOI":"10.1007\/s001700070057"},{"key":"CIT0037","volume-title":"Nauchnye Osnovy Gruppovoy Tekhnologii [Scientific Foundations of Group Technology]","author":"Mitrofanov S. P.","year":"1959"},{"issue":"11","key":"CIT0038","doi-asserted-by":"crossref","first-page":"1","DOI":"10.53829\/ntr201711fr1","volume":"15","author":"Nishino Masaaki","year":"2017","journal-title":"NTT Technical Review"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1080\/00207540110118082"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.10.016"},{"key":"CIT0041","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.05.010"},{"key":"CIT0042","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-007-9032-7"},{"key":"CIT0043","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1192299"},{"key":"CIT0044","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-010-2587-5"},{"key":"CIT0045","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00078-7"},{"key":"CIT0046","doi-asserted-by":"crossref","unstructured":"Sun, Peng, Jiong Guo, and Jan Baumbach. 2014. \u201cComplexity of Dense Bicluster Editing Problems.\u201d InComputing and Combinatorics. 20th International Conference COCOON 2014, edited by Zhipeng Cai, Alex Zelikovsky, Anu Bourgeois, Lecture Notes in Computer Science 8591, 154\u2013165. Cham: Springer International.","DOI":"10.1007\/978-3-319-08783-2_14"},{"key":"CIT0047","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gku201"},{"key":"CIT0048","doi-asserted-by":"publisher","DOI":"10.1080\/00207540701673457"},{"key":"CIT0049","doi-asserted-by":"crossref","unstructured":"Utkina, I., M. Batsyn, and E. Batsyna. 2016. \u201cA Branch and Bound Algorithm for a Fractional 0-1 Programming Problem.\u201d InDiscrete Optimization and Operations Research. 9th International Conference DOOR 2016, edited by Y. Kochetov, M. Khachay, V. Beresnev, E. Nurminski, and P. Pardalos, Lecture Notes in Computer Science 9869, 244\u2013255, Cham: Springer International.","DOI":"10.1007\/978-3-319-44914-2_20"},{"key":"CIT0050","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1444811"},{"key":"CIT0051","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.977457"},{"key":"CIT0052","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1513660"},{"key":"CIT0053","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0154-6"}],"container-title":["International Journal of Production Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207543.2019.1668072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,24]],"date-time":"2024-07-24T03:52:35Z","timestamp":1721793155000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207543.2019.1668072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,26]]},"references-count":53,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2020,10,17]]}},"alternative-id":["10.1080\/00207543.2019.1668072"],"URL":"https:\/\/doi.org\/10.1080\/00207543.2019.1668072","relation":{},"ISSN":["0020-7543","1366-588X"],"issn-type":[{"value":"0020-7543","type":"print"},{"value":"1366-588X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,26]]},"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=tprs20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tprs20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2019-01-31","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-09-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-09-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}