{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T21:55:13Z","timestamp":1777067713257,"version":"3.51.4"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T00:00:00Z","timestamp":1468886400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s12351-016-0257-6","type":"journal-article","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:52:53Z","timestamp":1468929173000},"page":"123-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times"],"prefix":"10.1007","volume":"18","author":[{"given":"S. M.","family":"Mousavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Mahdavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Rezaeian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zandieh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,19]]},"reference":[{"issue":"2","key":"257_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. OMEGA Int J Manag Sci 27(2):219\u2013239","journal-title":"OMEGA Int J Manag Sci"},{"issue":"3","key":"257_CR2","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187(3):985\u20131032","journal-title":"Eur J Oper Res"},{"key":"257_CR3","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.ejor.2004.03.026","volume":"167","author":"C Andr\u00e9s","year":"2005","unstructured":"Andr\u00e9s C, Albarrac\u00edn JM, Tormo G, Vicens E, Garc\u00eda-Sabater JP (2005) Group technology in a hybrid flowshop environment: a case study. Eur J Oper Res 167:272\u2013281","journal-title":"Eur J Oper Res"},{"issue":"1","key":"257_CR4","first-page":"10","volume":"8","author":"TS Arthanary","year":"1971","unstructured":"Arthanary TS, Ramaswamy KG (1971) An extension of two machine sequencing problems. Oper Res 8(1):10\u201322","journal-title":"Oper Res"},{"issue":"5","key":"257_CR5","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1080\/0951192X.2013.820348","volume":"27","author":"SF Attar","year":"2014","unstructured":"Attar SF, Mohammadi M, Tavakkoli-Moghaddam R, Yaghoubi S (2014) Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machine-sequence-dependent set-up time constraints. Int J Comput Integr Manuf 27(5):450\u2013469","journal-title":"Int J Comput Integr Manuf"},{"key":"257_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-5237-6","volume-title":"Multi-objective scheduling by genetic algorithms","author":"TP Bagchi","year":"1999","unstructured":"Bagchi TP (1999) Multi-objective scheduling by genetic algorithms. Kluwer, Boston"},{"key":"257_CR7","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1007\/s13369-012-0347-6","volume":"38","author":"J Behnamian","year":"2013","unstructured":"Behnamian J, Zandieh M (2013) Earliness and tardiness minimizing on a realistic hybrid flowshop scheduling with learning effect by advanced metaheuristic. Arab J Sci Eng 38:1229\u20131242","journal-title":"Arab J Sci Eng"},{"key":"257_CR8","doi-asserted-by":"crossref","first-page":"11057","DOI":"10.1016\/j.eswa.2009.02.080","volume":"36","author":"J Behnamian","year":"2009","unstructured":"Behnamian J, Fatemi Ghomi SMT, Zandieh M (2009) A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Syst Appl 36:11057\u201311069","journal-title":"Expert Syst Appl"},{"issue":"1","key":"257_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"DA Biskup","year":"1999","unstructured":"Biskup DA (1999) Single machine scheduling with learning considerations. Eur J Oper Res 115(1):173\u2013178","journal-title":"Eur J Oper Res"},{"key":"257_CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","volume":"188","author":"DA Biskup","year":"2008","unstructured":"Biskup DA (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315\u2013329","journal-title":"Eur J Oper Res"},{"key":"257_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S1568-4946(03)00009-7","volume":"3","author":"PC Chang","year":"2003","unstructured":"Chang PC, Hsieh JC, Wang YW (2003) Genetic algorithms applied in BOPP film scheduling problems: minimizing total absolute deviation and setup times. Appl Soft Comput 3:139\u2013148","journal-title":"Appl Soft Comput"},{"key":"257_CR12","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.cie.2011.04.008","volume":"61","author":"H-M Cho","year":"2011","unstructured":"Cho H-M, Bae S-J, Kim J, Jeong I-J (2011) Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Comput Ind Eng 61:529\u2013541","journal-title":"Comput Ind Eng"},{"key":"257_CR13","unstructured":"Corne DW, Knowles JD, Oates MJ (2000) The Pareto envelope based selection algorithm for multi-objective optimization. In: Proceedings of the parallel problem solving from nature VI conference, Springer Lecture Notes in Computer Science, vol 1917\/2000, pp 839\u2013848"},{"key":"257_CR14","unstructured":"Corne DW, Jerram NR, Knowles JD, Oates MJ (2001) PESA-II: region-based selection in evolutionary multiobjective optimization. In: Proceedings of the genetic and evolutionary computation conference, (GECCO-2001). Morgan Kaufmann, San Francisco, CA, pp 283\u2013290"},{"issue":"7\u20138","key":"257_CR15","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/s00170-008-1887-5","volume":"44","author":"H Davoudpour","year":"2009","unstructured":"Davoudpour H, Ashrafi M (2009) Solving multi-objective SDST flexible flow shop using GRASP algorithm. Int J Adv Manuf Technol 44(7\u20138):737\u2013747","journal-title":"Int J Adv Manuf Technol"},{"issue":"2","key":"257_CR16","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 multi-objective genetic algorithm: NSGA II. IEEE Trans Evolut Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evolut Comput"},{"key":"257_CR17","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2009.06.031","volume":"203","author":"F Dugardin","year":"2010","unstructured":"Dugardin F, Yalaoui F, Amodeo L (2010) New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur J Oper Res 203:22\u201331","journal-title":"Eur J Oper Res"},{"key":"257_CR18","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1007\/s13369-013-0611-4","volume":"38","author":"M Fadaei","year":"2013","unstructured":"Fadaei M, Zandieh M (2013) Scheduling a bi-objective hybrid flow shop with sequence-dependent family setup times using metaheuristics. Arab J Sci Eng 38:2233\u20132244","journal-title":"Arab J Sci Eng"},{"key":"257_CR19","unstructured":"Fonseca CM, Fleming PJ (1993) Genetic algorithms for multi-objective optimization: formulation, discussion and generalization. In: Proceedings of the fifth international conference on genetic algorithms, July 1993. Morgan Kaufmann, San Mateo, pp 416\u2013423"},{"issue":"4","key":"257_CR20","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"JND Gupta","year":"1988","unstructured":"Gupta JND (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 39(4):359\u2013364","journal-title":"J Oper Res Soc"},{"key":"257_CR21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/s00170-011-3368-5","volume":"58","author":"S Hakimzadeh Abyaneh","year":"2012","unstructured":"Hakimzadeh Abyaneh S, Zandieh M (2012) Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers. Int J Adv Manuf Technol 58:309\u2013325","journal-title":"Int J Adv Manuf Technol"},{"key":"257_CR22","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan, Ann Arbor"},{"key":"257_CR23","unstructured":"Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multi-objective optimization. In: Proceedings of the 1st IEEE-ICEC conference, computational computation, 27\u201329 June 1994, Orlando, FL, vol 1, pp 82\u201387"},{"issue":"7\u20138","key":"257_CR24","doi-asserted-by":"crossref","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":"3","key":"257_CR25","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1109\/5326.704576","volume":"28","author":"H Ishibuchi","year":"1998","unstructured":"Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Manuf Cybern 28(3):392\u2013403","journal-title":"IEEE Trans Syst Manuf Cybern"},{"issue":"3","key":"257_CR26","first-page":"861","volume":"20","author":"F Jolai","year":"2013","unstructured":"Jolai F, Asefi H, Rabiee M, Ramezani P (2013) Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem. Sci Iran E 20(3):861\u2013872","journal-title":"Sci Iran E"},{"issue":"3\u20134","key":"257_CR27","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/s00170-007-0977-0","volume":"37","author":"J Jungwattanakit","year":"2008","unstructured":"Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2008) Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Int J Adv Manuf Technol 37(3\u20134):354\u2013370","journal-title":"Int J Adv Manuf Technol"},{"issue":"2","key":"257_CR28","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.cor.2007.10.004","volume":"36","author":"J Jungwattanakit","year":"2009","unstructured":"Jungwattanakit J, Reodecha M, Chaovalitwongse P, Werner F (2009) A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. Comput Oper Res 36(2):358\u2013378","journal-title":"Comput Oper Res"},{"issue":"6","key":"257_CR29","doi-asserted-by":"crossref","first-page":"4024","DOI":"10.1016\/j.eswa.2009.09.005","volume":"37","author":"N Karimi","year":"2010","unstructured":"Karimi N, Zandieh M, Karamooz HR (2010) Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach. Expert Syst Appl 37(6):4024\u20134032","journal-title":"Expert Syst Appl"},{"key":"257_CR30","doi-asserted-by":"crossref","unstructured":"Knowles JD, Corne DW (1999) The Pareto archived evolution strategy: a new baseline algorithm for multiobjective optimization. In: Proceedings of the 1999 congress on evolutionary computation, 6\u20139 July, IEEE Service Center, Washington, DC, pp 98\u2013105","DOI":"10.1109\/CEC.1999.781913"},{"issue":"8","key":"257_CR31","doi-asserted-by":"crossref","first-page":"2221","DOI":"10.1080\/00207541003720350","volume":"49","author":"D Lin","year":"2011","unstructured":"Lin D, Lee CKM (2011) A review of the research methodology for the re-entrant scheduling problem. Int J Prod Res 49(8):2221\u20132242","journal-title":"Int J Prod Res"},{"issue":"1\u20134","key":"257_CR32","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00170-010-2930-x","volume":"54","author":"SM Mousavi","year":"2011","unstructured":"Mousavi SM, Zandieh M, Amiri M (2011a) An efficient bi-objective heuristic for scheduling of hybrid flow shops. Int J Adv Manuf Technol 54(1\u20134):287\u2013307","journal-title":"Int J Adv Manuf Technol"},{"issue":"10","key":"257_CR33","doi-asserted-by":"crossref","first-page":"2570","DOI":"10.1080\/00207543.2010.543178","volume":"50","author":"SM Mousavi","year":"2011","unstructured":"Mousavi SM, Zandieh M, Amiri M (2011b) Comparisons of bi-objective genetic algorithms for the hybrid flowshop scheduling with sequence-dependent setup times. Int J Prod Res 50(10):2570\u20132591","journal-title":"Int J Prod Res"},{"issue":"5\u20138","key":"257_CR34","first-page":"933","volume":"64","author":"SM Mousavi","year":"2012","unstructured":"Mousavi SM, Mousakhani M, Zandieh M (2012a) Bi-objective hybrid flow shop scheduling: a new local search. Int J Adv Manuf Technol 64(5\u20138):933\u2013950","journal-title":"Int J Adv Manuf Technol"},{"issue":"1\u20134","key":"257_CR35","first-page":"369","volume":"64","author":"SM Mousavi","year":"2012","unstructured":"Mousavi SM, Zandieh M, Yazdani M (2012b) A simulated annealing\/local search to minimize the makespan and total tardiness on a hybrid flowshop. Int J Adv Manuf Technol 64(1\u20134):369\u2013388","journal-title":"Int J Adv Manuf Technol"},{"issue":"6","key":"257_CR36","doi-asserted-by":"crossref","first-page":"9625","DOI":"10.1016\/j.eswa.2008.09.063","volume":"36","author":"B Naderi","year":"2009","unstructured":"Naderi B, Zandieh M, Balagh AKG, Roshanaei V (2009a) An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst Appl 36(6):9625\u20139633","journal-title":"Expert Syst Appl"},{"key":"257_CR37","doi-asserted-by":"crossref","first-page":"1186","DOI":"10.1007\/s00170-008-1569-3","volume":"41","author":"B Naderi","year":"2009","unstructured":"Naderi B, Zandieh M, Roshanaei V (2009b) Scheduling hybrid flowshops with sequence-dependent setup times to minimize makespan and maximum tardiness. Int J Adv Manuf Technol 41:1186\u20131198","journal-title":"Int J Adv Manuf Technol"},{"issue":"10","key":"257_CR38","doi-asserted-by":"crossref","first-page":"2609","DOI":"10.1080\/00207543.2010.546380","volume":"50","author":"F Pargar","year":"2012","unstructured":"Pargar F, Zandieh M (2012) Bi-criteria SDST hybrid flow shop scheduling with learning effect of setup times: water flow-like algorithm approach. Int J Prod Res 50(10):2609\u20132623","journal-title":"Int J Prod Res"},{"issue":"7\u20138","key":"257_CR39","first-page":"804","volume":"27","author":"T Pasupathy","year":"2007","unstructured":"Pasupathy T, Rajendran C, Suresh RK (2007) A multi-objective genetic algorithm for scheduling in flowshops to minimize the makespan and total flow time of jobs. Int J Adv Manuf Technol 27(7\u20138):804\u2013815","journal-title":"Int J Adv Manuf Technol"},{"key":"257_CR40","volume-title":"Scheduling theory, algorithms, and systems","author":"ML Pinedo","year":"1995","unstructured":"Pinedo ML (1995) Scheduling theory, algorithms, and systems. Prentice-Hall, Englewood Cliffs"},{"key":"257_CR41","volume-title":"Theory, algorithms, and systems","author":"ML Pinedo","year":"2008","unstructured":"Pinedo ML (2008) Theory, algorithms, and systems, 3rd edn. Springer Science\u00a0+\u00a0Business Media, New York","edition":"3"},{"key":"257_CR42","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1007\/s00170-009-2475-z","volume":"49","author":"E Rashidi","year":"2010","unstructured":"Rashidi E, Jahandar M, Zandieh M (2010) An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. Int J Adv Manuf Technol 49:1129\u20131139","journal-title":"Int J Adv Manuf Technol"},{"key":"257_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz R, V\u00e1zquez-Rodr\u00edguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205:1\u201318","journal-title":"Eur J Oper Res"},{"key":"257_CR44","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.cie.2004.06.002","volume":"47","author":"AJ Ruiz-Torres","year":"2004","unstructured":"Ruiz-Torres AJ, Lopez FJ (2004) Using the FDH formulation of DEA to evaluate a multi-criteria problem in parallel machine scheduling. Comput Ind Eng 47:107\u2013121","journal-title":"Comput Ind Eng"},{"key":"257_CR45","unstructured":"Schaffer JD (1985) Multi-objective optimization with vector evaluated genetic algorithms. In: Grefenstette J (ed) Proceedings of the international conference on genetic algorithms and their applications. Lawrence Erlbaum, Hillsdale, pp 93\u2013100"},{"issue":"3","key":"257_CR46","first-page":"221","volume":"2","author":"N Srinivas","year":"1995","unstructured":"Srinivas N, Deb K (1995) Multi-objective function optimization using non-dominated sorting genetic algorithms. IEEE Trans Evol Comput 2(3):221\u2013248","journal-title":"IEEE Trans Evol Comput"},{"issue":"5","key":"257_CR47","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1080\/00207543.2013.847983","volume":"52","author":"S Wang","year":"2014","unstructured":"Wang S, Liu M (2014) Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method. Int J Prod Res 52(5):1495\u20131508","journal-title":"Int J Prod Res"},{"issue":"5","key":"257_CR48","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1287\/opre.45.5.702","volume":"45","author":"MY Wang","year":"1997","unstructured":"Wang MY, Sethi SP, Van de Velde SL (1997) Minimizing makespan in a class of reentrant shops. Oper Res 45(5):702\u2013712","journal-title":"Oper Res"},{"key":"257_CR49","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2014.910627","author":"KC Ying","year":"2014","unstructured":"Ying KC, Lin SW, Wan SY (2014) Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm. Int J Prod Res. doi:\n                        10.1080\/00207543.2014.910627","journal-title":"Int J Prod Res"},{"issue":"4","key":"257_CR50","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multi-objective evolutionary algorithm: a comparative case study and the strength Pareto approach. IEEE Trans Evol Comput 3(4):251\u2013257","journal-title":"IEEE Trans Evol Comput"},{"key":"257_CR51","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength Pareto evolutionary algorithm. Report 103. Computer Engineering and Networks Laboratory (TIK), Zurich"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-016-0257-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0257-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0257-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-016-0257-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T05:51:37Z","timestamp":1521179497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-016-0257-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,19]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["257"],"URL":"https:\/\/doi.org\/10.1007\/s12351-016-0257-6","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,19]]}}}