{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:08Z","timestamp":1761597008230},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2007,2,22]],"date-time":"2007-02-22T00:00:00Z","timestamp":1172102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,2,22]],"date-time":"2007-02-22T00:00:00Z","timestamp":1172102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2007,8]]},"DOI":"10.1007\/s00500-007-0149-z","type":"journal-article","created":{"date-parts":[[2007,2,21]],"date-time":"2007-02-21T14:04:20Z","timestamp":1172066660000},"page":"997-1012","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["A new particle swarm algorithm for a multi-objective mixed-model assembly line sequencing problem"],"prefix":"10.1007","volume":"11","author":[{"given":"A. R.","family":"Rahimi-Vahed","sequence":"first","affiliation":[]},{"given":"S. M.","family":"Mirghorbani","sequence":"additional","affiliation":[]},{"given":"M.","family":"Rabbani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,2,22]]},"reference":[{"key":"149_CR1","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1016\/j.cor.2004.09.002","volume":"33","author":"A Allahverdi","year":"2006","unstructured":"Allahverdi A, Al-Anzi FS (2006) A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application. Comput Oper Res 33:1056\u20131080","journal-title":"Comput Oper Res"},{"key":"149_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/00207549208942876","volume":"30","author":"JF Bard","year":"1992","unstructured":"Bard JF, Dar-El EM, Shtub A (1992) An analytic framework for sequencing mixed model. Int J Prod Res 30:35\u201348","journal-title":"Int J Prod Res"},{"key":"149_CR3","doi-asserted-by":"crossref","first-page":"2431","DOI":"10.1080\/00207549408957076","volume":"32","author":"JF Bard","year":"1994","unstructured":"Bard JF, Shtub A, Joshi SB (1994) Sequencing mixed-model assembly lines to level parts usage and minimize the length. Int J Prod Res 32:2431\u20132454","journal-title":"Int J Prod Res"},{"key":"149_CR4","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1016\/j.ejor.2004.08.008","volume":"169","author":"RP Beausoleil","year":"2006","unstructured":"Beausoleil RP (2006) \u201cMOSS\u201d multiobjective scatter search applied to non-linear multiple criteria optimization. Eur J Oper Res 169:426\u2013449","journal-title":"Eur J Oper Res"},{"key":"149_CR5","doi-asserted-by":"crossref","unstructured":"Clerc M (1999) The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. Proceeding ICEC, Washington, DC 1951\u20131957","DOI":"10.1109\/CEC.1999.785513"},{"key":"149_CR6","doi-asserted-by":"crossref","unstructured":"Coello Coello CA, Toscano Pulido G (2001) A micro-genetic algorithm for multiobjective optimization. In: Zitzler E, Deb K, Thiele L, Coello Coello CA, Corne D (eds) First international conference on evolutionary multi-criterion optimization. Lecture Notes in Computer Sciences, No. 1993, Springer, Heidelberg pp 126\u2013140","DOI":"10.1007\/3-540-44719-9_9"},{"key":"149_CR7","doi-asserted-by":"crossref","unstructured":"Coello Coello CA, Lechuga MS (2002) MOPSO: A proposal for multiple objective particle swarm optimization. In: Proceedings of the 2002 congress on evolutionary computation, vol 2, pp 1051\u20131056","DOI":"10.1109\/CEC.2002.1004388"},{"issue":"3","key":"149_CR8","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","volume":"8","author":"CA Coello Coello","year":"2004","unstructured":"Coello Coello CA, Pulido GT, Lechuga MS (2004) Handling multiple objectives with particle swarm optimization. IEEE, Transactions on Evolutionary Computation 8(3):256\u2013279","journal-title":"IEEE, Transactions on Evolutionary Computation"},{"key":"149_CR9","volume-title":"Multiobjective optimization: principles and case studies","author":"Y Collette","year":"2003","unstructured":"Collette Y, Siarry P (2003) Multiobjective optimization: principles and case studies. Springer, Heidelberg"},{"issue":"3","key":"149_CR10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1162\/evco.1999.7.3.205","volume":"7","author":"K Deb","year":"1999","unstructured":"Deb K (1999) Multi-objective genetic algorithms: Problem difficulties and construction of test problems. Evol Comput J 7(3):205\u2013230","journal-title":"Evol Comput J"},{"issue":"2","key":"149_CR11","doi-asserted-by":"publisher","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 Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"149_CR12","unstructured":"Fieldsend JE, Singh S (2002) A multi-objective algorithm based upon particle swarm optimization, an efficient data structure and turbulence. In: Proceedings of the 2002 UK Workshop on Computational Intelligence 37\u201344"},{"key":"149_CR13","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: formulation, discussion and generalization. In: Forrest S (ed) Proceedings of the Fifth International Conference on Genetic Algorithms, San Mateo, California, University of Illinois at Urbana- Morgan Kaufman Publishers, Champaign pp 416\u2013423"},{"key":"149_CR14","unstructured":"Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multi-objective optimization. Proceeding Of 1st IEEE-ICEC Conference pp 82\u201387"},{"key":"149_CR15","unstructured":"Hu X, Eberhart R (2002) Multiobjective optimization using dynamic neighborhood particle swarm optimization. In: Proceedings of the 2002 Congress on Evolutionary Computation 2:1677\u20131681"},{"key":"149_CR16","unstructured":"Hu X, Eberhart R, Shi Y (2003) Particle swarm with extended memory for multiobjective optimization. In: Proceedings of the 2003 IEEE Swarm Intelligence Symposium, Indianapolis 193\u2013197"},{"issue":"7\u20138","key":"149_CR17","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1016\/S0305-0548(98)00026-4","volume":"25","author":"CJ Hyun","year":"1998","unstructured":"Hyun CJ, Kim Y, Kim YK (1998) A genetic algorithm for multiple objective sequencing problems in mixed model assembly lines. Comput Oper Res 25(7\u20138):675\u2013690","journal-title":"Comput Oper Res"},{"issue":"7","key":"149_CR18","first-page":"910","volume":"37","author":"PR Inman","year":"1991","unstructured":"Inman PR, Bulfin RL (1991) Note on sequencing JIT mixed-model assembly lines. Manage Sci 37(7):910\u2013904","journal-title":"Manage Sci"},{"key":"149_CR19","unstructured":"Jaszkiewicz A (1999) Genetic local search for multiple objective combinatorial optimization, Technical Report RA-014\/98, Institute of Computing Science, Poznan University of Technology: Technical Report"},{"key":"149_CR20","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Networks 4:1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"149_CR21","unstructured":"Knowles JD, Corne DW (1999) The Pareto archieved evolution strategy: A new baseline algorithm for multiobjective optimization. In: Congress on evolutionary computation. IEEE Service Center Washington, DC, pp 98\u2013105"},{"key":"149_CR22","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/S0377-2217(00)00061-8","volume":"131","author":"T Korkmazel","year":"2001","unstructured":"Korkmazel T, Meral S (2001) Bicriteria sequencing methods for the mixed-model assembly line in Just-in-time Production systems. Eur J Oper Res 131:188\u2013207","journal-title":"Eur J Oper Res"},{"key":"149_CR23","doi-asserted-by":"crossref","unstructured":"Mansouri SAA (2005) Multi-objective Genetic Algorithm for mixed-model sequencing on JIT assembly Lines. Eur J Oper Res (in press)","DOI":"10.1016\/j.ejor.2004.07.016"},{"issue":"5","key":"149_CR24","first-page":"504","volume":"9","author":"PR McMullen","year":"1998","unstructured":"McMullen PR (1998) JIT sequencing for mixed-model assembly lines with setups using tabu search Production Planning& Control 9 (5):504\u2013510","journal-title":"Control"},{"key":"149_CR25","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0360-8352(01)00059-6","volume":"41","author":"PR McMullen","year":"2001a","unstructured":"McMullen PR (2001a) An efficient frontier approach to addressing JIT sequencing problems with setups via search heuristics. Comput Ind Eng 41:335\u2013353","journal-title":"Comput Ind Eng"},{"key":"149_CR26","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0925-5273(00)00091-8","volume":"72","author":"PR McMullen","year":"2001b","unstructured":"McMullen PR (2001b) A Kohonen self-organizing map approach to addressing a multiple objective, mixed-model JIT sequencing problem. Int J Prod Econ 72:59\u201371","journal-title":"Int J Prod Econ"},{"key":"149_CR27","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0954-1810(01)00004-8","volume":"15","author":"PR McMullen","year":"2001","unstructured":"McMullen PR (2001c) An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives. Artif Intell Eng 15:309\u2013317","journal-title":"Artif Intell Eng"},{"issue":"8","key":"149_CR28","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1023\/A:1007611509671","volume":"32","author":"PR McMullen","year":"2000","unstructured":"McMullen PR, Frazier GV (2000) A simulated annealing approach to mixed-model sequencing with multiple objectives on a JIT line .IIE Trans 32(8):679\u2013686","journal-title":"IIE Trans"},{"issue":"2","key":"149_CR29","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/mnsc.35.2.192","volume":"35","author":"J Miltenburg","year":"1989","unstructured":"Miltenburg J (1989) Level schedules for mixed-model assembly lines in just-in-time production systems. Manage Sci 35(2): 192\u2013207","journal-title":"Manage Sci"},{"key":"149_CR30","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1002\/nav.3800380608","volume":"38","author":"J Miltenburg","year":"1991","unstructured":"Miltenburg J, Goldstein GT (1991) Developing production scheduling which balance part usage and smooth production loads in just-in-time production systems. Naval Res Logistics 38: 893\u2013910","journal-title":"Naval Res Logistics"},{"key":"149_CR31","doi-asserted-by":"publisher","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: 57\u201366","journal-title":"Mathematical Computation Modeling"},{"key":"149_CR32","volume-title":"Toyota production system","author":"Y Monden","year":"1983","unstructured":"Monden Y (1983) Toyota production system. Institute if industrial engineers Press. Atlanta, GA"},{"key":"149_CR33","unstructured":"Moore J, Chapman R (1999) Application of particle swarm to multiobjective optimization, Department of Computer Science and Software Engineering, Auburn University"},{"key":"149_CR34","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1080\/00207547908919611","volume":"17","author":"K Okamura","year":"1979","unstructured":"Okamura K, Yamshina H (1979) A heuristic algorithm for the assembly line model-mix sequencing problem to minimize the risk of stopping the conveyor. Int J Prod Res 17:233\u2013247","journal-title":"Int J Prod Res"},{"key":"149_CR35","doi-asserted-by":"crossref","unstructured":"Parsopoulos KE, Vrahatis MN (2002) Particle swarm optimization method in multiobjective problems. In: Proceedings of the 2002 ACM Symposium on Applied Computing 603\u2013607","DOI":"10.1145\/508791.508907"},{"key":"149_CR36","unstructured":"Parsopoulos KE, Tasoulis DK, Vrahatis MN (2004) Multiobjective optimization using parallel vector evaluated particle swarm optimization. In: Proceedings of the IASTED International Conference on Artificial Intelligence and Applications 2:823\u2013828"},{"key":"149_CR37","first-page":"93","volume-title":"Genetic algorithms and their applications: proceedings of the first international conference on genetic algorithms.","author":"JD Schaffer","year":"1985","unstructured":"Schaffer JD (1985) Multiple objective optimization with vector evaluated genetic algorithms. In: Schaffer JD (eds) Genetic algorithms and their applications: proceedings of the first international conference on genetic algorithms. Lawrence Erlbaum, Hillsdale, New Jersey, pp 93\u2013100"},{"key":"149_CR38","doi-asserted-by":"crossref","unstructured":"Shi Y, Eberhart R (1998) Parameter selection in particle swarm optimization. In Evolutionary Programming VIZ: Proceeding EP98, Springer New York pp 591\u2013600","DOI":"10.1007\/BFb0040810"},{"issue":"2","key":"149_CR39","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1994","unstructured":"Srinivas N, Deb K (1994) Multi-objective optimization using non-dominated sorting in genetic algorithms. Evol Comput 2(2):221\u2013248","journal-title":"Evol Comput"},{"key":"149_CR40","doi-asserted-by":"crossref","unstructured":"Tasgetiren MF, Sevkli M, Liang YC, Gencyilmaz G (2004) Particle swarm optimization algorithm for single machine total weighted tardiness problem. In: Proceedings of the IEEE congress on evolutionary computation, Oregon, Portland 2:1412\u20139","DOI":"10.1109\/CEC.2004.1331062"},{"key":"149_CR41","doi-asserted-by":"crossref","unstructured":"Tavakkoli-Moghaddam R, Rahimi-Vahed AR (2006) Multi- criteria sequencing problem for a mixed-model assembly line in a JIT production system. Appl Math Comput (in press)","DOI":"10.1016\/j.amc.2006.02.033"},{"key":"149_CR42","doi-asserted-by":"crossref","unstructured":"Veldhuizen DV, Lamont G (1999) In: Carroll J, Haddad H, Oppenheim D, Bryant B, Lamont G (eds) Multi-objective evolutionary algorithm test suites 351\u2013357","DOI":"10.1145\/298151.298382"},{"key":"149_CR43","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1287\/mnsc.37.5.572","volume":"37","author":"CA Yano","year":"1991","unstructured":"Yano CA, Rachamadugu R (1991) Sequencing to minimize work overload in assembly lines with product options. Manage Sci 37:572\u2013586","journal-title":"Manage Sci"},{"key":"149_CR44","unstructured":"Zitzler E, Laumanns M, Thiele L (2001a) SPEA2: Improving the strength Pareto evolutionary algorithm. In: Giannakoglou K, Tsahalis D, Periaux J, Papailou P, Fogarty T (eds) EUROGEN 2001, Evolutionary methods for design, optimization and control with applications to industrial problems, Athens, Greece: September pp 95\u2013100"},{"key":"149_CR45","unstructured":"Zitzler E, Laumanns M, Thiele L (2001b) SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Computer Engineering and Networks Laboratory (TIK) -Report 103. Sept"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0149-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-007-0149-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0149-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0149-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T01:48:16Z","timestamp":1652838496000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-007-0149-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,22]]},"references-count":45,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2007,8]]}},"alternative-id":["149"],"URL":"https:\/\/doi.org\/10.1007\/s00500-007-0149-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,2,22]]},"assertion":[{"value":"22 February 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}