{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T01:11:59Z","timestamp":1775092319149,"version":"3.50.1"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:00:00Z","timestamp":1490227200000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10479-017-2465-8","type":"journal-article","created":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T21:43:55Z","timestamp":1490305435000},"page":"413-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking"],"prefix":"10.1007","volume":"267","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8468-0944","authenticated-orcid":false,"given":"Nouha","family":"Nouri","sequence":"first","affiliation":[]},{"given":"Talel","family":"Ladhari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,23]]},"reference":[{"issue":"3","key":"2465_CR1","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1590\/S0104-530X2000000300011","volume":"7","author":"VA Armentano","year":"2000","unstructured":"Armentano, V. A., & Ronconi, D. P. (2000). Minimizao do tempo total de atraso no problema de flowshop com buffer zero atravs de busca tabu. Gestao & Produao, 7(3), 352.","journal-title":"Gestao & Produao"},{"key":"2465_CR2","doi-asserted-by":"crossref","first-page":"1017","DOI":"10.1007\/s00170-014-6177-9","volume":"75","author":"H Asefi","year":"2014","unstructured":"Asefi, H., Jolai, F., Rabiee, M., & Tayebi Araghi, M. E. (2014). A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem. International Journal of Advanced Manufacturing Technology, 75, 1017\u20131033.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"2465_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0925-5273(99)00104-8","volume":"2","author":"V Caraffa","year":"2001","unstructured":"Caraffa, V., Ianes, S., Bagchi, T., & Sriskandarajah, C. (2001). Minimizing makespan in a flowshop using genetic algorithms. International Journal of Production Economics, 2, 101\u201315.","journal-title":"International Journal of Production Economics"},{"key":"2465_CR4","volume-title":"Multi objective optimization: Principles and case studies","author":"Y Collette","year":"2003","unstructured":"Collette, Y., & Siarry, P. (2003). Multi objective optimization: Principles and case studies. Berlin: Springer."},{"key":"2465_CR5","doi-asserted-by":"crossref","first-page":"938","DOI":"10.1016\/j.cor.2005.05.018","volume":"34","author":"R Companys","year":"2007","unstructured":"Companys, R., & Mateo, M. (2007). Different behaviour of a double branch-and-bound algorithm on \n                        $$Fm|prmu|Cmax$$\n                        \n                            \n                                \n                                    F\n                                    m\n                                    |\n                                    p\n                                    r\n                                    m\n                                    u\n                                    |\n                                    C\n                                    m\n                                    a\n                                    x\n                                \n                            \n                        \n                     and \n                        $$Fm|block|Cmax$$\n                        \n                            \n                                \n                                    F\n                                    m\n                                    |\n                                    b\n                                    l\n                                    o\n                                    c\n                                    k\n                                    |\n                                    C\n                                    m\n                                    a\n                                    x\n                                \n                            \n                        \n                     problems. Computers and Operations Research, 34, 938\u2013953.","journal-title":"Computers and Operations Research"},{"key":"2465_CR6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-642-17144-4_4","volume":"535","author":"J Dario Landa Silva","year":"2004","unstructured":"Dario Landa Silva, J., Burke, Edmund K., & Petrovic, S. (2004). An introduction to multiobjective metaheuristics for scheduling and timetabling. Lecture Notes in Economics and Mathematical Systems, 535, 91\u2013129.","journal-title":"Lecture Notes in Economics and Mathematical Systems"},{"key":"2465_CR7","doi-asserted-by":"crossref","unstructured":"Davendra, D., Bialic-Davendra, M., Senkerik, R., & Pluhacek, M. (2013). Scheduling the flow shop with blocking problem with the chaos-induced discrete self organising migrating algorithm. In Proceedings 27th European conference on modelling and simulation.","DOI":"10.7148\/2013-0386"},{"key":"2465_CR8","doi-asserted-by":"crossref","unstructured":"Deb, K. (2008). Introduction to evolutionary multiobjective optimization. In J. Branke, K Deb, K. Miettinen, R. S\u0142owi\u0144ski (Eds.), Multiobjective Optimization. Lecture Notes in Computer Science (vol. 5252). Berlin: Springer.","DOI":"10.1007\/978-3-540-88908-3_3"},{"issue":"2","key":"2465_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 multi-objective genetic algorithm: NSGA-II. IEEE Transaction on Evolutionary Computation, 6(2), 182\u2013197.","journal-title":"IEEE Transaction on Evolutionary Computation"},{"key":"2465_CR10","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1016\/S1004-9541(12)60588-6","volume":"20","author":"G Deng","year":"2012","unstructured":"Deng, G., Xu, Z., & Gu, X. (2012). A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling. Chinese Journal of Chemical Engineering, 20, 1067\u20131073.","journal-title":"Chinese Journal of Chemical Engineering"},{"key":"2465_CR11","volume-title":"Genetic algorithms and engineering optimization","author":"M Gen","year":"2000","unstructured":"Gen, M., & Cheng, R. (2000). Genetic algorithms and engineering optimization. New York: Wiley."},{"key":"2465_CR12","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"5","author":"P Gilmore","year":"1964","unstructured":"Gilmore, P., & Gomory, R. (1964). Sequencing a one state variable machine: A solvable case of the traveling salesman problem. Operations Research, 5, 655\u2013679.","journal-title":"Operations Research"},{"key":"2465_CR13","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.omega.2005.07.004","volume":"3","author":"J Grabowski","year":"2007","unstructured":"Grabowski, J., & Pempera, J. (2007). The permutation flowshop problem with blocking. a tabu search approach. Omega, 3, 302\u201311.","journal-title":"Omega"},{"key":"2465_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Rinnooy, K. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"2465_CR15","first-page":"1","volume":"47","author":"Y-Y Han","year":"2014","unstructured":"Han, Y.-Y., Gong, D., & Sun, X. (2014). A discrete artificial bee colony algorithm differential evolution for the flow-shop scheduling problem with blocking. Engineering Optimization, 47, 1\u201320.","journal-title":"Engineering Optimization"},{"key":"2465_CR16","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s00170-012-4493-5","volume":"67","author":"Y-Y Han","year":"2013","unstructured":"Han, Y.-Y., Liang, J., Pan, Q.-K., Li, J.-Q., Sang, H.-Y., & Cao, N. (2013). Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem. International Journal of Advanced Manufacturing Technology, 67, 397\u2013414.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"2465_CR17","volume-title":"Adaptation in natural and artificial systems","author":"H Holland","year":"1975","unstructured":"Holland, H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press."},{"key":"2465_CR18","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 Transactions on Systems, Man and Cybernetics\u2014Part C: Applications and Reviews, 28, 392\u2013403.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics\u2014Part C: Applications and Reviews"},{"key":"2465_CR19","unstructured":"Ishibuchi, H., Murata, T., & Tomioka, S. (1997). Effectiveness of genetic local search algorithms. Proceedings of the seventh international conference on genetic algorithms (pp. 505\u2013512)."},{"key":"2465_CR20","first-page":"861","volume":"20","author":"F Jolai","year":"2013","unstructured":"Jolai, F., Asefi, H., Rabiee, M., & Ramezanid, P. (2013). Bi-objective simulated annealing approaches for no-wait two-stage flexible flow shop scheduling problem. Scientia Iranica, Transactions E: Industrial Engineering, 20, 861\u2013872.","journal-title":"Scientia Iranica, Transactions E: Industrial Engineering"},{"key":"2465_CR21","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/S0360-8352(01)00036-5","volume":"40","author":"A Kamrani","year":"2001","unstructured":"Kamrani, A., Rong, W., & Gonzalez, R. (2001). A genetic algorithm methodology for data mining and intelligent knowledge acquisition. Computers & Industrial Engineering, 40, 361\u2013377.","journal-title":"Computers & Industrial Engineering"},{"key":"2465_CR22","first-page":"21131","volume":"2","author":"S Karabati","year":"1996","unstructured":"Karabati, S., & Kouvelis, P. (1996). Cycle scheduling in flow lines: Modeling observations, effective heuristics and a cycle time minimization procedure. Naval Research Logistics, 2, 21131.","journal-title":"Naval Research Logistics"},{"key":"2465_CR23","first-page":"301","volume":"23","author":"D Khorasanian","year":"2012","unstructured":"Khorasanian, D., & Moslehi, G. (2012). An iterated greedy algorithm for solving the blocking flow shop scheduling problem with total flow time criteria. International Journal of Industrial Engineering and Production Research, 23, 301\u2013308.","journal-title":"International Journal of Industrial Engineering and Production Research"},{"key":"2465_CR24","first-page":"19728","volume":"12","author":"EM Levner","year":"1969","unstructured":"Levner, E. M. (1969). Optimal planning of parts machining on a number of machines. Automation and Remote Control, 12, 19728.","journal-title":"Automation and Remote Control"},{"key":"2465_CR25","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/j.omega.2012.03.006","volume":"41","author":"S Lin","year":"2013","unstructured":"Lin, S., & Ying, K. (2013). Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm. Omega, 41, 383\u2013389.","journal-title":"Omega"},{"key":"2465_CR26","volume-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Z Michalewicz","year":"1999","unstructured":"Michalewicz, Z. (1999). Genetic Algorithms + Data Structures = Evolution Programs. Berlin: Springer."},{"key":"2465_CR27","doi-asserted-by":"crossref","first-page":"1874","DOI":"10.1016\/j.cor.2013.02.003","volume":"40","author":"G Moslehi","year":"2013","unstructured":"Moslehi, G., & Khorasanian, D. (2013). Optimizing blocking flowshop scheduling problem with total completion time criterion. Computers and Operations Research, 40, 1874\u20131883.","journal-title":"Computers and Operations Research"},{"key":"2465_CR28","unstructured":"Murata, T., Ishibuchi, H., & Gen, M. (2000). Cellular genetic local search for multiobjective optimization. In Proceedings of the 2000 genetic and evolutionary computation conference, (pp. 307\u2013314)."},{"key":"2465_CR29","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. Computers & Industrial Engineering, 30, 957\u2013968.","journal-title":"Computers & Industrial Engineering"},{"key":"2465_CR30","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1993","unstructured":"Nawaz, M., Enscore, J., & Ham, I. (1993). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11, 91\u201395.","journal-title":"Omega"},{"key":"2465_CR31","doi-asserted-by":"crossref","unstructured":"Nouri, N., & Ladhari, T. (2015). Minimizing regular objectives for blocking permutation flow shop scheduling: Heuristic approaches. In Proceedings of the genetic and evolutionary computation conference (pp. 441\u2013448).","DOI":"10.1145\/2739480.2754638"},{"key":"2465_CR32","doi-asserted-by":"crossref","first-page":"2498","DOI":"10.1016\/j.cor.2008.10.008","volume":"36","author":"Q-K Pan","year":"2009","unstructured":"Pan, Q.-K., Wang, L., & Qian, B. (2009). A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems. Computers & Operations Research, 36, 2498\u20132511.","journal-title":"Computers & Operations Research"},{"key":"2465_CR33","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1109\/TASE.2012.2219860","volume":"10","author":"Q Pan","year":"2013","unstructured":"Pan, Q., Wang, L., Sang, H., Li, J., & Liu, M. (2013). A high performing memetic algorithm for the flowshop scheduling problem with blocking. IEEE Transactions on Automation Science and Engineering, 10, 741\u2013756.","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"2465_CR34","volume-title":"Scheduling: theory, algorithms, and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: theory, algorithms, and systems. Englewood CliKs, NJ: Prentice-Hall."},{"key":"2465_CR35","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1007\/s00170-003-1731-x","volume":"23","author":"SG Ponnambalam","year":"2004","unstructured":"Ponnambalam, S. G., Jagannathan, H., Kataria, M., & Gadicherla, A. (2004). A TSP-GA multi-objective algorithm for flow shop scheduling. International Journal of Advanced Manufacturing Technology, 23, 909\u2013915.","journal-title":"International Journal of Advanced Manufacturing Technology"},{"key":"2465_CR36","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s00500-007-0210-y","volume":"12","author":"A Rahimi-Vahed","year":"2008","unstructured":"Rahimi-Vahed, A., & Mirzaei, A. H. (2008). Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm. Soft Computing, 12, 435\u2013452.","journal-title":"Soft Computing"},{"key":"2465_CR37","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10878-006-9015-7","volume":"13","author":"AR Rahimi-Vahed","year":"2007","unstructured":"Rahimi-Vahed, A. R., & Mirghorbani, S. M. (2007). A multi-objective particle swarm for a flow shop scheduling problem. Journal of Combinatorial Optimization, 13, 79\u2013102.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2465_CR38","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, S. J., & Sivaraman, R. (2005). Flow shop scheduling with multiple objective of minimizing makespan and total flow time. International Journal of Advance Manufacturing Technology, 25, 1007\u20131012.","journal-title":"International Journal of Advance Manufacturing Technology"},{"key":"2465_CR39","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1057\/jors.1972.52","volume":"3","author":"S Reddi","year":"1972","unstructured":"Reddi, S., & Ramamoorthy, C. (1972). On the flow-shop sequencing problem with no wait in process. Operational Research Quarterly, 3, 323\u201331.","journal-title":"Operational Research Quarterly"},{"key":"2465_CR40","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.cie.2015.04.013","volume":"87","author":"I Ribas","year":"2015","unstructured":"Ribas, I., & Companys, R. (2015). Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. Computers & Industrial Engineering, 87, 30\u201339.","journal-title":"Computers & Industrial Engineering"},{"key":"2465_CR41","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.omega.2010.07.007","volume":"3","author":"I Ribas","year":"2011","unstructured":"Ribas, I., Companys, R., & Tort-Martorell, X. (2011). An iterated greedy algorithm for the flowhsop scheduling problem with blocking. Omega, 3, 293\u2013301.","journal-title":"Omega"},{"issue":"17","key":"2465_CR42","doi-asserted-by":"crossref","first-page":"5238","DOI":"10.1080\/00207543.2013.802390","volume":"51","author":"I Ribas","year":"2013","unstructured":"Ribas, I., Companys, R., & Tort-Martorell, X. (2013). An efficient iterated local search algorithm for the total tardiness blocking flow shop problem. International Journal of Production Research, 51(17), 5238\u20135252.","journal-title":"International Journal of Production Research"},{"key":"2465_CR43","doi-asserted-by":"crossref","first-page":"6155","DOI":"10.1016\/j.eswa.2015.03.026","volume":"42","author":"I Ribas","year":"2015","unstructured":"Ribas, I., Companys, R., & Tort-Martorell, X. (2015). An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization. Expert Systems with Applications, 42, 6155\u20136167.","journal-title":"Expert Systems with Applications"},{"key":"2465_CR44","first-page":"1","volume":"28","author":"H Rock","year":"1984","unstructured":"Rock, H. (1984). Some new results in flow shop scheduling. Zeitschrift fur Operations Research, 28, 1\u201316.","journal-title":"Zeitschrift fur Operations Research"},{"key":"2465_CR45","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10479-005-2444-3","volume":"1","author":"DP Ronconi","year":"2005","unstructured":"Ronconi, D. P. (2005). A branch-and-bound algorithm to minimize the makespan in a flowshop problem with blocking. Annals of Operations Research, 1, 53\u201365.","journal-title":"Annals of Operations Research"},{"key":"2465_CR46","first-page":"12897","volume":"11","author":"DP Ronconi","year":"2001","unstructured":"Ronconi, D. P., & Armentano, V. A. (2001). Lower bounding schemes for flowshops with blocking in-process. Journal of the Operational Research Society, 11, 12897.","journal-title":"Journal of the Operational Research Society"},{"key":"2465_CR47","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.omega.2007.01.003","volume":"2","author":"DP Ronconi","year":"2009","unstructured":"Ronconi, D. P., & Henriques, L. R. S. (2009). Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega, 2, 272\u201381.","journal-title":"Omega"},{"key":"2465_CR48","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/j.procs.2015.09.211","volume":"61","author":"M Sadaqa","year":"2015","unstructured":"Sadaqa, M., & Moraga, R. J. (2015). Scheduling blocking flow shops using meta-RaPS. Procedia Computer Science, 61, 533\u2013538.","journal-title":"Procedia Computer Science"},{"key":"2465_CR49","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, J. D. (1985). Multiple objective optimization with vector evaluated genetic algorithms. In J. D. Schaffer (Ed.), Genetic algorithms and their applications: Proceedings of the first international conference on genetic algorithms (pp. 93\u2013100). Hillsdale, NJ: Lawrence Erlbaum."},{"key":"2465_CR50","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.cie.2015.09.003","volume":"90","author":"C Smutnicki","year":"2015","unstructured":"Smutnicki, C., Pempera, J., Rudy, J., & Zelazny, D. (2015). A new approach for multi-criteria scheduling. Computers & Industrial Engineering, 90, 212\u2013220.","journal-title":"Computers & Industrial Engineering"},{"key":"2465_CR51","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"2","author":"N Srinivas","year":"1995","unstructured":"Srinivas, N., & Deb, K. (1995). Multiobjective function optimization using nondominated sorting genetic algorithms. Evolutionary Computation, 2, 221\u2013248.","journal-title":"Evolutionary Computation"},{"issue":"3","key":"2465_CR52","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1162\/evco.1994.2.3.221","volume":"V2","author":"N Srinivas","year":"1995","unstructured":"Srinivas, N., & Deb, K. (1995). Multiobjective function optimization using nondominated sorting genetic algorithms. Evolutionary Computation, V2(3), 221\u2013248.","journal-title":"Evolutionary Computation"},{"key":"2465_CR53","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0098-1354(81)87003-2","volume":"2","author":"I Suhami","year":"1981","unstructured":"Suhami, I., & Mah, R. S. H. (1981). An implicit enumeration scheme for the flowshop problem with no intermediate storage. Computers and Chemical Engineering, 2, 83\u201391.","journal-title":"Computers and Chemical Engineering"},{"key":"2465_CR54","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278\u201385.","journal-title":"European Journal of Operational Research"},{"key":"2465_CR55","first-page":"49","volume-title":"Proceedings of the First IEEE SymposiumonComputational Intelligence","author":"R Tavakkoli-Moghaddam","year":"2007","unstructured":"Tavakkoli-Moghaddam, R., Rahimi-Vahed, A. R., & Mirzaei, A. H. (2007). Solving a bi-criteria permutation flow shop problem using immune algorithm. Proceedings of the First IEEE SymposiumonComputational Intelligence (Vol. 1, pp. 49\u201356). Hawaii: Honolulu."},{"key":"2465_CR56","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, S. K. (2004). Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan. European Journal of Operational Research, 157, 286\u2013295.","journal-title":"European Journal of Operational Research"},{"issue":"2000","key":"2465_CR57","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1162\/106365600568158","volume":"8","author":"DA Veldhuizen Van","year":"2000","unstructured":"Van Veldhuizen, D. A., & Lamont, G. B. (2000). Multiobjective evolutionary algorithms: Analyzing the state-of-the-art. Journal of Evolutionary Computation, 8(2000), 125\u2013147.","journal-title":"Journal of Evolutionary Computation"},{"key":"2465_CR58","unstructured":"Veldhuizen, D. V. (1999). Multiobjective evolutionary algorithms: Classifications, analyses, and new innovations. Ph. D. Thesis, Dayton, OH: Air Force Institute of Technology."},{"key":"2465_CR59","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.asoc.2011.09.021","volume":"12","author":"X Wang","year":"2012","unstructured":"Wang, X., & Tang, L. (2012). A discrete particle swarm optimization algorithm with self-adaptive diversity control for the permutation flowshop problem with blocking. Applied Soft Computing, 12, 652\u2013662.","journal-title":"Applied Soft Computing"},{"key":"2465_CR60","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cor.2008.12.004","volume":"3","author":"L Wang","year":"2010","unstructured":"Wang, L., Pan, Q., Suganthan, P., Wang, W., & Wang, Y. (2010). A novel hybrid discrete differential evolution algorithm for blocking flowshop scheduling problems. Computers and Operational Research, 3, 509\u2013520.","journal-title":"Computers and Operational Research"},{"key":"2465_CR61","doi-asserted-by":"crossref","first-page":"7929","DOI":"10.1016\/j.eswa.2010.04.042","volume":"12","author":"L Wang","year":"2010","unstructured":"Wang, L., Pan, Q., & Tasgetiren, M. (2010). Minimizing the total flow time in a flowshop with blocking by using hybrid harmony search algorithms. Expert Systems with Applications, 12, 7929\u20137936.","journal-title":"Expert Systems with Applications"},{"issue":"10","key":"2465_CR62","doi-asserted-by":"crossref","first-page":"2960","DOI":"10.1016\/j.cor.2005.02.028","volume":"33","author":"L Wang","year":"2006","unstructured":"Wang, L., Zhang, L., & Zheng, D.-Z. (2006). An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Computers and Operations Research, 33(10), 2960\u20132971. (Part Special Issue: Constraint Programming).","journal-title":"Computers and Operations Research"},{"key":"2465_CR63","doi-asserted-by":"crossref","first-page":"3978","DOI":"10.1016\/j.proeng.2011.08.745","volume":"15","author":"Y Yusoff","year":"2011","unstructured":"Yusoff, Y., Ngadiman, M. S., & Zain, A. M. (2011). Overview of NSGA-II for optimizing machining process parameters. Procedia Engineering, 15, 3978\u20133983.","journal-title":"Procedia Engineering"},{"key":"2465_CR64","unstructured":"Zitzler, E. (1999). Evolutionary algorithms for multi-objective optimization: Methods and applications. Ph.D. Thesis, Dissertation ETH No. 13398, Swiss Federal Institute of Technology (ETH), Zrich, Switzerland."},{"key":"2465_CR65","unstructured":"Zitzler, E., Laumanns, M., & Thiele, L. (2001). SPEA2: Improving the strength pareto evolutionary algorithm. Computer Engineering and Networks Laboratory (TIK) -Report 103 Sept."},{"issue":"4","key":"2465_CR66","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 optimization using evolutionary algorithms\u2014A 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":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2465-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2465-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2465-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T07:49:33Z","timestamp":1530776973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2465-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,23]]},"references-count":66,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["2465"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2465-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,23]]}}}