{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T19:53:15Z","timestamp":1760730795205},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T00:00:00Z","timestamp":1454630400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Manuf"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s10845-016-1201-6","type":"journal-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T10:29:28Z","timestamp":1454668168000},"page":"1617-1636","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A multi-objective car sequencing problem on two-sided assembly lines"],"prefix":"10.1007","volume":"29","author":[{"given":"Parames","family":"Chutima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sathaporn","family":"Olarnviwatchai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,5]]},"reference":[{"issue":"10","key":"1201_CR1","doi-asserted-by":"crossref","first-page":"2447","DOI":"10.1080\/00207549308956868","volume":"31","author":"JJ Bartholdi","year":"1993","unstructured":"Bartholdi, J. J. (1993). Balancing two-sided assembly lines: A case study. International Journal of Production Research, 31(10), 2447\u20132461.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"1201_CR2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.ejor.2007.09.013","volume":"192","author":"N Boysen","year":"2009","unstructured":"Boysen, N., Fliedner, M., & Scholl, A. (2009). Sequencing mixed-model assembly lines: Survey, classification, and model critique. European Journal of Operational Research, 192(2), 349\u2013373.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR3","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1016\/j.ejor.2007.04.052","volume":"191","author":"O Briant","year":"2008","unstructured":"Briant, O., Naddef, D., & Mouni\u00e9, G. (2008). Greedy approach and multi-criteria simulated annealing for the car sequencing problem. European Journal of Operational Research, 191, 993\u20131003.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1201_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.cie.2011.08.015","volume":"62","author":"P Chutima","year":"2012","unstructured":"Chutima, P., & Chimklai, P. (2012). Multi-objective two-sided mixed-model assembly line balancing using particle swarm optimisation with negative knowledge. Computers and Industrial Engineering, 62(1), 39\u201355.","journal-title":"Computers and Industrial Engineering"},{"issue":"3\u20134","key":"1201_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1504\/IJAOM.2010.038338","volume":"2","author":"P Chutima","year":"2010","unstructured":"Chutima, P., & Kampirom, N. (2010). A multi-objective coincidence memetic algorithm for a mixed-model U-line sequencing problem. International Journal of Advanced Operations Management, 2(3\u20134), 201\u2013247.","journal-title":"International Journal of Advanced Operations Management"},{"issue":"4","key":"1201_CR6","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1504\/IJOR.2013.052712","volume":"16","author":"P Chutima","year":"2013","unstructured":"Chutima, P., & Jitmetta, K. (2013). Adaptive biogeography-based optimisation for two-sided assembly line sequencing problems. International Journal of Operational Research, 16(4), 390\u2013420.","journal-title":"International Journal of Operational Research"},{"key":"1201_CR7","unstructured":"Coello Coello, C. A. (2006). 20 years of evolutionary multi-objective optimization: what has been done and what remains to be done. In G. Y. Yen & D. B. Fogel (Eds.), Computational intelligence: Principles and practice (pp. 73\u201388). IEEE Computational Intelligence Society."},{"key":"1201_CR8","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/j.ejor.2007.04.048","volume":"191","author":"JF Cordeau","year":"2008","unstructured":"Cordeau, J. F., Laporte, G., & Pasin, F. (2008). Iterated tabu search for the car sequencing problem. European Journal of Operational Research, 191, 945\u2013956.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR9","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA II. IEEE Transactions on Evolutionary Computation, 6, 182\u2013197.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"1201_CR10","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1016\/j.ejor.2007.04.043","volume":"191","author":"B Estellon","year":"2008","unstructured":"Estellon, B., Gardi, F., & Nouioua, K. (2008). Two local search approaches for solving real-life car sequencing problems. European Journal of Operational Research, 191, 928\u2013944.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR11","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1016\/j.ejor.2007.04.045","volume":"191","author":"M Fliedner","year":"2008","unstructured":"Fliedner, M., & Boysen, N. (2008). Solving the car sequencing problem via branch & bound. European Journal of Operational Research, 191, 1023\u20131042.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR12","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1016\/j.ejor.2005.02.063","volume":"174","author":"C Gagn\u00e9","year":"2006","unstructured":"Gagn\u00e9, C., Gravel, M., & Price, W. L. (2006). Solving real car sequencing problems with ant colony optimization. European Journal of Operational Research, 174, 1427\u20131448.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR13","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1016\/j.ejor.2007.04.051","volume":"191","author":"H Gavranovi\u0107","year":"2008","unstructured":"Gavranovi\u0107, H. (2008). Local search and suffix tree for car-sequencing problem with colors. European Journal of Operational Research, 191, 972\u2013980.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR14","volume-title":"Genetic algorithm in search, optimization, and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989). Genetic algorithm in search, optimization, and machine learning. Reading, MA: Addison-Westley."},{"key":"1201_CR15","unstructured":"Gottlieb, J., Puchta, M., & Solnon, C. (2003). A study of greedy, local search, and ant colony optimization approaches for car sequencing problems. In Proceedings of EvoWorkshops, Lecture notes in computer science (vol. 2611, 246\u2013257). Berlin: Springer."},{"key":"1201_CR16","doi-asserted-by":"crossref","unstructured":"Horn, J., Nafpliotis, N., & Goldberg, D. E. (1994). A niched Pareto genetic algorithm for multiobjective optimization. In Proceedings of the first IEEE conference on evolutionary computation, IEEE world congress on computational intelligence, Orlando, USA.","DOI":"10.1109\/ICEC.1994.350037"},{"issue":"7\u20138","key":"1201_CR17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1016\/S0305-0548(98)00026-4","volume":"25","author":"CJ Hyun","year":"1998","unstructured":"Hyun, C. J., Kim, Y., & Kim, Y. K. (1998). A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines. Computers and Operations Research, 25(7\u20138), 675\u2013690.","journal-title":"Computers and Operations Research"},{"key":"1201_CR18","doi-asserted-by":"publisher","unstructured":"Hwang, R. K., & Katayama, H. (2008). A multi-decision genetic approach for workload balancing of mixed-model U-shaped assembly line systems. International Journal of Production Research. doi: 10.1080\/00207540701851772 .","DOI":"10.1080\/00207540701851772"},{"key":"1201_CR19","unstructured":"Jaszkiewicz, A., Kominek, P., & Kubiak, M. (2004). Adaptation of the genetic local search algorithm to a car sequencing problem. In Proceedings of 7th national conference on evolutionary algorithms and global Optimization, Poland, pp. 67\u201374."},{"key":"1201_CR20","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy, J., Eberhart, R. C., & Shi, Y. (2001). Swarm intelligence. San Francisco, CA: Morgan Kaufmann."},{"issue":"1","key":"1201_CR21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1080\/095372800232478","volume":"11","author":"YK Kim","year":"2000","unstructured":"Kim, Y. K., Kim, Y., & Kim, Y. J. (2000). Two-sided assembly line balancing: A genetic algorithm approach. Production Planning and Control, 11(1), 44\u201353.","journal-title":"Production Planning and Control"},{"issue":"3","key":"1201_CR22","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1016\/j.cor.2007.11.003","volume":"36","author":"YK Kim","year":"2009","unstructured":"Kim, Y. K., Song, W. S., & Kim, J. H. (2009). A mathematical model and a genetic algorithm for two-sided assembly line balancing. Computers and Operations Research, 36(3), 853\u2013865.","journal-title":"Computers and Operations Research"},{"key":"1201_CR23","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.orl.2003.09.003","volume":"32","author":"T Kris","year":"2004","unstructured":"Kris, T. (2004). On the complexity of the car sequencing problem. Operations Research Letters, 32, 331\u2013335.","journal-title":"Operations Research Letters"},{"key":"1201_CR24","first-page":"361","volume":"75","author":"R Kumar","year":"2007","unstructured":"Kumar, R., & Singh, P. K. (2007). Pareto evolutionary algorithm hybridized with local search for bi-objective TSP. Studies in Computational Intelligence, 75, 361\u2013398.","journal-title":"Studies in Computational Intelligence"},{"key":"1201_CR25","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0272-6963(95)00026-O","volume":"13","author":"R Lummus","year":"1995","unstructured":"Lummus, R. (1995). A simulation analysis of sequencing alternatives for JIT lines using kanbans. Journal of Operations Management, 13, 183\u2013191.","journal-title":"Journal of Operations Management"},{"key":"1201_CR26","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0360-8352(01)00029-8","volume":"40","author":"TO Lee","year":"2001","unstructured":"Lee, T. O., Kim, Y., & Kim, Y. K. (2001). Two-sided assembly line balancing to maximize work relatedness and slackness. Computers & Industrial Engineering, 40, 273\u2013292.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"1201_CR27","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1016\/j.ejor.2004.07.016","volume":"167","author":"SA Mansouri","year":"2005","unstructured":"Mansouri, S. A. (2005). A multi-objective genetic algorithm for mixed-model sequencing on JIT assembly lines. European Journal of Operational Research, 167(3), 696\u2013716.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"1201_CR28","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1080\/095372898233984","volume":"9","author":"PR McMullen","year":"1998","unstructured":"McMullen, P. R. (1998). JIT sequencing for mixed model assembly lines with setups in tabu search. Production Planning & Control, 9(5), 504\u2013510.","journal-title":"Production Planning & Control"},{"key":"1201_CR29","first-page":"679","volume":"32","author":"PR McMullen","year":"2000","unstructured":"McMullen, P. R., & Frazier, G. V. (2000). A simulated annealing approach to mixed-model sequencing with multiple objectives on a JIT line. IIE Transactions, 32, 679\u2013686.","journal-title":"IIE Transactions"},{"issue":"3","key":"1201_CR30","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0954-1810(01)00004-8","volume":"15","author":"PR McMullen","year":"2001","unstructured":"McMullen, P. R. (2001). An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives. Artificial Intelligence in Engineering, 15(3), 309\u2013317.","journal-title":"Artificial Intelligence in Engineering"},{"issue":"3","key":"1201_CR31","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(90)90370-3","volume":"13","author":"J Miltenburg","year":"1990","unstructured":"Miltenburg, J., Steiner, G., & Yeomans, S. (1990). A dynamic programming algorithm for scheduling mixed-model just-in-time production systems. Mathematical Computation Modeling, 13(3), 57\u201366.","journal-title":"Mathematical Computation Modeling"},{"key":"1201_CR32","volume-title":"Design and analysis of experiments","author":"DC Montgomery","year":"2013","unstructured":"Montgomery, D. C. (2013). Design and analysis of experiments. new york: Wiley."},{"key":"1201_CR33","unstructured":"Nguyen, A., & Cung, V. D. (2005). Le problem du Car Sequencing Renault et le challenge ROADEF 2005. Proceedings of Journ\u00e9es Francophones de Programmation par Contraintes (pp. 3\u201310)."},{"issue":"6","key":"1201_CR34","doi-asserted-by":"crossref","first-page":"1955","DOI":"10.1016\/j.cor.2008.06.009","volume":"36","author":"U \u00d6zcan","year":"2009","unstructured":"\u00d6zcan, U., & Toklu, B. (2009). Multiple-criteria decision-making in two-sided assembly line balancing: A goal programming and a fuzzy goal programming models. Computers & Operations Research, 36(6), 1955\u20131965.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"1201_CR35","first-page":"1","volume":"2","author":"B Parello","year":"1986","unstructured":"Parello, B., Kabat, W., & Wos, L. (1986). Job-shop scheduling using automated reasoning: A case study of the car sequencing problem. Journal of Automated Reasoning, 2(1), 1\u201342.","journal-title":"Journal of Automated Reasoning"},{"key":"1201_CR36","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1016\/j.ejor.2007.04.044","volume":"191","author":"M Prandtsletter","year":"2008","unstructured":"Prandtsletter, M., & Raidi, G. R. (2008). An integer linear programming approach and a hybrid variable neighbourhood search for the car sequencing problem. European Journal of Operational Research, 191, 1004\u20131022.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR37","unstructured":"Puchta, M., & Gottlieb, J. (2002). Solving car sequencing problems by local optimization. Proceedings of EvoWorkshops, Lecture notes in computer science (vol. 2279, pp. 132\u2013142). Berlin: Springer."},{"issue":"1","key":"1201_CR38","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.aei.2006.09.007","volume":"21","author":"AR Rahimi-Vahed","year":"2007","unstructured":"Rahimi-Vahed, A. R., Rabbani, M., Tavakkoli-Moghaddam, R., Torabi, S. A., & Jolai, F. (2007). A multi-objective scatter search for a mixed-model assembly line sequencing problem. Advanced Engineering Informatics, 21(1), 85\u201399.","journal-title":"Advanced Engineering Informatics"},{"key":"1201_CR39","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.ejor.2007.02.003","volume":"191","author":"CC Rebeiro","year":"2008","unstructured":"Rebeiro, C. C., Aloise, D., Noronha, T. F., Rocha, C., & Urrutia, S. (2008a). An efficient implementation of a VNS\/ILS heuristic for a real-life car sequencing problem. European Journal of Operational Research, 191, 596\u2013611.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR40","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1016\/j.ejor.2007.04.034","volume":"191","author":"CC Rebeiro","year":"2008","unstructured":"Rebeiro, C. C., Aloise, D., Noronha, T. F., Rocha, C., & Urrutia, S. (2008b). A hybrid heuristic for a multi-objective real-life car sequencing prblems with painting and assembly constraints. European Journal of Operational Research, 191, 981\u2013992.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"1201_CR41","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TEVC.2008.919004","volume":"12","author":"D Simon","year":"2008","unstructured":"Simon, D. (2008). Biogeography-based optimization. IEEE Transaction on Evolutionary Computation, 12(6), 702\u2013713.","journal-title":"IEEE Transaction on Evolutionary Computation"},{"key":"1201_CR42","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0377-2217(96)00040-9","volume":"93","author":"K Smith","year":"1996","unstructured":"Smith, K., Palaniswami, M., & Krishnamoorthy, M. (1996). Traditional heuristic versus Hopfield neural network approaches to car sequencing problem. European Journal of Operational Research, 93, 300\u2013316.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR43","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1016\/j.ejor.2007.04.033","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C., Cung, V. D., Nguyen, A., & Artigues, C. (2008). The car sequeincing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF\u20192005 challenge problem. European Journal of Operational Research, 191, 912\u2013927.","journal-title":"European Journal of Operational Research"},{"key":"1201_CR44","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1016\/j.ejor.2007.04.037","volume":"191","author":"C Solnon","year":"2008","unstructured":"Solnon, C. (2008). Combining two pheromone structure for solving the car sequencing problem with ant colony optimization. European Journal of Operational Research, 191, 1043\u20131055.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"1201_CR45","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1287\/mnsc.39.6.728","volume":"39","author":"G Stiener","year":"1993","unstructured":"Stiener, G., & Yeomans, S. (1993). Level schedules for mixed-model, just-in-time assembly process. Management Science, 39(6), 728\u2013735.","journal-title":"Management Science"},{"issue":"2","key":"1201_CR46","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1016\/j.amc.2006.02.033","volume":"181","author":"R Tavakkoli-Moghaddam","year":"2006","unstructured":"Tavakkoli-Moghaddam, R., & Rahimi-Vahed, A. R. (2006). Multi-criteria sequencing problem for a mixed-model assembly line in a JIT production system. Applied Mathematics and Computation, 181(2), 1471\u20131481.","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"1201_CR47","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1162\/evco.1995.3.3.267","volume":"3","author":"T Warwick","year":"1996","unstructured":"Warwick, T., & Tsang, E. P. K. (1996). Takling car sequencing problems using a generic genetic algorithm. Evolutionary Computation, 3(3), 267\u2013298.","journal-title":"Evolutionary Computation"},{"key":"1201_CR48","doi-asserted-by":"crossref","unstructured":"Wattanapornprom, W., & Chongsatitvatana, P. (2011). Solving multimodal combinatorial puzzles with edge-based estimation of distribution algorithm. In Proceedings of genetic and evolutionary computation conference, GECCO (pp. 67\u201368).","DOI":"10.1145\/2001858.2001898"},{"key":"1201_CR49","doi-asserted-by":"publisher","unstructured":"Zinflou, A., & Gagn\u00e9, C. (2011). Tackling the industrial car sequencing problem using GISMOO algorithm. In Assembly line\u2014Theory and practice (pp. 85\u2013106). doi: 10.5772\/21113 .","DOI":"10.5772\/21113"},{"key":"1201_CR50","unstructured":"Zinflou, A., Gagn\u00e9, C., & Gravel, M. (2007). Crossover operators for the car sequencing problem. In C. Cotta & van Hemert, J. (Eds.), Proceedings of seventh European conference on evolutionary computation in combinatorial optimization (EvoCOP 2007), LNCS 4446 ( pp. 229\u2013239). Berlin: Springer."},{"issue":"4","key":"1201_CR51","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., & Thiele, L. (1999). Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4), 257\u2013271.","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Journal of Intelligent Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10845-016-1201-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-016-1201-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-016-1201-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10845-016-1201-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,4]],"date-time":"2019-09-04T05:10:33Z","timestamp":1567573833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10845-016-1201-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,5]]},"references-count":51,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["1201"],"URL":"https:\/\/doi.org\/10.1007\/s10845-016-1201-6","relation":{},"ISSN":["0956-5515","1572-8145"],"issn-type":[{"value":"0956-5515","type":"print"},{"value":"1572-8145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,5]]}}}