{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T03:14:24Z","timestamp":1704078864282},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0377-2217(97)00143-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:15:26Z","timestamp":1027610126000},"page":"686-702","source":"Crossref","is-referenced-by-count":3,"title":["A cell formation algorithm: Hypergraph approximation - Cut tree"],"prefix":"10.1016","volume":"109","author":[{"given":"Levent","family":"Kandiller","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00143-4_BIB1","series-title":"Hypergraphs","author":"Berge","year":"1989"},{"key":"10.1016\/S0377-2217(97)00143-4_BIB2","series-title":"Technical Report ORWP 92\/07","article-title":"On an optimization problem occurring in FMSs: A hypergraph theoretical formulation","author":"de Werra","year":"1993"},{"key":"10.1016\/S0377-2217(97)00143-4_BIB3","first-page":"77","article-title":"A generic cell formation algorithm","volume":"vol. 1","author":"Kandiller","year":"1993"},{"key":"10.1016\/S0377-2217(97)00143-4_BIB4","series-title":"Applicable Theory in Computer Science Series","article-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"Lengauer","year":"1990"},{"key":"10.1016\/S0377-2217(97)00143-4_BIB5","series-title":"Proceedings of the Fifth Annual Design Automation Workshop","first-page":"16.0","article-title":"Efficient partitioning of components","author":"Charney","year":"1968"},{"key":"10.1016\/S0377-2217(97)00143-4_BIB6","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1137\/1014035","article-title":"A review of the placement and quadratic assignment problems","volume":"14","author":"Hanan","year":"1972","journal-title":"SIAM Review"},{"key":"10.1016\/S0377-2217(97)00143-4_BIB7","series-title":"Physical design automation of VLSI systems","article-title":"Logic partitioning","author":"Donath","year":"1988"},{"key":"10.1016\/S0377-2217(97)00143-4_BIB8","series-title":"Technical Report","article-title":"A new approximation technique for hypergraph partitioning problems","author":"Hadley","year":"1989"},{"issue":"4","key":"10.1016\/S0377-2217(97)00143-4_BIB9","first-page":"551","article-title":"Multi-terminal network flows","volume":"9","author":"Gomory","year":"1961","journal-title":"J. SIAM"},{"key":"10.1016\/S0377-2217(97)00143-4_BIB10","series-title":"Proceedings of the 17th International Colloquium on Automata Languages and Programming","first-page":"235","article-title":"Can a maximum flow be computed in O(nm) time?","author":"Cherian","year":"1998"},{"issue":"10","key":"10.1016\/S0377-2217(97)00143-4_BIB11","doi-asserted-by":"crossref","first-page":"2394","DOI":"10.1080\/00207549408957075","article-title":"A comparative study of cell formation in cellular manufacturing systems","volume":"32","author":"Kandiller","year":"1994","journal-title":"International Journal of Production Research"},{"issue":"5","key":"10.1016\/S0377-2217(97)00143-4_BIB12","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1080\/00207548508904757","article-title":"Machine-component group formation: An heuristic method for flexible production cells and flexible manufacturing systems","volume":"23","author":"Purcheck","year":"1985","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00143-4_BIB13","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1080\/00207548008919662","article-title":"Machine-component grouping in production flow analysis: An approach using a rank order clustering algorithm","volume":"18","author":"King","year":"1980","journal-title":"International Journal of Production Research"},{"issue":"5","key":"10.1016\/S0377-2217(97)00143-4_BIB14","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1080\/00207548608919798","article-title":"Modroc: An extension of rank order clustering for group technology","volume":"24","author":"Chandrasekharan","year":"1986","journal-title":"International Journal of Production Research"},{"issue":"6","key":"10.1016\/S0377-2217(97)00143-4_BIB15","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1080\/00207548408942513","article-title":"Machine-component cell formation in group technology: Mace","volume":"22","author":"Waghodekar","year":"1984","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00143-4_BIB16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0278-6125(87)90035-5","article-title":"Efficient solving of the group technology problem","volume":"6","author":"Kusiak","year":"1987","journal-title":"Journal of Manufacturing Systems"},{"issue":"2","key":"10.1016\/S0377-2217(97)00143-4_BIB17","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1080\/00207548608919741","article-title":"An ideal seed non-hierarchical clustering algorithm for cellular manufacturing","volume":"24","author":"Chandrasekharan","year":"1986","journal-title":"International Journal of Production Research"},{"issue":"6","key":"10.1016\/S0377-2217(97)00143-4_BIB18","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1080\/00207548708919880","article-title":"Zodiac - an algorithm for concurrent formation of part-families and machine-cells","volume":"25","author":"Chandrasekharan","year":"1987","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00143-4_BIB19","series-title":"Flexible Manufacturing Systems: Methods and Studies","article-title":"A new graph theory approach for forming machine cells in cellular production systems","author":"Faber","year":"1986"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001434?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001434?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T10:57:25Z","timestamp":1556362645000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797001434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0377221797001434"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00143-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}