{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:56:50Z","timestamp":1772762210872,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,21]],"date-time":"2006-12-21T00:00:00Z","timestamp":1166659200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,2,8]]},"DOI":"10.1007\/s10479-006-0151-3","type":"journal-article","created":{"date-parts":[[2006,12,20]],"date-time":"2006-12-20T16:51:36Z","timestamp":1166633496000},"page":"31-46","source":"Crossref","is-referenced-by-count":10,"title":["Minimum cost multi-product flow lines"],"prefix":"10.1007","volume":"150","author":[{"given":"Arianna","family":"Alfieri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaia","family":"Nicosia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,21]]},"reference":[{"key":"151_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/70.345934","volume":"11","author":"A. Agnetis","year":"1995","unstructured":"Agnetis, A., C. Arbib, M. Lucertini, and F. Nicol\u00f2. (1995). \u201cTask Assignment and Sub-Assembly Scheduling in Flexible Assembly Lines.\u201d IEEE Transactions on Robotics and Automation, 11, 1\u201320.","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"151_CR2","volume-title":"Modeling and Analysis of Manufacturing Systems","author":"R.G. Askin","year":"1993","unstructured":"Askin, R.G. and C.R. Standridge. (1993). Modeling and Analysis of Manufacturing Systems. Wiley: New York."},{"key":"151_CR3","first-page":"319","volume":"30","author":"R.G. Askin","year":"1998","unstructured":"Askin, R.G. and M. Zhou. (1998). \u201cFormation of Independent Flow-Line Cells Based on Operation Requirements and Machine Capabilities.\u201d IIE Transaction, 30, 319\u2013329.","journal-title":"IIE Transaction"},{"key":"151_CR4","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1016\/j.ejor.2004.07.023","volume":"168","author":"C. Becker","year":"2003","unstructured":"Becker, C. and A. Scholl. (2003). \u201cA Survey on Problems and Methods in Generalized Assembly Line Balancing.\u201d European Journal of Operational Research, 168, 694\u2013715.","journal-title":"European Journal of Operational Research"},{"key":"151_CR5","first-page":"585","volume":"32","author":"J. Bukchin","year":"2000","unstructured":"Bukchin, J. and M. Tzur. (2000). \u201cDesign of Flexible Assembly Line to Minimize Equipment Cost.\u201d IIE Transactions, 32, 585\u2013598.","journal-title":"IIE Transactions"},{"key":"151_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1287\/mnsc.36.4.449","volume":"36","author":"C. Fine","year":"1990","unstructured":"Fine, C. and R. Freund. (1990). \u201cOptimal Investment in Product-Flexible Manufacturing Capacity.\u201d Management Science, 36, 449\u2013466.","journal-title":"Management Science"},{"key":"151_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0004-3702(92)90016-Q","volume":"57","author":"D.E. Foulser","year":"1992","unstructured":"Foulser, D.E., M. Li, and Q. Yang. (1992). \u201cTheory and Algorithms for Plan Merging.\u201d Artificial Intelligence, 57, 143\u2013181.","journal-title":"Artificial Intelligence"},{"key":"151_CR8","unstructured":"Fraser, C.B. (1995). Subsequences and Supersequences of String. PhD. Thesis, University of Glasgow, UK."},{"key":"151_CR9","first-page":"303","volume":"2","author":"C.B. Fraser","year":"1995","unstructured":"Fraser, C.B. and R.W. Irving. (1995). \u201cApproximation Algorithms for the Shortest Common Supersequence.\u201d Nordic Journal of Computing, 2, 303\u2013325.","journal-title":"Nordic Journal of Computing"},{"key":"151_CR10","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., N.J. Nilsson, and B. Raphael. (1968). \u201cA Formal Basis for the Heuristic Determination of Minimum Cost Paths.\u201d IEEE Transactions on Systems and Cybernetics, 4, 100\u2013108.","journal-title":"IEEE Transactions on Systems and Cybernetics"},{"key":"151_CR11","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1137\/S009753979223842X","volume":"24","author":"T. Jiang","year":"1995","unstructured":"Jiang, T. and M. Li. (1995). \u201cOn the Approximation of Shortest Common Supersequences and Longest Common Subsequences.\u201d SIAM Journal on Computing, 24, 1122\u20131139.","journal-title":"SIAM Journal on Computing"},{"key":"151_CR12","first-page":"287","volume":"32","author":"A. Kimms","year":"2000","unstructured":"Kimms, A. (2000). \u201cMinimal Investment Budgets for Flow Line Configuration.\u201d IIE Transactions, 32, 287\u2013298.","journal-title":"IIE Transactions"},{"key":"151_CR13","unstructured":"Lucertini, M. and G. Nicosia. (1997). \u201cOn a Generalized Version of the Shortest Common Supersequence Problem.\u201d Technical Report n. 275, Dipartimento di Informatica, Sistemi e Produzione\u2014Centro \u201cVito Volterra\u201d, Universit\u00e0 di Roma \u201cTor Vergata\u201d."},{"key":"151_CR14","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"Maier, D. (1978). \u201cThe Complexity of Some Problems on Subsequences and Supersequences.\u201d Journal of ACM, 25, 322\u2013336.","journal-title":"Journal of ACM"},{"key":"151_CR15","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(92)00074-2","volume":"125","author":"M. Middendorf","year":"1994","unstructured":"Middendorf, M. (1994). \u201cMore on the Complexity of Common Superstring and Supersequence Problems.\u201d Theoretical Computer Science, 125, 205\u2013228.","journal-title":"Theoretical Computer Science"},{"key":"151_CR16","doi-asserted-by":"crossref","first-page":"2021","DOI":"10.1016\/S0304-3975(02)00085-3","volume":"290","author":"G. Nicosia","year":"2003","unstructured":"Nicosia, G. and G. Oriolo. (2003). \u201cAn Approximate A * Algorithm and its Application to the SCS Problem.\u201d Theoretical Computer Science, 290, 2021\u20132029.","journal-title":"Theoretical Computer Science"},{"key":"151_CR17","volume-title":"Problem Solving Methods in Artificial Intelligence","author":"N.J. Nilsson","year":"1971","unstructured":"Nilsson, N.J. (1971). Problem Solving Methods in Artificial Intelligence. McGraw-Hill: New York."},{"key":"151_CR18","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1287\/mnsc.29.7.817","volume":"29","author":"P.A. Pinto","year":"1983","unstructured":"Pinto, P.A., D.G. Dannenbring, and B.M. Khumawala. (1983). \u201cAssembly Line Balancing with Processing Alternatives: An Application.\u201d Management Science, 29, 817\u2013830.","journal-title":"Management Science"},{"key":"151_CR19","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","volume":"16","author":"K. R\u00e4ih\u00e4","year":"1981","unstructured":"R\u00e4ih\u00e4, K. and E. Ukkonen. (1981), \u201cThe Shortest Common Supersequence Problem Over Binary Alphabet is NP-Complete.\u201d Theoretical Computer Science, 16, 187\u2013198.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"151_CR20","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/322234.322237","volume":"28","author":"M. Rodeh","year":"1981","unstructured":"Rodeh, M., V.R. Pratt, and S. Even. (1981). \u201cLinear Algorithm for Data Compression via String Matching.\u201d Journal of ACM, 28(1), 16\u201324.","journal-title":"Journal of ACM"},{"key":"151_CR21","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/BF01075212","volume":"25","author":"V.G. Timkovskii","year":"1990","unstructured":"Timkovskii, V.G. (1990). \u201cComplexity of Common Subsequence and Supersequence Problems and Related Problems.\u201d Cybernetics, 25, 565\u2013580.","journal-title":"Cybernetics"},{"key":"151_CR22","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/ijoc.1020.0025","volume":"16","author":"W.E. Wilhelm","year":"2004","unstructured":"Wilhelm, W.E. and R. Gadidov. (2004). \u201cA Branch-and-Cut Approach for a Generic Multiple-Product Assembly-System Design Problem.\u201d INFORMS Journal on Computing, 16, 39\u201355.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0151-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-006-0151-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-006-0151-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:37Z","timestamp":1559153257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-006-0151-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,21]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2,8]]}},"alternative-id":["151"],"URL":"https:\/\/doi.org\/10.1007\/s10479-006-0151-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,21]]}}}