{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T17:15:33Z","timestamp":1779902133649,"version":"3.53.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","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":[[2020,5]]},"DOI":"10.1007\/s00521-018-3950-y","type":"journal-article","created":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T03:41:02Z","timestamp":1546314062000},"page":"5093-5104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Multi-objective league championship algorithm for real-time task scheduling"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7418-7301","authenticated-orcid":false,"given":"Saroja","family":"Subbaraj","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Revathi","family":"Thiagarajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Madavan","family":"Rengaraj","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,1]]},"reference":[{"key":"3950_CR1","doi-asserted-by":"crossref","unstructured":"Kumar R, et al (2006) Core architecture optimization for heterogeneous chip multiprocessors. PACT\u201906, September 2006","DOI":"10.1145\/1152154.1152162"},{"key":"3950_CR2","volume-title":"Computers and intractability: a guide to the theory of NP-completeness (Series of books in the mathematical sciences)","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness (Series of books in the mathematical sciences), 1st edn. Freeman, San Francisco","edition":"1"},{"key":"3950_CR3","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.jpdc.2004.11.006","volume":"65","author":"S Bansal","year":"2005","unstructured":"Bansal S et al (2005) Dealing with heterogeneity through limited duplication for scheduling precedence constrained task graphs. J Parallel Distrib Comput 65:479\u2013491","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"3950_CR4","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu H et al (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260\u2013274","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3950_CR5","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/j.jpdc.2007.05.015","volume":"68","author":"MT Daoud","year":"2008","unstructured":"Daoud MT, Kharma N (2008) A high performance algorithm for static task scheduling in heterogeneous distributed computing systems. J Parallel Distrib Comput 68:399\u2013409","journal-title":"J Parallel Distrib Comput"},{"issue":"5","key":"3950_CR6","doi-asserted-by":"crossref","first-page":"1399","DOI":"10.1142\/S0219622018500311","volume":"17","author":"S Saroja","year":"2018","unstructured":"Saroja S et al (2018) Multi-criteria decision making for heterogeneous multiprocessor scheduling. Int J Inf Technol Decis Mak 17(5):1399\u20131427","journal-title":"Int J Inf Technol Decis Mak"},{"issue":"5","key":"3950_CR7","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1109\/TPDS.2014.2322354","volume":"26","author":"J Singh","year":"2015","unstructured":"Singh J et al (2015) Contention aware energy efficient scheduling on heterogeneous multiprocessors. IEEE Trans Parallel Distrib Syst 26(5):1251\u20131264","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3950_CR8","doi-asserted-by":"crossref","unstructured":"Liu W, et al (2012) An energy efficient clustering-based scheduling algorithm for parallel tasks on homogeneous DVS-enabled clusters. In: Proceedings of IEEE 16th international conference on computer supported cooperative work in design, pp 575\u2013582","DOI":"10.1109\/CSCWD.2012.6221876"},{"key":"3950_CR9","unstructured":"Boeres C, Rebello VEF (2002) Cluster-based static scheduling: theory and practice. In: Proceedings of 14th symposium on computer architecture and high performance computing (SBAC-PAD\u201902)"},{"key":"3950_CR10","doi-asserted-by":"crossref","unstructured":"Palmer A, Sinnen O (2008) Scheduling algorithm based on force directed clustering. In: Proceedings of ninth international conference on parallel and distributed computing, applications and technologies, pp 311\u2013318","DOI":"10.1109\/PDCAT.2008.89"},{"issue":"2","key":"3950_CR11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1109\/TPDS.2004.1264795","volume":"15","author":"R Bajaj","year":"2004","unstructured":"Bajaj R, Agrawal DP (2004) Improving scheduling of tasks in a heterogeneous environment. IEEE Trans Parallel Distrib Syst 15(2):107\u2013118","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3950_CR12","doi-asserted-by":"crossref","unstructured":"Ranaweera S, Agrawal DP (2000) A task duplication based scheduling algorithm for heterogeneous systems. In: Proceedings of 14th internatioanl parallel distribution process symposium, pp 445\u2013450","DOI":"10.1109\/IPDPS.2000.846020"},{"key":"3950_CR13","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"YK Kwok","year":"1999","unstructured":"Kwok YK, Ahmad I (1999) Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput Surv 31:406\u2013471","journal-title":"ACM Comput Surv"},{"key":"3950_CR14","first-page":"155","volume":"II","author":"Y Kwok","year":"1994","unstructured":"Kwok Y, Ahmad I (1994) A static scheduling algorithm using dynamic critical path for assigning parallel algorithms onto multiprocessors. Proc Int Conf Parallel Process II:155\u2013159","journal-title":"Proc Int Conf Parallel Process"},{"key":"3950_CR15","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/978-3-540-69501-1_4","volume":"5022","author":"J Yang","year":"2008","unstructured":"Yang J et al (2008) A static multiprocessor scheduling algorithm for arbitrary directed task graphs in uncertain environments. Lect Notes Comput Sci 5022:18\u201329","journal-title":"Lect Notes Comput Sci"},{"key":"3950_CR16","doi-asserted-by":"crossref","unstructured":"Topcuoglu H, et al (1999) Task scheduling algorithms for heterogeneous processors. In: Proceedings of eighth heterogeneous computing workshop 1999 (HCW \u201899) pp 3\u201314","DOI":"10.1109\/HCW.1999.765092"},{"key":"3950_CR17","first-page":"112","volume":"61","author":"Y Qiao","year":"2001","unstructured":"Qiao Y et al (2001) A new dynamic scheduling algorithm for real-time multiprocessor systems. Int Fed Inf Process 61:112\u2013115","journal-title":"Int Fed Inf Process"},{"issue":"3","key":"3950_CR18","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1109\/71.674322","volume":"9","author":"G Manimaran","year":"1998","unstructured":"Manimaran G, Murthy CSR (1998) An efficient dynamic scheduling algorithm for multiprocessor real-time systems. IEEE Trans Parallel Distrib Syst 9(3):312\u2013319","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3950_CR19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.tcs.2007.02.056","volume":"387","author":"M Gairing","year":"2007","unstructured":"Gairing M et al (2007) A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. Theor Comput Sci 387:87\u201399","journal-title":"Theor Comput Sci"},{"key":"3950_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/2480347.2480348","volume":"13","author":"BD Young","year":"2013","unstructured":"Young BD et al (2013) Heterogeneous energy and makespan constrained DAG scheduling. EEHPDC\u2019 13:3\u201311","journal-title":"EEHPDC\u2019"},{"issue":"3","key":"3950_CR21","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s11265-014-0958-0","volume":"81","author":"J Yi","year":"2015","unstructured":"Yi J et al (2015) Reliability\u2014guaranteed task assignment and scheduling for heterogeneous multiprocessors considering timing constraint. J Signal Process Syst 81(3):359\u2013375","journal-title":"J Signal Process Syst"},{"issue":"3","key":"3950_CR22","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1142\/S0129626499000396","volume":"9","author":"V Vaidehi","year":"1999","unstructured":"Vaidehi V, Krishnan CN, Swaminathan P (1999) An aided genetic algorithm for multiprocessor scheduling. Parallel Process Lett 9(3):423\u2013436","journal-title":"Parallel Process Lett"},{"key":"3950_CR23","doi-asserted-by":"crossref","first-page":"1518","DOI":"10.1016\/j.jpdc.2011.05.005","volume":"71","author":"MI Daoud","year":"2011","unstructured":"Daoud MI, Kharma N (2011) A hybrid heuristic\u2014genetic algorithm for task scheduling in heterogeneous processor networks. J Parallel Distrib Comput 71:1518\u20131531","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"3950_CR24","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1109\/71.265940","volume":"5","author":"ESH Hou","year":"1994","unstructured":"Hou ESH, Ansari N, Ren H (1994) A genetic algorithm for multiprocessor scheduling. IEEE Trans Parallel Distrib Syst 5(2):113\u2013120","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"3950_CR25","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.parco.2010.10.003","volume":"37","author":"C Boeres","year":"2011","unstructured":"Boeres C, Sardina IM, Drummond LMA (2011) An efficient weighted bi-objective scheduling algorithm for heterogeneous systems. J Parallel Comput 37:349\u2013364","journal-title":"J Parallel Comput"},{"key":"3950_CR26","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1006\/jpdc.2002.1851","volume":"62","author":"E Alba","year":"2002","unstructured":"Alba E, Nebro AJ, Troya JM (2002) Heterogeneous computing and parallel genetic algorithms. J Parallel Distrib Comput 62:1362\u20131385","journal-title":"J Parallel Distrib Comput"},{"key":"3950_CR27","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/S0167-8191(05)80052-3","volume":"17","author":"H Miihlenbein","year":"1991","unstructured":"Miihlenbein H, Schomisch M, Born J (1991) The parallel genetic algorithm as function optimizer. Parallel Comput 17:619\u2013632","journal-title":"Parallel Comput"},{"key":"3950_CR28","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.jpdc.2006.08.002","volume":"67","author":"Hongmei Hea","year":"2007","unstructured":"Hea Hongmei, S\u00fdkoraa Ondrej, Salagean Ana, M\u00e4kinen E (2007) Parallelisation of genetic algorithms for the 2-page crossing number problem. J Parallel Distrib Comput 67:229\u2013241","journal-title":"J Parallel Distrib Comput"},{"key":"3950_CR29","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0888-613X(98)10001-4","volume":"19","author":"Klaudia Dussa-Zieger","year":"1998","unstructured":"Dussa-Zieger Klaudia, Schwehm Markus (1998) Scheduling of parallel programs on configurable multiprocessors by genetic algorithms. Int J Approx Reason 19:23\u201338","journal-title":"Int J Approx Reason"},{"key":"3950_CR30","doi-asserted-by":"publisher","unstructured":"Zhang W, et al (2014) Energy-aware real-time task scheduling for heterogeneous multiprocessors with particle swarm optimization algorithm. Math Probn Eng. \n                  https:\/\/doi.org\/10.1155\/2014\/287475","DOI":"10.1155\/2014\/287475"},{"issue":"2","key":"3950_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/IJGHPC.2015040101","volume":"7","author":"DP Vidyarthi","year":"2015","unstructured":"Vidyarthi DP, Singh SK (2015) Independent tasks scheduling using parallel PSO in multiprocessor systems. Int J Grid High Perform Comput 7(2):1\u201317","journal-title":"Int J Grid High Perform Comput"},{"issue":"5","key":"3950_CR32","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1080\/18756891.2016.1237181","volume":"9","author":"HR Boveiri","year":"2016","unstructured":"Boveiri HR (2016) A novel ACO-based static task scheduling approach for multiprocessor environments. Int J Comput Intell Syst 9(5):800\u2013811. \n                  https:\/\/doi.org\/10.1080\/18756891.2016.1237181","journal-title":"Int J Comput Intell Syst"},{"issue":"4","key":"3950_CR33","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1631\/FITEE.1500394","volume":"18","author":"HR Boveiri","year":"2017","unstructured":"Boveiri HR (2017) An incremental ant colony optimization based approach to task assignment to processors for multiprocessor scheduling. Front Inf Technol Electron Eng 18(4):498\u2013510","journal-title":"Front Inf Technol Electron Eng"},{"issue":"10","key":"3950_CR34","first-page":"44","volume":"5","author":"S Kaur","year":"2017","unstructured":"Kaur S et al (2017) Parallel job scheduling using grey wolf optimization algorithm for heterogeneous multi-cluster environment. Int J Comput Sci Eng 5(10):44\u201353","journal-title":"Int J Comput Sci Eng"},{"issue":"2","key":"3950_CR35","first-page":"132","volume":"11","author":"R Eswari","year":"2015","unstructured":"Eswari R et al (2015) Effective task scheduling for heterogeneous distributed systems using firefly algorithm. Int J Comput Sci Eng 11(2):132\u2013142","journal-title":"Int J Comput Sci Eng"},{"issue":"6","key":"3950_CR36","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1504\/IJBIC.2016.081325","volume":"8","author":"R Eswari","year":"2016","unstructured":"Eswari R et al (2016) Modified multi-objective firefly algorithm for task scheduling problem on heterogeneous systems. Int J Bio-Inspired Comput 8(6):379\u2013393","journal-title":"Int J Bio-Inspired Comput"},{"key":"3950_CR37","doi-asserted-by":"crossref","unstructured":"Kashan HA (2009) League championship algorithm: a new algorithm for numerical function optimization. In: Soft computing and pattern recognition, SOCPAR\u201909, pp 43\u201348","DOI":"10.1109\/SoCPaR.2009.21"},{"key":"3950_CR38","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.asoc.2013.12.005","volume":"16","author":"HA Kashan","year":"2014","unstructured":"Kashan HA (2014) League championship algorithm (LCA): an algorithm for global optimization inspired by sport championships. Appl Soft Comput 16:171\u2013200","journal-title":"Appl Soft Comput"},{"key":"3950_CR39","unstructured":"Sebasti\u00e1n AR, Isabel LR (2014) Scheduling to job shop configuration minimizing the makespan using champions league algorithm, Fray Ismael Leonardo Ballesteros Guerrero, OP-Decano de Divisi\u00f3n de Arquitectura e Ingenier\u00edas, Universidad Santo Tom\u00e1s Seccional Tunja"},{"key":"3950_CR40","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1016\/j.asoc.2017.08.048","volume":"61","author":"SM Abdulhamid","year":"2017","unstructured":"Abdulhamid SM, Latiff MSA (2017) A checkpointed league championship algorithm-based cloud scheduling scheme with secure fault tolerance responsiveness. Appl Soft Comput 61:670\u2013680","journal-title":"Appl Soft Comput"},{"key":"3950_CR41","first-page":"1","volume":"1","author":"K Lenin","year":"2013","unstructured":"Lenin K et al (2013) League championship algorithm (LCA) for solving optimal reactive power dispatch problem. Int J Comput Inf Technol 1:1\u201319","journal-title":"Int J Comput Inf Technol"},{"key":"3950_CR42","unstructured":"KS (2014) A league championship algorithm for travelling salesman problem. Azad University, Najaf Abad Branch, Iran (in Persian)"},{"key":"3950_CR43","doi-asserted-by":"crossref","unstructured":"Yadav S, Nanda SJ (2015) League championship algorithm for clustering. In: IEEE power, communication and information technology conference (PCITC), pp 321\u2013326","DOI":"10.1109\/PCITC.2015.7438184"},{"issue":"2","key":"3950_CR44","doi-asserted-by":"crossref","first-page":"451","DOI":"10.11591\/ijeecs.v5.i2.pp451-461","volume":"5","author":"D Saraswathi","year":"2017","unstructured":"Saraswathi D, Srinivasan E (2017) Mammogram analysis using league championship algorithm optimized ensembled FCRN classifier. Indones J Electr Eng Comput Sci 5(2):451\u2013461","journal-title":"Indones J Electr Eng Comput Sci"},{"issue":"2","key":"3950_CR45","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1061\/(ASCE)CP.1943-5487.0000617","volume":"31","author":"S Jalili","year":"2017","unstructured":"Jalili S et al (2017) League championship algorithms for optimum design of pin-jointed structures. J Comput Civ Eng 31(2):1\u201317","journal-title":"J Comput Civ Eng"},{"key":"3950_CR46","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.asoc.2018.03.051","volume":"68","author":"MR Alimoradi","year":"2018","unstructured":"Alimoradi MR, Kashan AH (2018) A league championship algorithm equipped with network structure and backward Q-learning for extracting stock trading rules. Appl Soft Comput 68:478\u2013493","journal-title":"Appl Soft Comput"},{"key":"3950_CR47","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.eswa.2017.08.004","volume":"90","author":"T Wangchamhan","year":"2017","unstructured":"Wangchamhan T et al (2017) Efficient algorithms based on the k-means and chaotic league championship algorithm for numeric, categorical, and mixed-type data clustering. Expert Syst Appl 90:146\u2013167","journal-title":"Expert Syst Appl"},{"key":"3950_CR48","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26:369\u2013395","journal-title":"Struct Multidiscip Optim"},{"key":"3950_CR49","unstructured":"\u201cTask graph generator\u201d (2012). [Online]. Available: \n                  http:\/\/taskgraphgen.sourceforge.net"},{"key":"3950_CR50","doi-asserted-by":"crossref","unstructured":"Dick RP, Rhodes DL, Wolf W (1998) TGFF: task graphs for free. In: Proceedings of 6th international workshop hardware\/software codes, pp 97\u2013101","DOI":"10.1145\/278241.278309"},{"issue":"3","key":"3950_CR51","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1109\/TC.2010.216","volume":"60","author":"Z Zong","year":"2011","unstructured":"Zong Z, Manzanares A, Ruan X, Qin X (2011) \u201cEAD and PEBD:two energy-aware duplication scheduling algorithms for parallel tasks on homogeneous clusters. IEEE Trans Comput 60(3):360\u2013374","journal-title":"IEEE Trans Comput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-018-3950-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00521-018-3950-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-3950-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T14:20:39Z","timestamp":1602166839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00521-018-3950-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":51,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["3950"],"URL":"https:\/\/doi.org\/10.1007\/s00521-018-3950-y","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]},"assertion":[{"value":"15 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}