{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T16:26:55Z","timestamp":1768667215881,"version":"3.49.0"},"reference-count":84,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T00:00:00Z","timestamp":1543363200000},"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":["Neural Comput & Applic"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00521-018-3898-y","type":"journal-article","created":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T07:00:33Z","timestamp":1543388433000},"page":"9073-9093","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Mathematical programming and three metaheuristic algorithms for a bi-objective supply chain scheduling problem"],"prefix":"10.1007","volume":"31","author":[{"given":"Hamid","family":"Zarei","sequence":"first","affiliation":[]},{"given":"Morteza","family":"Rasti-Barzoki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,28]]},"reference":[{"key":"3898_CR1","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.ejor.2004.03.001","volume":"163","author":"H Stadtler","year":"2005","unstructured":"Stadtler H (2005) Supply chain management and advanced planning\u2014basics, overview and challenges. Eur J Oper Res 163:575\u2013588","journal-title":"Eur J Oper Res"},{"key":"3898_CR2","doi-asserted-by":"crossref","first-page":"2581","DOI":"10.1016\/j.tcs.2009.02.019","volume":"410","author":"C-S Su","year":"2009","unstructured":"Su C-S, Pan JC-H, Hsu T-S (2009) A new heuristic algorithm for the machine scheduling problem with job delivery coordination. Theoret Comput Sci 410:2581\u20132591","journal-title":"Theoret Comput Sci"},{"key":"3898_CR3","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1007\/s00521-015-1828-9","volume":"26","author":"A Mortazavi","year":"2015","unstructured":"Mortazavi A, Khamseh AA, Naderi B (2015) A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems. Neural Comput Appl 26:1709\u20131723","journal-title":"Neural Comput Appl"},{"key":"3898_CR4","doi-asserted-by":"crossref","first-page":"3280","DOI":"10.1016\/j.apm.2014.11.031","volume":"39","author":"M Rasti-Barzoki","year":"2015","unstructured":"Rasti-Barzoki M, Hejazi SR (2015) Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling. Appl Math Model 39:3280\u20133289","journal-title":"Appl Math Model"},{"key":"3898_CR5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/j.rser.2003.12.007","volume":"8","author":"S Pohekar","year":"2004","unstructured":"Pohekar S, Ramachandran M (2004) Application of multi-criteria decision making to sustainable energy planning\u2014a review. Renew Sustain Energy Rev 8:365\u2013381","journal-title":"Renew Sustain Energy Rev"},{"key":"3898_CR6","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1007\/s00521-011-0659-6","volume":"21","author":"L Jia","year":"2012","unstructured":"Jia L, Cheng D, Chiu M-S (2012) Pareto-optimal solutions based multi-objective particle swarm optimization control for batch processes. Neural Comput Appl 21:1107\u20131116","journal-title":"Neural Comput Appl"},{"key":"3898_CR7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1080\/09540091.2015.1092499","volume":"27","author":"JA Khan","year":"2015","unstructured":"Khan JA, Raja MAZ, Rashidi MM, Syam MI, Wazwaz AM (2015) Nature-inspired computing approach for solving non-linear singular Emden-Fowler problem arising in electromagnetic theory. Connect Sci 27:377\u2013396","journal-title":"Connect Sci"},{"key":"3898_CR8","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1016\/j.ins.2014.04.036","volume":"279","author":"MAZ Raja","year":"2014","unstructured":"Raja MAZ (2014) Stochastic numerical treatment for solving Troesch\u2019s problem. Inf Sci 279:860\u2013873","journal-title":"Inf Sci"},{"key":"3898_CR9","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1186\/s40064-016-3517-2","volume":"5","author":"I Ahmad","year":"2016","unstructured":"Ahmad I, Raja MAZ, Bilal M, Ashraf F (2016) Bio-inspired computational heuristics to study Lane-Emden systems arising in astrophysics model. SpringerPlus 5:1866","journal-title":"SpringerPlus"},{"key":"3898_CR10","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.asoc.2018.01.009","volume":"65","author":"Z Sabir","year":"2018","unstructured":"Sabir Z, Manzar MA, Raja MAZ, Sheraz M, Wazwaz AM (2018) Neuro-heuristics for nonlinear singular Thomas-Fermi systems. Appl Soft Comput 65:152\u2013169","journal-title":"Appl Soft Comput"},{"key":"3898_CR11","unstructured":"Chaquet JssM, Carmona EJ (2017) Using covariance matrix adaptation evolution strategies for solving different types of differential equations. Soft Comput 1\u201324"},{"key":"3898_CR12","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1016\/j.asoc.2012.05.014","volume":"12","author":"JM Chaquet","year":"2012","unstructured":"Chaquet JM, Carmona EJ (2012) Solving differential equations with fourier series and evolution strategies. Appl Soft Comput 12:3051\u20133062","journal-title":"Appl Soft Comput"},{"key":"3898_CR13","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1080\/09540091.2014.907555","volume":"26","author":"MAZ Raja","year":"2014","unstructured":"Raja MAZ (2014) Solution of the one-dimensional Bratu equation arising in the fuel ignition model using ANN optimised with PSO and SQP. Connect Sci 26:195\u2013214","journal-title":"Connect Sci"},{"issue":"6","key":"3898_CR14","doi-asserted-by":"crossref","first-page":"1905","DOI":"10.1007\/s00521-016-2806-6","volume":"30","author":"MAZ Raja","year":"2016","unstructured":"Raja MAZ, Mehmood A, Niazi SA, Shah SM (2016) Computational intelligence methodology for the analysis of RC circuit modelled with nonlinear differential order system. Neural Comput Appl 30(6):1905\u20131924","journal-title":"Neural Comput Appl"},{"key":"3898_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.neucom.2016.08.079","volume":"221","author":"Z Masood","year":"2017","unstructured":"Masood Z, Majeed K, Samar R, Raja MAZ (2017) Design of Mexican Hat Wavelet neural networks for solving Bratu type nonlinear systems. Neurocomputing 221:1\u201314","journal-title":"Neurocomputing"},{"key":"3898_CR16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.neucom.2014.12.084","volume":"156","author":"J Wang","year":"2015","unstructured":"Wang J, Wang J (2015) Forecasting stock market indexes using principle component analysis and stochastic time effective neural networks. Neurocomputing 156:68\u201378","journal-title":"Neurocomputing"},{"key":"3898_CR17","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/j.asoc.2016.10.009","volume":"52","author":"MAZ Raja","year":"2017","unstructured":"Raja MAZ, Shah FH, Alaidarous ES, Syam MI (2017) Design of bio-inspired heuristic technique integrated with interior-point algorithm to analyze the dynamics of heartbeat model. Appl Soft Comput 52:605\u2013629","journal-title":"Appl Soft Comput"},{"key":"3898_CR18","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.epsr.2016.03.005","volume":"136","author":"M Ibrahim","year":"2016","unstructured":"Ibrahim M, Jemei S, Wimmer G, Hissel D (2016) Nonlinear autoregressive neural network in an energy management strategy for battery\/ultra-capacitor hybrid electrical vehicles. Electr Power Syst Res 136:262\u2013269","journal-title":"Electr Power Syst Res"},{"key":"3898_CR19","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.compchemeng.2017.02.006","volume":"106","author":"LS Dias","year":"2017","unstructured":"Dias LS, Ierapetritou MG (2017) From process control to supply chain management: an overview of integrated decision making strategies. Comput Chem Eng 106:826\u2013835","journal-title":"Comput Chem Eng"},{"key":"3898_CR20","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jmsy.2017.12.002","volume":"46","author":"M Yavari","year":"2018","unstructured":"Yavari M, Isvandi S (2018) Integrated decision making for parts ordering and scheduling of jobs on two-stage assembly problem in three level supply chain. J Manuf Syst 46:137\u2013151","journal-title":"J Manuf Syst"},{"key":"3898_CR21","doi-asserted-by":"crossref","first-page":"1598","DOI":"10.1016\/j.jclepro.2017.06.180","volume":"165","author":"K Govindan","year":"2017","unstructured":"Govindan K, Darbari JD, Agarwal V, Jha PC (2017) Fuzzy multi-objective approach for optimal selection of suppliers and transportation decisions in an eco-efficient closed loop supply chain network. J Clean Prod 165:1598\u20131619","journal-title":"J Clean Prod"},{"key":"3898_CR22","doi-asserted-by":"crossref","first-page":"3163","DOI":"10.1007\/s00521-016-2226-7","volume":"28","author":"M-W Li","year":"2017","unstructured":"Li M-W, Hong W-C, Geng J, Wang J (2017) Berth and quay crane coordinated scheduling using multi-objective chaos cloud particle swarm optimization algorithm. Neural Comput Appl 28:3163\u20133182","journal-title":"Neural Comput Appl"},{"key":"3898_CR23","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1287\/opre.42.2.234","volume":"42","author":"MA Trick","year":"1994","unstructured":"Trick MA (1994) Scheduling multiple variable-speed machines. Oper Res 42:234\u2013248","journal-title":"Oper Res"},{"key":"3898_CR24","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10951-005-6813-1","volume":"8","author":"NV Shakhlevich","year":"2005","unstructured":"Shakhlevich NV, Strusevich VA (2005) Pre-emptive scheduling problems with controllable processing times. J Sched 8:233\u2013253","journal-title":"J Sched"},{"key":"3898_CR25","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/j.ejor.2004.07.012","volume":"167","author":"RK Kayan","year":"2005","unstructured":"Kayan RK, Akturk MS (2005) A new bounding mechanism for the CNC machine scheduling problems with controllable processing times. Eur J Oper Res 167:624\u2013643","journal-title":"Eur J Oper Res"},{"key":"3898_CR26","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.1007\/s00521-014-1778-7","volume":"26","author":"H Mokhtari","year":"2015","unstructured":"Mokhtari H (2015) Designing an efficient bi-criteria iterated greedy heuristic for simultaneous order scheduling and resource allocation: a balance between cost and lateness measures. Neural Comput Appl 26:1085\u20131101","journal-title":"Neural Comput Appl"},{"key":"3898_CR27","unstructured":"Li L, Yan P, Ji P, Wang J-B (2016) Scheduling jobs with simultaneous considerations of controllable processing times and learning effect. Neural Comput Appl 1\u20138"},{"key":"3898_CR28","unstructured":"Li L, Wang J-J (2016) Scheduling jobs with deterioration effect and controllable processing time. Neural Comput Appl 1\u20138"},{"key":"3898_CR29","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s10479-005-6234-8","volume":"135","author":"NG Hall","year":"2005","unstructured":"Hall NG, Potts CN (2005) The coordination of scheduling and batch deliveries. Ann Oper Res 135:41\u201364","journal-title":"Ann Oper Res"},{"key":"3898_CR30","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.ejor.2006.09.087","volume":"183","author":"MM Mazdeh","year":"2007","unstructured":"Mazdeh MM, Sarhadi M, Hindi KS (2007) A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs. Eur J Oper Res 183:74\u201386","journal-title":"Eur J Oper Res"},{"key":"3898_CR31","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ijpe.2014.08.017","volume":"160","author":"S Gao","year":"2015","unstructured":"Gao S, Qi L, Lei L (2015) Integrated batch production and distribution scheduling with limited vehicle capacity. Int J Prod Econ 160:13\u201325","journal-title":"Int J Prod Econ"},{"key":"3898_CR32","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.cor.2016.07.021","volume":"77","author":"O Shahvari","year":"2017","unstructured":"Shahvari O, Logendran R (2017) An enhanced tabu search algorithm to minimize a bi-criteria objective in batching and scheduling problems on unrelated-parallel machines with desired lower bounds on batch sizes. Comput Oper Res 77:154\u2013176","journal-title":"Comput Oper Res"},{"key":"3898_CR33","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1007\/s00521-014-1765-z","volume":"26","author":"A Noroozi","year":"2015","unstructured":"Noroozi A, Mokhtari H (2015) Scheduling of printed circuit board (PCB) assembly systems with heterogeneous processors using simulation-based intelligent optimization methods. Neural Comput Appl 26:857\u2013873","journal-title":"Neural Comput Appl"},{"key":"3898_CR34","doi-asserted-by":"crossref","first-page":"1401","DOI":"10.1108\/K-07-2017-0275","volume":"47","author":"A Borumand","year":"2018","unstructured":"Borumand A, Beheshtinia MA (2018) A developed genetic algorithm for solving the multi-objective supply chain scheduling problem. Kybernetes 47:1401\u20131419","journal-title":"Kybernetes"},{"key":"3898_CR35","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.asoc.2016.08.019","volume":"49","author":"A Hassanzadeh","year":"2016","unstructured":"Hassanzadeh A, Rasti-Barzoki M, Khosroshahi H (2016) Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment. Appl Soft Comput 49:335\u2013351","journal-title":"Appl Soft Comput"},{"key":"3898_CR36","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/j.neucom.2012.08.011","volume":"101","author":"A Noroozi","year":"2013","unstructured":"Noroozi A, Mokhtari H, Abadi INK (2013) Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines. Neurocomputing 101:190\u2013203","journal-title":"Neurocomputing"},{"key":"3898_CR37","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s00521-016-2339-z","volume":"28","author":"X Zhang","year":"2017","unstructured":"Zhang X, Li X, Wang J (2017) Local search algorithm with path relinking for single batch-processing machine scheduling problem. Neural Comput Appl 28:313\u2013326","journal-title":"Neural Comput Appl"},{"key":"3898_CR38","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.ejor.2013.01.002","volume":"228","author":"M Rasti-Barzoki","year":"2013","unstructured":"Rasti-Barzoki M, Hejazi SR (2013) Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains. Eur J Oper Res 228:345\u2013357","journal-title":"Eur J Oper Res"},{"key":"3898_CR39","doi-asserted-by":"crossref","first-page":"5583","DOI":"10.1080\/00207543.2014.886027","volume":"52","author":"Y Yin","year":"2014","unstructured":"Yin Y, Cheng T, Wu C-C, Cheng S-R (2014) Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity. Int J Prod Res 52:5583\u20135596","journal-title":"Int J Prod Res"},{"key":"3898_CR40","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.jmsy.2017.11.001","volume":"46","author":"A Noroozi","year":"2018","unstructured":"Noroozi A, Mazdeh MM, Heydari M, Rasti-Barzoki M (2018) Coordinating order acceptance and integrated production-distribution scheduling with batch delivery considering Third Party Logistics distribution. J Manuf Syst 46:29\u201345","journal-title":"J Manuf Syst"},{"key":"3898_CR41","doi-asserted-by":"crossref","first-page":"4797","DOI":"10.1080\/00207543.2013.774475","volume":"51","author":"M Yousefi","year":"2013","unstructured":"Yousefi M, Yusuff RM (2013) Minimising earliness and tardiness penalties in single machine scheduling against common due date using imperialist competitive algorithm. Int J Prod Res 51:4797\u20134804","journal-title":"Int J Prod Res"},{"key":"3898_CR42","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.asoc.2016.12.038","volume":"53","author":"CM Joo","year":"2017","unstructured":"Joo CM, Kim BS (2017) Rule-based meta-heuristics for integrated scheduling of unrelated parallel machines, batches, and heterogeneous delivery trucks. Appl Soft Comput 53:457\u2013476","journal-title":"Appl Soft Comput"},{"key":"3898_CR43","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1016\/j.ejor.2006.11.047","volume":"189","author":"B Chen","year":"2008","unstructured":"Chen B, Lee C-Y (2008) Logistics scheduling with batching and transportation. Eur J Oper Res 189:871\u2013876","journal-title":"Eur J Oper Res"},{"key":"3898_CR44","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/j.ejor.2014.03.039","volume":"238","author":"A Agnetis","year":"2014","unstructured":"Agnetis A, Aloulou MA, Fu L-L (2014) Coordination of production and interstage batch delivery with outsourced distribution. Eur J Oper Res 238:130\u2013142","journal-title":"Eur J Oper Res"},{"key":"3898_CR45","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.asoc.2016.06.005","volume":"47","author":"P Assarzadegan","year":"2016","unstructured":"Assarzadegan P, Rasti-Barzoki M (2016) Minimizing sum of the due date assignment costs, maximum tardiness and distribution costs in a supply chain scheduling problem. Appl Soft Comput 47:343\u2013356","journal-title":"Appl Soft Comput"},{"key":"3898_CR46","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/j.cor.2014.08.012","volume":"53","author":"F Ahmadizar","year":"2015","unstructured":"Ahmadizar F, Farhadi S (2015) Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs. Comput Oper Res 53:194\u2013205","journal-title":"Comput Oper Res"},{"key":"3898_CR47","unstructured":"Kashan AH, Keshmiry M, Dahooie JH, Abbasi-Pooya A (2016) A simple yet effective grouping evolutionary strategy (GES) algorithm for scheduling parallel machines. Neural Comput Appl 1\u201314"},{"key":"3898_CR48","doi-asserted-by":"crossref","first-page":"1657","DOI":"10.1007\/s00521-015-1963-3","volume":"27","author":"H Mokhtari","year":"2016","unstructured":"Mokhtari H (2016) Research on group search optimizers for a reconfigurable flow shop sequencing problem. Neural Comput Appl 27:1657\u20131667","journal-title":"Neural Comput Appl"},{"key":"3898_CR49","first-page":"104","volume":"79","author":"J Zhang","year":"2018","unstructured":"Zhang J, Wang X, Huang K (2018) On-line scheduling of order picking and delivery with multiple zones and limited vehicle capacity. Omega (United Kingdom) 79:104\u2013115","journal-title":"Omega (United Kingdom)"},{"key":"3898_CR50","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.cie.2018.07.023","volume":"124","author":"S Sheikh","year":"2018","unstructured":"Sheikh S, Komaki GM, Kayvanfar V (2018) Multi objective two-stage assembly flow shop with release time. Comput Ind Eng 124:276\u2013292","journal-title":"Comput Ind Eng"},{"key":"3898_CR51","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/j.cie.2016.12.045","volume":"112","author":"M Gen","year":"2017","unstructured":"Gen M, Zhang W, Lin L, Yun Y (2017) Recent advances in hybrid evolutionary algorithms for multiobjective manufacturing scheduling. Comput Ind Eng 112:616\u2013633","journal-title":"Comput Ind Eng"},{"key":"3898_CR52","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 Evol Comput 6:182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"3898_CR53","unstructured":"Coello CAC, Lechuga MS (2002) MOPSO: a proposal for multiple objective particle swarm optimization. Proceedings of the 2002 congress on evolutionary computation, CEC \u201802, pp 1051\u20131056"},{"key":"3898_CR54","doi-asserted-by":"crossref","first-page":"6718","DOI":"10.1016\/j.apm.2013.01.050","volume":"37","author":"S Bandyopadhyay","year":"2013","unstructured":"Bandyopadhyay S, Bhattacharya R (2013) Solving multi-objective parallel machine scheduling problem by a modified NSGA-II. Appl Math Model 37:6718\u20136729","journal-title":"Appl Math Model"},{"key":"3898_CR55","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.asoc.2015.02.030","volume":"31","author":"A Mohtashami","year":"2015","unstructured":"Mohtashami A, Tavana M, Santos-Arteaga FJ, Fallahian-Najafabadi A (2015) A novel multi-objective meta-heuristic model for solving cross-docking scheduling problems. Appl Soft Comput 31:30\u201347","journal-title":"Appl Soft Comput"},{"key":"3898_CR56","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TEVC.2014.2308305","volume":"19","author":"X Zhang","year":"2015","unstructured":"Zhang X, Tian Y, Cheng R, Jin Y (2015) An efficient approach to nondominated sorting for evolutionary multiobjective optimization. IEEE Trans Evol Comput 19:201\u2013213","journal-title":"IEEE Trans Evol Comput"},{"key":"3898_CR57","doi-asserted-by":"crossref","first-page":"2218","DOI":"10.1016\/j.cor.2010.03.012","volume":"37","author":"D Shabtay","year":"2010","unstructured":"Shabtay D, Itskovich Y, Yedidsion L, Oron D (2010) Optimal due date assignment and resource allocation in a group technology scheduling environment. Comput Oper Res 37:2218\u20132228","journal-title":"Comput Oper Res"},{"key":"3898_CR58","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/j.cie.2011.08.014","volume":"62","author":"A Hamidinia","year":"2012","unstructured":"Hamidinia A, Khakabimamaghani S, Mazdeh MM, Jafari M (2012) A genetic algorithm for minimizing total tardiness\/earliness of weighted jobs in a batched delivery system. Comput Ind Eng 62:29\u201338","journal-title":"Comput Ind Eng"},{"key":"3898_CR59","doi-asserted-by":"crossref","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. Proceedings of the IEEE international conference on neural networks 1944: 1942\u20131948","DOI":"10.1109\/ICNN.1995.488968"},{"key":"3898_CR60","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. Swarm Intell 1:33\u201357","journal-title":"Swarm Intell"},{"key":"3898_CR61","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.cam.2014.11.056","volume":"280","author":"G Xu","year":"2015","unstructured":"Xu G, Yang Y-Q, Liu B-B, Xu Y-H, Wu A-J (2015) An efficient hybrid multi-objective particle swarm optimization with a multi-objective dichotomy line search. J Comput Appl Math 280:310\u2013326","journal-title":"J Comput Appl Math"},{"key":"3898_CR62","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.swevo.2017.02.007","volume":"35","author":"F Sheikholeslami","year":"2017","unstructured":"Sheikholeslami F, Navimipour NJ (2017) Service allocation in the cloud environments using multi-objective particle swarm optimization algorithm based on crowding distance. Swarm Evol Comput 35:53\u201364","journal-title":"Swarm Evol Comput"},{"key":"3898_CR63","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1016\/j.cam.2013.10.035","volume":"259","author":"L Cruz-Reyes","year":"2014","unstructured":"Cruz-Reyes L (2014) Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system. J Comput Appl Math 259:965\u2013977","journal-title":"J Comput Appl Math"},{"key":"3898_CR64","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.cam.2007.04.018","volume":"216","author":"P-Y Yin","year":"2008","unstructured":"Yin P-Y, Wang J-Y (2008) Optimal multiple-objective resource allocation using hybrid particle swarm optimization and adaptive resource bounds technique. J Comput Appl Math 216:73\u201386","journal-title":"J Comput Appl Math"},{"key":"3898_CR65","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1009626110229","volume":"6","author":"R Chelouah","year":"2000","unstructured":"Chelouah R, Siarry P (2000) A continuous genetic algorithm designed for the global optimization of multimodal functions. J Heuristics 6:191\u2013213","journal-title":"J Heuristics"},{"key":"3898_CR66","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/s00170-010-2775-3","volume":"52","author":"Q-K Pan","year":"2011","unstructured":"Pan Q-K, Wang L, Gao L, Li J (2011) An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem. Int J Adv Manuf Technol 52:699\u2013713","journal-title":"Int J Adv Manuf Technol"},{"key":"3898_CR67","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/S1568-4946(02)00065-0","volume":"2","author":"KW Kim","year":"2003","unstructured":"Kim KW, Gen M, Yamazaki G (2003) Hybrid genetic algorithm with fuzzy logic for resource-constrained project scheduling. Appl Soft Comput 2:174\u2013188","journal-title":"Appl Soft Comput"},{"key":"3898_CR68","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1080\/00207540310001619614","volume":"42","author":"F-C Tien","year":"2004","unstructured":"Tien F-C, Tsai C-Y (2004) Scanline-based stereo matching by genetic algorithms. Int J Prod Res 42:1083\u20131106","journal-title":"Int J Prod Res"},{"key":"3898_CR69","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1007\/s00170-007-1236-0","volume":"44","author":"K Kim","year":"2009","unstructured":"Kim K, Jeong I-J (2009) Flow shop scheduling with no-wait flexible lot streaming using an adaptive genetic algorithm. Int J Adv Manuf Technol 44:1181\u20131190","journal-title":"Int J Adv Manuf Technol"},{"key":"3898_CR70","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean JC (1994) Genetic algorithms and random keys for sequencing and optimization. ORSA J Comput 6:154\u2013160","journal-title":"ORSA J Comput"},{"key":"3898_CR71","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/978-3-540-92151-6_2","volume-title":"Differential evolution for permutation\u2014based combinatorial problems, Differential Evolution: a handbook for global permutation-based combinatorial optimization","author":"G Onwubolu","year":"2009","unstructured":"Onwubolu G, Davendra D (2009) Differential evolution for permutation\u2014based combinatorial problems, Differential Evolution: a handbook for global permutation-based combinatorial optimization. Springer, Berlin, pp 13\u201334"},{"key":"3898_CR72","doi-asserted-by":"crossref","first-page":"2840","DOI":"10.1016\/j.asoc.2012.03.031","volume":"12","author":"S-Y Lin","year":"2012","unstructured":"Lin S-Y, Horng S-J, Kao T-W, Fahn C-S, Huang D-K, Run R-S, Wang Y-R, Kuo I-H (2012) Solving the bi-objective personnel assignment problem using particle swarm optimization. Appl Soft Comput 12:2840\u20132845","journal-title":"Appl Soft Comput"},{"key":"3898_CR73","doi-asserted-by":"crossref","first-page":"2629","DOI":"10.1016\/j.eswa.2009.08.015","volume":"37","author":"T-L Lin","year":"2010","unstructured":"Lin T-L, Horng S-J, Kao T-W, Chen Y-H, Run R-S, Chen R-J, Lai J-L, Kuo I-H (2010) An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Syst Appl 37:2629\u20132636","journal-title":"Expert Syst Appl"},{"key":"3898_CR74","doi-asserted-by":"crossref","first-page":"7825","DOI":"10.1016\/j.eswa.2010.04.056","volume":"37","author":"S-Y Lin","year":"2010","unstructured":"Lin S-Y, Horng S-J, Kao T-W, Huang D-K, Fahn C-S, Lai J-L, Chen R-J, Kuo I-H (2010) An efficient bi-objective personnel assignment algorithm based on a hybrid particle swarm optimization model. Expert Syst Appl 37:7825\u20137830","journal-title":"Expert Syst Appl"},{"key":"3898_CR75","doi-asserted-by":"crossref","first-page":"3252","DOI":"10.1016\/j.eswa.2010.08.111","volume":"38","author":"Q-K Pan","year":"2011","unstructured":"Pan Q-K, Suganthan PN, Liang JJ, Tasgetiren MF (2011) A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem. Expert Syst Appl 38:3252\u20133259","journal-title":"Expert Syst Appl"},{"key":"3898_CR76","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.cie.2016.07.008","volume":"99","author":"H Maghsoudlou","year":"2016","unstructured":"Maghsoudlou H, Kahag MR, Niaki STA, Pourvaziri H (2016) Bi-objective optimization of a three-echelon multi-server supply-chain problem in congested systems: modeling and solution. Comput Ind Eng 99:41\u201362","journal-title":"Comput Ind Eng"},{"key":"3898_CR77","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1007\/s12205-013-1467-6","volume":"19","author":"AM Adrian","year":"2015","unstructured":"Adrian AM, Utamima A, Wang K-J (2015) A comparative study of GA, PSO and ACO for solving construction site layout optimization. KSCE J Civ Eng 19:520\u2013527","journal-title":"KSCE J Civ Eng"},{"key":"3898_CR78","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.asoc.2017.05.010","volume":"58","author":"A Hassanzadeh","year":"2017","unstructured":"Hassanzadeh A, Rasti-Barzoki M (2017) Minimizing total resource consumption and total tardiness penalty in a resource allocation supply chain scheduling and vehicle routing problem. Applied Soft Comput 58:307\u2013323","journal-title":"Applied Soft Comput"},{"key":"3898_CR79","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/j.asoc.2012.07.024","volume":"13","author":"S Akp\u0131Nar","year":"2013","unstructured":"Akp\u0131Nar S, Bayhan GM, Baykasoglu A (2013) Hybridizing ant colony optimization via genetic algorithm for mixed-model assembly line balancing problem with sequence dependent setup times between tasks. Appl Soft Comput 13:574\u2013589","journal-title":"Appl Soft Comput"},{"key":"3898_CR80","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TEVC.2003.817234","volume":"7","author":"MT Jensen","year":"2003","unstructured":"Jensen MT (2003) Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans Evol Comput 7:503\u2013515","journal-title":"IEEE Trans Evol Comput"},{"key":"3898_CR81","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1162\/evco.2008.16.3.355","volume":"16","author":"H Fang","year":"2008","unstructured":"Fang H, Wang Q, Tu Y-C, Horstemeyer MF (2008) An efficient non-dominated sorting method for evolutionary algorithms. Evol Comput 16:355\u2013384","journal-title":"Evol Comput"},{"key":"3898_CR82","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.asoc.2007.03.010","volume":"8","author":"M Buragohain","year":"2008","unstructured":"Buragohain M, Mahanta C (2008) A novel approach for ANFIS modelling based on full factorial design. Appl Soft Comput 8:609\u2013625","journal-title":"Appl Soft Comput"},{"key":"3898_CR83","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s00521-017-3251-x","volume":"29","author":"S Hinojosa","year":"2018","unstructured":"Hinojosa S, Oliva D, Cuevas E, Pajares G, Avalos O, G\u00e1lvez J (2018) Improving multi-criterion optimization with chaos: a novel Multi-Objective Chaotic Crow Search Algorithm. Neural Comput Appl 29:319\u2013335","journal-title":"Neural Comput Appl"},{"key":"3898_CR84","doi-asserted-by":"crossref","first-page":"798","DOI":"10.1016\/j.jenvman.2013.06.029","volume":"128","author":"M Taheri","year":"2013","unstructured":"Taheri M, Moghaddam MA, Arami M (2013) Techno-economical optimization of Reactive Blue 19 removal by combined electrocoagulation\/coagulation process through MOPSO using RSM and ANFIS models. J Environ Manage 128:798\u2013806","journal-title":"J Environ Manage"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3898-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3898-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3898-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T19:35:46Z","timestamp":1574883346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3898-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,28]]},"references-count":84,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["3898"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3898-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,28]]},"assertion":[{"value":"19 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"Hamid Zarei and Morteza Rasti-Barzoki certify that they have no affiliations with or involvement in any organization or entity with any financial interest (such as honoraria, educational grants, participation in speakers\u2019 bureaus, membership, employment, consultancies, stock ownership, or other equity interest, and expert testimony or patent-licensing arrangements), or non-financial interest (such as personal or professional relationships, affiliations, knowledge or beliefs) in the subject matter or materials discussed in this manuscript.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}