{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T22:24:45Z","timestamp":1772490285726,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T00:00:00Z","timestamp":1180569600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s00500-007-0210-y","type":"journal-article","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T13:51:32Z","timestamp":1180533092000},"page":"435-452","source":"Crossref","is-referenced-by-count":52,"title":["Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm"],"prefix":"10.1007","volume":"12","author":[{"given":"Alireza","family":"Rahimi-Vahed","sequence":"first","affiliation":[]},{"given":"Ali Hossein","family":"Mirzaei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,5,31]]},"reference":[{"key":"210_CR1","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/j.ejor.2005.02.001","volume":"169","author":"JND Gupta","year":"2006","unstructured":"Gupta JND, Stafford Jr EF (2006) Flow shop scheduling research after five decades. Eur J Oper Res 169:699\u2013711","journal-title":"Eur J Oper Res"},{"key":"210_CR2","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York"},{"key":"210_CR3","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/0360-8352(96)00045-9","volume":"30","author":"T Murata","year":"1996","unstructured":"Murata T, Ishibuchi H, Tanaka H (1996) Multi-objective genetic algorithm and its applications to flow shop scheduling. Comput Indus Eng 30:957\u2013968","journal-title":"Comput Indus Eng"},{"key":"210_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0925-5273(99)00053-5","volume":"64","author":"SMA Suliman","year":"2000","unstructured":"Suliman SMA (2000) A two-phase heuristic approach to the permutation flow shop scheduling problem. Int J Product Econ 64:143\u2013152","journal-title":"Int J Product Econ"},{"key":"210_CR5","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/S0377-2217(99)00415-4","volume":"130","author":"J Cheng","year":"2001","unstructured":"Cheng J, Steiner G, Stephenson P (2001) A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times. Eur J Oper Res 130:559\u2013575","journal-title":"Eur J Oper Res"},{"key":"210_CR6","doi-asserted-by":"crossref","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski J, Wodecki M (2004) A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput Oper Res 31:1891\u20131909","journal-title":"Comput Oper Res"},{"key":"210_CR7","doi-asserted-by":"crossref","first-page":"2151","DOI":"10.1016\/S0305-0548(03)00169-2","volume":"31","author":"M Solimanpur","year":"2004","unstructured":"Solimanpur M, Vrat P, Shankar R (2004) A neuro-tabu search heuristic for flow shop scheduling problem. Comput Oper Res 31:2151\u20132164","journal-title":"Comput Oper Res"},{"key":"210_CR8","unstructured":"Wang J-B, Daniel Ng CT, Cheng TCE, Li-Li Liu (in press) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput"},{"key":"210_CR9","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1007\/s00170-003-1731-x","volume":"23","author":"SG Ponnambalam","year":"2004","unstructured":"Ponnambalam SG, Jagannathan H, Kataria M, Gadicherla A (2004) A TSP-GA multi-objective algorithm for flow shop scheduling. Int J Adv Manufact Technol 23:909\u2013915","journal-title":"Int J Adv Manufact Technol"},{"key":"210_CR10","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/S0377-2217(03)00192-9","volume":"157","author":"B Toktas","year":"2004","unstructured":"Toktas B, Azizoglu M, Koksalan SK (2004) Two-machine flow shop scheduling with two criteria: maximum earliness and makespan. Eur J Oper Res 157:286\u2013295","journal-title":"Eur J Oper Res"},{"key":"210_CR11","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1007\/s00170-003-1926-1","volume":"25","author":"D Ravindran","year":"2005","unstructured":"Ravindran D, Noorul Haq A, Selvakuar SJ, Sivaraman R (2005) Flow shop scheduling with multiple objective of minimizing makespan and total flow time. Int J Adv Manufact Technol 25:1007\u20131012","journal-title":"Int J Adv Manufact Technol"},{"key":"210_CR12","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"},{"key":"210_CR13","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, NJ, pp 93\u2013100"},{"key":"210_CR14","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, CA, University of Illinois at Urbana-Champaign. Morgan Kaufman Publishers, 1993, pp 416\u2013423"},{"key":"210_CR15","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, pp 82\u201387"},{"issue":"3","key":"210_CR16","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. Evolut Comput J 7(3):205\u2013230","journal-title":"Evolut Comput J"},{"issue":"2","key":"210_CR17","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 Trans Evolut Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evolut Comput"},{"issue":"7\u20138","key":"210_CR18","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"},{"key":"210_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"},{"key":"210_CR20","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, pp 95\u2013100"},{"key":"210_CR21","unstructured":"Zitzler E, Laumanns M, Thiele L (2001b) SPEA2: Improving the strength pareto evolutionary algorithm. Report 103, Computer Engineering and Networks Laboratory (TIK)"},{"key":"210_CR22","first-page":"126","volume-title":"First international conference on evolutionary multi-criterion optimization Lecture notes in computer sciences, vol 1993","author":"CA Coello Coello","year":"2001","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, vol 1993. Springer, Heidelberg, pp 126\u2013140"},{"key":"210_CR23","unstructured":"Knowles JD, Corne DW (1999) The Pareto archieved evolution strategy: a new baseline algorithm for multiobjective optimization. In: Congress on evolutionary computation, Washington, DC, IEEE Service Center, pp 98\u2013105"},{"key":"210_CR24","unstructured":"Pilegaard Hansen M (1997) Tabu search in multiobjective optimization: MOTS. In: Proceedings of the 13th international conference on multiple criteria decision making (MCDM_97), Cape Town, South Africa"},{"key":"210_CR25","doi-asserted-by":"crossref","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"},{"issue":"2","key":"210_CR26","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/03052150500384759","volume":"38","author":"M Eusuff","year":"2006","unstructured":"Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129\u2013154","journal-title":"Eng Optim"},{"key":"210_CR27","volume-title":"The selfish gene","author":"R Dawkins","year":"1976","unstructured":"Dawkins R (1976) The selfish gene. Oxford University Press, Oxford"},{"key":"210_CR28","doi-asserted-by":"crossref","unstructured":"Lian Z, Gu X, Jiao B (in press) A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan. Chaos, Soliton & Fractals","DOI":"10.1016\/j.chaos.2006.05.082"},{"issue":"3","key":"210_CR29","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1061\/(ASCE)0733-9496(2003)129:3(210)","volume":"129","author":"MM Eusuff","year":"2003","unstructured":"Eusuff MM, Lansey KE (2003) Optimizing of water distribution network design using the shuffled frog leaping algorithm. J Water Resour Planning Manage 129(3):210\u2013225","journal-title":"J Water Resour Planning Manage"},{"key":"210_CR30","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.aei.2005.01.004","volume":"19","author":"E Elbeltagi","year":"2005","unstructured":"Elbeltagi E, Hegazy T, Grierson D (2005) Comparison among five evolutionary-based optimization algorithms. Adv Eng Inform 19:43\u201353","journal-title":"Adv Eng Inform"},{"key":"210_CR31","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","volume":"109","author":"M Ben-Daya","year":"1998","unstructured":"Ben-Daya M, Al-Fawzan M (1998) A tabu search approach for the flow shop scheduling problem. Eur J Oper Res 109:88\u201395","journal-title":"Eur J Oper Res"},{"key":"210_CR32","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, pp 351\u2013357","DOI":"10.1145\/298151.298382"},{"issue":"2","key":"210_CR33","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. Evolut Comput 2(2):221\u2013248","journal-title":"Evolut Comput"},{"issue":"5","key":"210_CR34","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1080\/095372898233984","volume":"9","author":"PR McMullen","year":"1998","unstructured":"McMullen PR (1998) JIT sequencing for mixed-model assembly lines with setups using tabu search. Product Planning Control 9(5):504\u2013510","journal-title":"Product Planning Control"},{"issue":"3","key":"210_CR35","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1111\/j.1475-3995.1998.tb00117.x","volume":"5","author":"J Xu","year":"1998","unstructured":"Xu J, Chiu SY, Glover F (1998) Fine-tuning a tabu search algorithm with statistical tests. Int Trans Oper Res 5(3):233\u2013244","journal-title":"Int Trans Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0210-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-007-0210-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-007-0210-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:51Z","timestamp":1559093991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-007-0210-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5,31]]},"references-count":35,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["210"],"URL":"https:\/\/doi.org\/10.1007\/s00500-007-0210-y","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5,31]]}}}