{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T13:53:31Z","timestamp":1776866011844,"version":"3.51.2"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T00:00:00Z","timestamp":1624838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s42979-021-00609-5","type":"journal-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T07:35:52Z","timestamp":1624865752000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Multi-Objective Deadline-Constrained Task Scheduling Algorithm with Guaranteed Performance in Load Balancing on Heterogeneous Networks"],"prefix":"10.1007","volume":"2","author":[{"given":"Moumita","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. K.","family":"Setua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,28]]},"reference":[{"key":"609_CR1","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Gary","year":"1979","unstructured":"Gary MR, Johnson DS. Computers and intractability: a guide to the theory of NP-completeness. New York: W.H.Freeman and Co.; 1979."},{"issue":"384\u2013393","key":"609_CR2","first-page":"1975","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman JD. NP-Complete Scheduling Problems. J Comput Syst Sci. 1975;10(384\u2013393):1975.","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"609_CR3","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu H, Hariri S, Wu M. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst. 2002;13(3):260\u201374.","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"609_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"M Wu","year":"1990","unstructured":"Wu M, Gajski D. Hypertool\/a programming aid for message passing systems. IEEE Trans Parallel Distrib Syst. 1990;1:330\u201343.","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"5","key":"609_CR5","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/71.503776","volume":"7","author":"Y Kwok","year":"1996","unstructured":"Kwok Y, Ahmad I. Dynamic critical-path scheduling: an effective technique for allocating task graphs to multinode. IEEE Trans Parallel Distrib Syst. 1996;7(5):506\u201321.","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"609_CR6","unstructured":"Boeres C, Filho, Rebello VEF. A cluster-based strategy for scheduling task on heterogeneous nodes. Proc. 16th symp. Computer architecture and high performance computing, pp. 214\u2013221, 2004."},{"key":"609_CR7","unstructured":"Cirou B, Jeannot E. Triplet: a clustering scheduling algorithm for heterogeneous systems. Proc. Int\u2019l conf. parallel processing workshops, pp. 231\u2013236, 2001."},{"issue":"3","key":"609_CR8","first-page":"1","volume":"25","author":"H Arabnejab","year":"2014","unstructured":"Arabnejab H, Barbosa JG. List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans on Parallel Distrib Syst. 2014;25(3):1.","journal-title":"IEEE Trans on Parallel Distrib Syst"},{"issue":"4","key":"609_CR9","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/s12083-017-0561-9","volume":"11","author":"T Wang","year":"2018","unstructured":"Wang T, Wei X, Tang C, Fan J. Effcient multi-tasks scheduling algorithm in mobile cloud computing with time constraints. Peer-to-Peer Netw Appl. 2018;11(4):793\u2013807. https:\/\/doi.org\/10.1007\/s12083-017-0561-9.","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"4","key":"609_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1504\/IJWMC.2016.078201","volume":"10","author":"L Shakkeera","year":"2016","unstructured":"Shakkeera L, Tamilselvan L. QoS and load balancing aware task scheduling framework for mobile cloud computing environment. Int J Wirel Mob Comput. 2016;10(4):309\u201316. https:\/\/doi.org\/10.1504\/IJWMC.2016.078201.","journal-title":"Int J Wirel Mob Comput"},{"issue":"2","key":"609_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/TPDS.2004.1264795","volume":"15","author":"R Bajaj","year":"2004","unstructured":"Bajaj R, Agrawal D. Improving scheduling of tasks in a heterogeneous environment. IEEE Trans Parallel Distrib Syst. 2004;15(2):107\u201318.","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"609_CR12","unstructured":"Armstrong R, Hensgen D, Kidd T. The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions. 7th IEEE heterogeneous computing workshop (HCW\u201998), pp. 79\u201387, 1998."},{"key":"609_CR13","unstructured":"Freund RF, Gherrity M, Ambrosius S, Campbell M, Halderman M, Hensgen D, Keith E, Kidd T, Kussow M, Lima JD, Mirabile F, Moore L, Rust B, Siegel HJ. Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet. In: 7th IEEE heterogeneous computing workshop (HCW\u201998), pp. 184\u2013199, 1998"},{"key":"609_CR14","doi-asserted-by":"crossref","unstructured":"Zheng W, Sakellariou R. Budget-deadline constrained work_owplanning for admission control in market-oriented environments. In: Proc.GECON, Paphos, Cyprus, 2012; pp. 105_119","DOI":"10.1007\/978-3-642-28675-9_8"},{"issue":"4","key":"609_CR15","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1007\/s10723-014-9294-7","volume":"12","author":"H Arabnejad","year":"2014","unstructured":"Arabnejad H, Barbosa JG. A budget constrained scheduling algorithm for workflow applications. J Comput. 2014;12(4):665\u201379. https:\/\/doi.org\/10.1007\/s10723-014-9294-7.","journal-title":"J Comput"},{"issue":"2","key":"609_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10586-013-0325-0","volume":"17","author":"JJ Durillo","year":"2013","unstructured":"Durillo JJ, Prodan R. Multi-objective workflow scheduling in Amazon EC2. Cluster Comput. 2013;17(2):169\u201389. https:\/\/doi.org\/10.1007\/s10586-013-0325-0.","journal-title":"Cluster Comput."},{"key":"609_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/ACCESS.2018.2812929","volume":"6","author":"L Liu","year":"2018","unstructured":"Liu L, Fan Q, Buyya R. A deadline-constrained multi-objective task scheduling algorithm in mobile cloud environments. IEEE Access. 2018;6:1.","journal-title":"IEEE Access"},{"key":"609_CR18","doi-asserted-by":"crossref","unstructured":"Samadi Y, Zbakh M, Tadonki C (2018) E-HEFT: enhancement heterogeneous earliest finish time algorithm for task scheduling based on load balancing in cloud computing. HPCS 2018. (The 2018 International Conference on High Performance Computing Simulation), Jul 2018, Orl\u00e9ans, France. pp.601\u2013609. <hal-01820514>","DOI":"10.1109\/HPCS.2018.00100"},{"key":"609_CR19","doi-asserted-by":"crossref","unstructured":"Cai Z, Chen C. Demand-driven task scheduling using 2D chromosome genetic algorithm in mobile cloud. In: Proc. PIC, Shanghai, China. 2014; pp. 539-545","DOI":"10.1109\/PIC.2014.6972393"},{"key":"609_CR20","doi-asserted-by":"crossref","unstructured":"J Liu, Y Mao, J Zhang, KB Letaief (2016) Delay-optimal computation task scheduling for mobile-edge computing systems. In: Proc. ISIT, Barcelona, Spain, 2016, pp. 1451-1455","DOI":"10.1109\/ISIT.2016.7541539"},{"key":"609_CR21","doi-asserted-by":"crossref","unstructured":"Wu Z, Ni Z, Gu L, Liu X. A revised discrete particle swarm optimization for cloud workflow scheduling. Computational intelligence and security (CIS), international conference. IEEE. 2010, p. 184\u2013188","DOI":"10.1109\/CIS.2010.46"},{"key":"609_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2013\/409539","volume":"1","author":"X Wei","year":"2013","unstructured":"Wei X, Fan J, Lu Z, Ding K. Application scheduling in mobile cloud computing with load balancing. J Appl Math. 2013;1:1\u201313. https:\/\/doi.org\/10.1155\/2013\/409539.","journal-title":"J Appl Math"},{"key":"609_CR23","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3942","author":"L Liu","year":"2016","unstructured":"Liu L, Zhang M, Buyya R, Fan Q. Deadline-constrained coevolutionary genetic algorithm for scientific workflow scheduling in cloud computing. Pract Exper Concur Comput. 2016. https:\/\/doi.org\/10.1002\/cpe.3942.","journal-title":"Pract Exper Concur Comput"},{"key":"609_CR24","unstructured":"(2018). MathWorks. [Online]. Available: http:\/\/www.mathworks.com\/"},{"key":"609_CR25","doi-asserted-by":"crossref","unstructured":"Chen W, Deelman E. WorkflowSim: a toolkit for simulating scientific workflows in distributed environments. In E\u2010Science (e\u2010Science), IEEE 8th international conference on, IEEE, 2012; 1\u20138. DOI: 10.1109\/ eScience.2012.6404430","DOI":"10.1109\/eScience.2012.6404430"},{"key":"609_CR26","unstructured":"Sawant S. A genetic algorithm scheduling approach for virtual machine resources in a cloud computing environment, 2011."},{"key":"609_CR27","doi-asserted-by":"publisher","unstructured":"Pandey S, Wu L, Guru SM, Buyya R. A particle swarm optimization based heuristic for scheduling workflow applications in cloud computing environments. In Advanced information networking and applications (AINA), 24th IEEE international conference on, IEEE, 2010; 400\u2013407. DOI: https:\/\/doi.org\/10.1109\/AINA.2010.31.","DOI":"10.1109\/AINA.2010.31"},{"key":"609_CR28","doi-asserted-by":"crossref","unstructured":"Balioti V, Tzimopoulos C, Evangelides C. Multi-criteria decision making using TOPSIS method under fuzzy environment. Application in spillway selection \u201cPresented at the 3rd EWaS international conference on \u201cinsights on the water-energy-food nexus\u201d, Lefkada Island, Greece, 27\u201330; 2018","DOI":"10.3390\/proceedings2110637"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00609-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-021-00609-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-021-00609-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T17:57:04Z","timestamp":1630346224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-021-00609-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,28]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["609"],"URL":"https:\/\/doi.org\/10.1007\/s42979-021-00609-5","relation":{},"ISSN":["2662-995X","2661-8907"],"issn-type":[{"value":"2662-995X","type":"print"},{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,28]]},"assertion":[{"value":"28 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"361"}}