{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:43:04Z","timestamp":1778906584855,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,11,27]],"date-time":"2012-11-27T00:00:00Z","timestamp":1353974400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10845-012-0716-8","type":"journal-article","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T08:11:21Z","timestamp":1353917481000},"page":"739-753","source":"Crossref","is-referenced-by-count":16,"title":["Differential evolution variants to schedule flexible assembly lines"],"prefix":"10.1007","volume":"25","author":[{"given":"Lui Wen Han","family":"Vincent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. G.","family":"Ponnambalam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Kanagaraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,27]]},"reference":[{"key":"716_CR1","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1002\/jos.118","volume":"5","author":"J Blazewicz","year":"2002","unstructured":"Blazewicz, J.,& Kovalyov, M. (2002). The complexity of two group scheduling problems. Journal of Scheduling, 5, 477\u2013485.","journal-title":"Journal of Scheduling"},{"key":"716_CR2","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/ICSMC.2000.885012","volume":"1","author":"G Celano","year":"2000","unstructured":"Celano, G., Costa, A., Fischera, S.,& Perrone, G. (2000). Fuzzy scheduling of a flexible assembly line through an evolutionary algorithm. IEEE International Conference on Systems, Manufacturing, and Cybernetics, 1, 328\u2013333.","journal-title":"IEEE International Conference on Systems, Manufacturing, and Cybernetics"},{"key":"716_CR3","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1007\/s001700200095","volume":"19","author":"F Chan","year":"2002","unstructured":"Chan, F., Chan, H.,& Lau, H. (2002). The state of the art in simulation study on FMS scheduling: A comprehensive survey. The International Journal, Advanced Manufacturing Technology, 19, 830\u2013849.","journal-title":"The International Journal, Advanced Manufacturing Technology"},{"key":"716_CR4","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/TEVC.2008.2009457","volume":"13","author":"S Das","year":"2009","unstructured":"Das, S., Abraham, A., Chakraborty, U. K.,& Konar, A. (2009). Differential evolution using a neighourhood-based mutation operator. IEEE Transactions on Evolutionary Computation, 13, 526\u2013553.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"716_CR5","unstructured":"Das, S., Chakraborty, U.K.,& Konar, A. (2005). Two improved differential evoluion schemes for faster global search. In Genetic and Evolutionary Computation Conference, pp. 991\u2013998."},{"key":"716_CR6","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2011","unstructured":"Das, S.,& Suganthan, P. (2011). Differential evolution: A survey of the state-of-the-art. IEEE Transactions of Evolutionary Computation, 15, 4\u201331.","journal-title":"IEEE Transactions of Evolutionary Computation"},{"key":"716_CR7","doi-asserted-by":"crossref","first-page":"1903","DOI":"10.1080\/00207548808948004","volume":"26","author":"M Donath","year":"1988","unstructured":"Donath, M.,& Graves, R. (1988). Flexible assembly systems: An approach for near real-time scheduling and routeing of multiple products. International Journal of Production Research, 26, 1903\u20131919.","journal-title":"International Journal of Production Research"},{"key":"716_CR8","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0278-6125(89)90017-4","volume":"8","author":"M Donath","year":"1989","unstructured":"Donath, M., Graves, R.,& Carlson, D. (1989). Flexible assembly systems: The scheduling problem for multiple products. Journal of Manufacturing Systems, 8, 27\u201334.","journal-title":"Journal of Manufacturing Systems"},{"issue":"8","key":"716_CR9","doi-asserted-by":"crossref","first-page":"830","DOI":"10.1057\/palgrave.jors.2601766","volume":"55","author":"O Etiler","year":"2004","unstructured":"Etiler, O., Toklu, B., Atak, M.,& Wilson, J. (2004). A genetic algorithm for flow shop scheduling problems. Journal of the Operational Research Society, 55(8), 830\u2013835.","journal-title":"Journal of the Operational Research Society"},{"key":"716_CR10","doi-asserted-by":"crossref","first-page":"4268","DOI":"10.1016\/j.eswa.2008.03.023","volume":"36","author":"Z Guo","year":"2009","unstructured":"Guo, Z., Wong, W., Leung, S.,& Fan, J. (2009). Intelligent production control decision support system for flexible assembly lines. Expert Systems with Applications, 36, 4268\u20134277.","journal-title":"Expert Systems with Applications"},{"key":"716_CR11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s00170-006-0818-6","volume":"36","author":"Z Guo","year":"2008","unstructured":"Guo, Z., Wong, W., Leung, S.,& Fan, J. (2008a). A genetic algorithm-based optimization model for scheduling flexible assembly lines. The International Journal, Advanced Manufacturing Technology, 36, 156\u2013168.","journal-title":"The International Journal, Advanced Manufacturing Technology"},{"key":"716_CR12","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/TSMCC.2007.913912","volume":"38","author":"Z Guo","year":"2008","unstructured":"Guo, Z., Wong, W., Leung, S., Fan, J.,& Chan, S. (2008b). A genetic algorithm-based optimization model for solving the flexible assembly line balancing problem with work sharing and workstation revisiting. IEEE Transactions on Systems, Manufacturing and Cybernetics, 38, 218\u2013228.","journal-title":"IEEE Transactions on Systems, Manufacturing and Cybernetics"},{"key":"716_CR13","unstructured":"Jie, G., Mitsuo, G.,& Linyan, S. (2006). A hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problemA hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problem. GECCO, 2006, 1157\u20131164."},{"key":"716_CR14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P Laarhoven","year":"1990","unstructured":"Laarhoven, P., Aarts, E.,& Lenstra, J. K. (1990). Job shop scheduling by simulated annealing. Journal of Operations Research, 40, 113\u2013125.","journal-title":"Journal of Operations Research"},{"key":"716_CR15","doi-asserted-by":"crossref","unstructured":"Liao, C.-J., Tseng, C.-T.,& Luarn, P. (2005). A discrete version of particle swarm optimization for flowshop scheduling problems. Computers& Operations Research, 34(10), 3099\u20133111.","DOI":"10.1016\/j.cor.2005.11.017"},{"key":"716_CR16","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/S0305-0548(98)00081-1","volume":"26","author":"C-C Liaw","year":"1999","unstructured":"Liaw, C.-C. (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers& Operations Research, 26, 679\u2013693.","journal-title":"Computers& Operations Research"},{"key":"716_CR17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/10732-006-3750-x","volume":"12","author":"A Nearchou","year":"2006","unstructured":"Nearchou, A.,& Omirou, S. (2006). Differential evolution for sequencing and scheduling optimization. Journal of Heuristics, 12, 395\u2013411.","journal-title":"Journal of Heuristics"},{"key":"716_CR18","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"Q-K Pan","year":"2011","unstructured":"Pan, Q.-K., Tasgetiren, M. F., Suganthan, P.,& Chua, T. (2011). A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Information Sciences, 181, 2455\u20132468.","journal-title":"Information Sciences"},{"key":"716_CR19","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajendran","year":"2004","unstructured":"Rajendran, C.,& Ziegler, H. (2004). Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. European Journal of Operational Research, 155, 426\u2013438.","journal-title":"European Journal of Operational Research"},{"key":"716_CR20","doi-asserted-by":"crossref","unstructured":"Rao, R. V., Savsani, V. J.,& Vakharia, D. P. (2011). Teaching-learning-based optimization: A novel method for constrained mechanical design optimization problems. Computer-Aided Design, 43, 303\u2013315.","DOI":"10.1016\/j.cad.2010.12.015"},{"key":"716_CR21","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1016\/j.ins.2009.03.004","volume":"179","author":"E Rashedi","year":"2009","unstructured":"Rashedi, E., Nezamabadi-pour, H.,& Saryazdi, S. (2009). GSA: A gravitational search algorithm. Journal of Information Sciences, 179, 2232\u20132248.","journal-title":"Journal of Information Sciences"},{"key":"716_CR22","doi-asserted-by":"crossref","unstructured":"Salehi, M. (2011). Optimization process planning using hybrid genetic algorithm and intelligent search for job shop machining. Journal of Intelligent Manufacturing, 22, 643\u2013652.","DOI":"10.1007\/s10845-010-0382-7"},{"key":"716_CR23","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0925-5273(99)00043-2","volume":"64","author":"T Sawik","year":"2000","unstructured":"Sawik, T. (2000). An LP-based approach for loading and routing in a flexible assembly line. International Journal of Production Economics, 64, 49\u201358.","journal-title":"International Journal of Production Economics"},{"key":"716_CR24","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1504\/IJCSE.2011.041221","volume":"6","author":"H Shah-Hosseini","year":"2011","unstructured":"Shah-Hosseini, H. (2011). Principal components analysis by the galaxy-based search algorithm: A novel metaheuristic for continuous optimisation. International Journal of Computational Science and Engineering, 6, 132\u2013140.","journal-title":"International Journal of Computational Science and Engineering"},{"key":"716_CR25","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R.,& Price, K. (1997). Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11, 341\u2013359.","journal-title":"Journal of Global Optimization"},{"issue":"2011","key":"716_CR26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/978-3-642-27172-4_6","volume":"7076","author":"LWH Vincent","year":"2011","unstructured":"Vincent, L. W. H.,& Ponnambalam, S. G. (2011). Scheduling flexible assembly lines using differential evolution. Swarm, Evolutionary, and Memetic Computing, Lecture Notes in Computer Science, 7076(2011), 43\u201350.","journal-title":"Swarm, Evolutionary, and Memetic Computing, Lecture Notes in Computer Science"},{"key":"716_CR27","unstructured":"Vincent, L. W. H.,& Ponnambalam S.G. (2012). Scheduling flexible assembly lines using variants of differential evolution. In Proceedings of IEEE International Conference on Automation Science and Engineering (CASE), pp. 590\u2013595."}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-012-0716-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-012-0716-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-012-0716-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T23:27:03Z","timestamp":1562369223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-012-0716-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,27]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["716"],"URL":"https:\/\/doi.org\/10.1007\/s10845-012-0716-8","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,27]]}}}