{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:47:51Z","timestamp":1772761671084,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642326141","type":"print"},{"value":"9783642326158","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32615-8_40","type":"book-chapter","created":{"date-parts":[[2012,7,24]],"date-time":"2012-07-24T04:50:30Z","timestamp":1343105430000},"page":"413-424","source":"Crossref","is-referenced-by-count":2,"title":["An Ant-Colony Algorithm to Transform Jobshops into Flowshops: A Case of Shortest-Common-Supersequence Stringology Problem"],"prefix":"10.1007","author":[{"given":"Suchithra","family":"Rajendran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chandrasekharan","family":"Rajendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Ziegler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24816-3","volume-title":"Supply Chain Management based on SAP Systems","author":"G. Knolmayer","year":"2002","unstructured":"Knolmayer, G., Mertens, P., Zeier, A.: Supply Chain Management based on SAP Systems. Springer, Berlin (2002)"},{"key":"40_CR2","first-page":"287","volume":"32","author":"A. Kimms","year":"2000","unstructured":"Kimms, A.: Minimal investment budgets for flow line configuration. IIE Transactions\u00a032, 287\u2013298 (2000)","journal-title":"IIE Transactions"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1080\/09537280110069748","volume":"13","author":"J.M. Framinan","year":"2002","unstructured":"Framinan, J.M., Ruiz-Usano, R.: On transforming job-shops into flow-shops. Production Planning and Control\u00a013, 166\u2013174 (2002)","journal-title":"Production Planning and Control"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1080\/07408170590918191","volume":"37","author":"J.M. Framinan","year":"2005","unstructured":"Framinan, J.M.: Efficient heuristic approaches to transform job shops into flow shops. IIE Transactions\u00a037, 441\u2013451 (2005)","journal-title":"IIE Transactions"},{"key":"40_CR5","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(81)90075-X","volume":"16","author":"K.J. Raiha","year":"1981","unstructured":"Raiha, K.J., Ukkonen, E.: The shortest common supersequence problem over binary alphabet is NP-complete. Theoretical Computer Science\u00a016, 187\u2013198 (1981)","journal-title":"Theoretical Computer Science"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/BF01075212","volume":"25","author":"V.G. Timkovsky","year":"1990","unstructured":"Timkovsky, V.G.: Complexity of common subsequences and supersequences problems and related problems. Cybernetics\u00a025, 565\u2013580 (1990)","journal-title":"Cybernetics"},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2006.10.001","volume":"52","author":"J.M. Framinan","year":"2007","unstructured":"Framinan, J.M.: An adaptive branch and bound approach for transforming job shops into flow shops. Computers & Industrial Engineering\u00a052, 1\u201310 (2007)","journal-title":"Computers & Industrial Engineering"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01545528","volume":"20","author":"J. Branke","year":"1998","unstructured":"Branke, J., Middendorf, M., Schneider, F.: Improved heuristics and a genetic algorithm for finding short supersequences. OR Spektrum\u00a020, 39\u201346 (1998)","journal-title":"OR Spektrum"},{"key":"40_CR9","volume-title":"New Ideas in Optimization","author":"R. Michel","year":"1999","unstructured":"Michel, R., Middendorf, M.: An ACO algorithm for the shortest common supersequence problem. In: New Ideas in Optimization. McGraw-Hill, Maidenhead (1999)"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C. Rajendran","year":"2004","unstructured":"Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. European Journal of Operational Research\u00a0155, 426\u2013438 (2004)","journal-title":"European Journal of Operational Research"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1016\/j.omega.2004.12.006","volume":"34","author":"R. Ruiz","year":"2006","unstructured":"Ruiz, R., Maroto, C., Alcaraz, J.: Two new robust genetic algorithms for the flowshop scheduling problem. Omega\u00a034, 461\u2013476 (2006)","journal-title":"Omega"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R. Ruiz","year":"2007","unstructured":"Ruiz, R., Stuetzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operations Research\u00a0177, 2033\u20132049 (2007)","journal-title":"European Journal of Operations Research"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Bio-Inspired Models of Network, Information, and Computing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32615-8_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T02:14:47Z","timestamp":1556936087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32615-8_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326141","9783642326158"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32615-8_40","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}