{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:31:56Z","timestamp":1769819516932,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T00:00:00Z","timestamp":1629849600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T00:00:00Z","timestamp":1629849600000},"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":["J Supercomput"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s11227-021-04018-6","type":"journal-article","created":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T15:02:43Z","timestamp":1629903763000},"page":"4236-4260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["A bi-objective task scheduling approach in fog computing using hybrid fireworks algorithm"],"prefix":"10.1007","volume":"78","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7231-3442","authenticated-orcid":false,"given":"Ashish Mohan","family":"Yadav","sequence":"first","affiliation":[]},{"given":"Kuldeep Narayan","family":"Tripathi","sequence":"additional","affiliation":[]},{"given":"S. C.","family":"Sharma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,25]]},"reference":[{"key":"4018_CR1","unstructured":"The Internet of Things\u2014A movement not a market | IHS Markit. https:\/\/ihsmarkit.com\/Info\/1017\/internet-of-things.html"},{"key":"4018_CR2","doi-asserted-by":"crossref","unstructured":"Yi S, Li C, Li Q (2015) A survey of fog computing: Concepts, applications and issues. In: Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). Association for Computing Machinery, New York, NY, USA, pp 37\u201342","DOI":"10.1145\/2757384.2757397"},{"key":"4018_CR3","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.future.2018.04.064","volume":"87","author":"H Gao","year":"2018","unstructured":"Gao H, Huang W, Yang X et al (2018) Toward service selection for workflow reconfiguration: an interface-based computing solution. Futur Gener Comput Syst 87:298\u2013311. https:\/\/doi.org\/10.1016\/j.future.2018.04.064","journal-title":"Futur Gener Comput Syst"},{"key":"4018_CR4","doi-asserted-by":"crossref","unstructured":"Liu CY, Zou CM, Wu P (2014) A task scheduling algorithm based on genetic algorithm and ant colony optimization in cloud computing. In: Proceedings - 13th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2014. Institute of Electrical and Electronics Engineers Inc., pp 68\u201372","DOI":"10.1109\/DCABES.2014.18"},{"key":"4018_CR5","doi-asserted-by":"publisher","first-page":"1624","DOI":"10.1109\/TPDS.2011.35","volume":"22","author":"J Xu","year":"2011","unstructured":"Xu J, Lam AYS, Li VOK (2011) Chemical reaction optimization for task scheduling in grid computing. IEEE Trans Parallel Distrib Syst 22:1624\u20131631. https:\/\/doi.org\/10.1109\/TPDS.2011.35","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4018_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/dac.3394","volume":"31","author":"N Zhang","year":"2018","unstructured":"Zhang N, Yang X, Zhang M et al (2018) A genetic algorithm-based task scheduling for cloud resource crowd-funding model. Int J Commun Syst 31:e3394. https:\/\/doi.org\/10.1002\/dac.3394","journal-title":"Int J Commun Syst"},{"key":"4018_CR7","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/j.jpdc.2006.06.006","volume":"66","author":"G Attiya","year":"2006","unstructured":"Attiya G, Hamam Y (2006) Task allocation for maximizing reliability of distributed systems: a simulated annealing approach. J Parallel Distrib Comput 66:1259\u20131266. https:\/\/doi.org\/10.1016\/j.jpdc.2006.06.006","journal-title":"J Parallel Distrib Comput"},{"key":"4018_CR8","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-662-46353-6_2","volume-title":"Fireworks Algorithm","author":"Y Tan","year":"2015","unstructured":"Tan Y, Tan Y (2015) Fireworks Algorithm (FWA). Fireworks Algorithm. Springer, Berlin Heidelberg, pp 17\u201335"},{"key":"4018_CR9","doi-asserted-by":"crossref","unstructured":"Bacanin N, Tuba M (2015) Fireworks algorithm applied to constrained portfolio optimization problem. In: 2015 IEEE Congress on Evolutionary Computation, CEC 2015 - Proceedings. Institute of Electrical and Electronics Engineers Inc., pp 1242\u20131249","DOI":"10.1109\/CEC.2015.7257031"},{"key":"4018_CR10","doi-asserted-by":"crossref","unstructured":"Zheng S, Tan Y (2013) A unified distance measure scheme for orientation coding in identification. In: 2013 IEEE 3rd International Conference on Information Science and Technology, ICIST 2013. IEEE Computer Society, pp 979\u2013985","DOI":"10.1109\/ICIST.2013.6747701"},{"key":"4018_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.advengsoft.2014.04.005","volume":"75","author":"N Pholdee","year":"2014","unstructured":"Pholdee N, Bureerat S (2014) Comparative performance of meta-heuristic algorithms for mass minimisation of trusses with dynamic constraints. Adv Eng Softw 75:1\u201313. https:\/\/doi.org\/10.1016\/j.advengsoft.2014.04.005","journal-title":"Adv Eng Softw"},{"key":"4018_CR12","doi-asserted-by":"crossref","unstructured":"Xue J, Xiao J, Zhu J (2019) Binary Fireworks Algorithm for 0\u20131 Knapsack Problem. In: Proceedings - 2019 International Conference on Artificial Intelligence and Advanced Manufacturing, AIAM 2019. Institute of Electrical and Electronics Engineers Inc., pp 218\u2013222","DOI":"10.1109\/AIAM48774.2019.00051"},{"key":"4018_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/MCI.2015.2405351","volume":"10","author":"M Guzek","year":"2015","unstructured":"Guzek M, Bouvry P, Talbi EG (2015) A survey of evolutionary computation for resource management of processing in cloud computing [review article]. IEEE Comput Intell Mag 10:53\u201367","journal-title":"IEEE Comput Intell Mag"},{"key":"4018_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/J.FUTURE.2018.04.042","volume":"87","author":"VB Souza","year":"2018","unstructured":"Souza VB, Masip-Bruin X, Mar\u00edn-Tordera E et al (2018) Towards a proper service placement in combined Fog-to-Cloud (F2C) architectures. Futur Gener Comput Syst 87:1\u201315. https:\/\/doi.org\/10.1016\/J.FUTURE.2018.04.042","journal-title":"Futur Gener Comput Syst"},{"key":"4018_CR15","doi-asserted-by":"publisher","first-page":"47980","DOI":"10.1109\/ACCESS.2018.2866491","volume":"6","author":"RK Naha","year":"2018","unstructured":"Naha RK, Garg S, Georgakopoulos D et al (2018) Fog computing: Survey of trends, architectures, requirements, and research directions. IEEE Access 6:47980\u201348009. https:\/\/doi.org\/10.1109\/ACCESS.2018.2866491","journal-title":"IEEE Access"},{"key":"4018_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1080\/17517575.2017.1304579","volume":"12","author":"S Bitam","year":"2018","unstructured":"Bitam S, Zeadally S, Mellouk A (2018) Fog computing job scheduling optimization based on bees swarm. Enterp Inf Syst 12:373\u2013397. https:\/\/doi.org\/10.1080\/17517575.2017.1304579","journal-title":"Enterp Inf Syst"},{"key":"4018_CR17","doi-asserted-by":"crossref","unstructured":"Binh HTT, Anh TT, Son DB, et al (2018) An evolutionary algorithm for solving task scheduling problem in cloud-fog computing environment. In: ACM International Conference Proceeding Series. Association for Computing Machinery, New York, New York, USA, pp 397\u2013404","DOI":"10.1145\/3287921.3287984"},{"key":"4018_CR18","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11761-017-0219-8","volume":"11","author":"O Skarlat","year":"2017","unstructured":"Skarlat O, Nardelli M, Schulte S et al (2017) Optimized IoT service placement in the fog. Serv Oriented Comput Appl 11:427\u2013443. https:\/\/doi.org\/10.1007\/s11761-017-0219-8","journal-title":"Serv Oriented Comput Appl"},{"key":"4018_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpe.6163","volume":"6163","author":"N Potu","year":"2021","unstructured":"Potu N, Jatoth C, Parvataneni P (2021) Optimizing resource scheduling based on extended particle swarm optimization in fog computing environments. Concurrency Computat Pract Exper. 6163:1\u201313. https:\/\/doi.org\/10.1002\/cpe.6163","journal-title":"Concurrency Computat Pract Exper."},{"key":"4018_CR20","doi-asserted-by":"crossref","unstructured":"Yadav V, Natesha B V., Guddeti RMR (2019) GA-PSO: Service Allocation in Fog Computing Environment Using Hybrid Bio-Inspired Algorithm. In: IEEE Region 10 Annual International Conference, Proceedings\/TENCON. IEEE, pp 1280\u20131285","DOI":"10.1109\/TENCON.2019.8929234"},{"key":"4018_CR21","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1186\/s13638-018-1259-2","volume":"2018","author":"J Li","year":"2018","unstructured":"Li J, Tian Q, Zhang G et al (2018) Task scheduling algorithm based on fireworks algorithm. EURASIP J Wirel Commun Netw 2018:256. https:\/\/doi.org\/10.1186\/s13638-018-1259-2","journal-title":"EURASIP J Wirel Commun Netw"},{"key":"4018_CR22","doi-asserted-by":"publisher","first-page":"32385","DOI":"10.1109\/ACCESS.2020.2973758","volume":"8","author":"S Wang","year":"2020","unstructured":"Wang S, Zhao T, Pang S (2020) Task Scheduling Algorithm Based on Improved Firework Algorithm in Fog Computing. IEEE Access 8:32385\u201332394. https:\/\/doi.org\/10.1109\/ACCESS.2020.2973758","journal-title":"IEEE Access"},{"key":"4018_CR23","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s40565-016-0195-6","volume":"4","author":"KS Reddy","year":"2016","unstructured":"Reddy KS, Kumar Panwar L, Kumar R, Panigrahi BK (2016) Distributed resource scheduling in smart grid with electric vehicle deployment using fireworks algorithm. J Mod Power Syst Clean Energy 4:188\u2013199. https:\/\/doi.org\/10.1007\/s40565-016-0195-6","journal-title":"J Mod Power Syst Clean Energy"},{"key":"4018_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1177\/0142331215600047","volume":"39","author":"S Ye","year":"2017","unstructured":"Ye S, Ma H, Xu S et al (2017) An effective fireworks algorithm for warehouse-scheduling problem. Trans Inst Meas Control 39:75\u201385. https:\/\/doi.org\/10.1177\/0142331215600047","journal-title":"Trans Inst Meas Control"},{"key":"4018_CR25","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1109\/JAS.2019.1911564","volume":"6","author":"Q Fan","year":"2019","unstructured":"Fan Q, Ansari N (2019) On cost aware cloudlet placement for mobile edge computing. IEEE\/CAA J Autom Sin 6:926\u2013937. https:\/\/doi.org\/10.1109\/JAS.2019.1911564","journal-title":"IEEE\/CAA J Autom Sin"},{"key":"4018_CR26","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1109\/TASE.2017.2693688","volume":"15","author":"PY Zhang","year":"2018","unstructured":"Zhang PY, Zhou MC (2018) Dynamic cloud task scheduling based on a two-stage strategy. IEEE Trans Autom Sci Eng 15:772\u2013783. https:\/\/doi.org\/10.1109\/TASE.2017.2693688","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"4018_CR27","doi-asserted-by":"publisher","first-page":"9912","DOI":"10.1109\/ACCESS.2019.2891130","volume":"7","author":"L Li","year":"2019","unstructured":"Li L, Guan Q, Jin L, Guo M (2019) Resource allocation and task offloading for heterogeneous real-time tasks with uncertain duration time in a fog queueing system. IEEE Access 7:9912\u20139925. https:\/\/doi.org\/10.1109\/ACCESS.2019.2891130","journal-title":"IEEE Access"},{"key":"4018_CR28","doi-asserted-by":"publisher","first-page":"433","DOI":"10.12694\/scpe.v20i2.1538","volume":"20","author":"SP Singh","year":"2019","unstructured":"Singh SP, Nayyar A, Kaur H, Singla A (2019) Dynamic task scheduling using balanced VM allocation policy for fog computing platforms. Scalable Comput 20:433\u2013457. https:\/\/doi.org\/10.12694\/scpe.v20i2.1538","journal-title":"Scalable Comput"},{"key":"4018_CR29","doi-asserted-by":"crossref","unstructured":"Stojmenovic I, Wen S (2014) The Fog computing paradigm: Scenarios and security issues. In: 2014 Federated Conference on Computer Science and Information Systems, FedCSIS 2014. Institute of Electrical and Electronics Engineers Inc., pp 1\u20138","DOI":"10.15439\/2014F503"},{"key":"4018_CR30","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1109\/TII.2016.2607178","volume":"13","author":"P Hu","year":"2017","unstructured":"Hu P, Ning H, Qiu T et al (2017) Fog computing based face identification and resolution scheme in internet of things. IEEE Trans Ind Informatics 13:1910\u20131920. https:\/\/doi.org\/10.1109\/TII.2016.2607178","journal-title":"IEEE Trans Ind Informatics"},{"key":"4018_CR31","unstructured":"Pham XQ, Huh EN (2016) Towards task scheduling in a cloud-fog computing system. In: 18th Asia-Pacific Network Operations and Management Symposium, APNOMS 2016: Management of Softwarized Infrastructure - Proceedings. Institute of Electrical and Electronics Engineers Inc., pp 1\u20134"},{"key":"4018_CR32","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1155\/2006\/271608","volume":"14","author":"J Yu","year":"2006","unstructured":"Yu J, Buyya R (2006) Scheduling scientific workflow applications with deadline and budget constraints using genetic algorithms. Sci Program 14:217\u2013230. https:\/\/doi.org\/10.1155\/2006\/271608","journal-title":"Sci Program"},{"key":"4018_CR33","doi-asserted-by":"publisher","first-page":"460","DOI":"10.14778\/1920841.1920902","volume":"3","author":"J Schad","year":"2010","unstructured":"Schad J, Dittrich J, Quian\u00e9-Ruiz JA (2010) Runtime measurements in the cloud: observing, analyzing, and reducing variance. Proc VLDB Endow 3:460\u2013471. https:\/\/doi.org\/10.14778\/1920841.1920902","journal-title":"Proc VLDB Endow"},{"key":"4018_CR34","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.parco.2013.03.002","volume":"39","author":"S Su","year":"2013","unstructured":"Su S, Li J, Huang Q et al (2013) Cost-efficient task scheduling for executing large programs in the cloud. Parallel Comput 39:177\u2013188. https:\/\/doi.org\/10.1016\/j.parco.2013.03.002","journal-title":"Parallel Comput"},{"key":"4018_CR35","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-981-15-1275-9_30","volume":"1086","author":"AM Yadav","year":"2020","unstructured":"Yadav AM, Sharma SC, Tripathi KN (2020) A two-step technique for effective scheduling in cloud-fog computing paradigm. Adv Intell Syst Comput 1086:367\u2013379. https:\/\/doi.org\/10.1007\/978-981-15-1275-9_30","journal-title":"Adv Intell Syst Comput"},{"key":"4018_CR36","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 MY (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13:260\u2013274. https:\/\/doi.org\/10.1109\/71.993206","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4018_CR37","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.neucom.2012.08.075","volume":"148","author":"YJ Zheng","year":"2015","unstructured":"Zheng YJ, Xu XL, Ling HF, Chen SY (2015) A hybrid fireworks optimization method with differential evolution operators. Neurocomputing 148:75\u201382. https:\/\/doi.org\/10.1016\/j.neucom.2012.08.075","journal-title":"Neurocomputing"},{"key":"4018_CR38","first-page":"355","volume-title":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","author":"Y Tan","year":"2010","unstructured":"Tan Y, Zhu Y (2010) Fireworks algorithm for optimization. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer, Berlin, Heidelberg, pp 355\u2013364"},{"key":"4018_CR39","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/6094685","author":"S Chen","year":"2018","unstructured":"Chen S, Liu Y, Wei L, Guan B (2018) PS-FW: a hybrid algorithm based on particle swarm and fireworks for global optimization. Comput Intell Neurosci. https:\/\/doi.org\/10.1155\/2018\/6094685","journal-title":"Comput Intell Neurosci"},{"key":"4018_CR40","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1016\/j.asoc.2017.10.046","volume":"62","author":"J Li","year":"2018","unstructured":"Li J, Tan Y (2018) The bare bones fireworks algorithm: a minimalist global optimizer. Appl Soft Comput J 62:454\u2013462. https:\/\/doi.org\/10.1016\/j.asoc.2017.10.046","journal-title":"Appl Soft Comput J"},{"key":"4018_CR41","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1002\/spe.2509","volume":"47","author":"H Gupta","year":"2017","unstructured":"Gupta H, Vahid Dastjerdi A, Ghosh SK, Buyya R (2017) iFogSim: a toolkit for modeling and simulation of resource management techniques in the internet of things, edge and fog computing environments. Softw Pract Exp 47:1275\u20131296. https:\/\/doi.org\/10.1002\/spe.2509","journal-title":"Softw Pract Exp"},{"key":"4018_CR42","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.future.2014.10.008","volume":"46","author":"E Deelman","year":"2015","unstructured":"Deelman E, Vahi K, Juve G et al (2015) Pegasus, a workflow management system for science automation. Futur Gener Comput Syst 46:17\u201335. https:\/\/doi.org\/10.1016\/j.future.2014.10.008","journal-title":"Futur Gener Comput Syst"},{"key":"4018_CR43","doi-asserted-by":"publisher","first-page":"159535","DOI":"10.1109\/ACCESS.2019.2950110","volume":"7","author":"K Dubey","year":"2019","unstructured":"Dubey K, Shams MY, Sharma SC et al (2019) A management system for servicing multi-organizations on community cloud model in secure cloud environment. IEEE Access 7:159535\u2013159546. https:\/\/doi.org\/10.1109\/ACCESS.2019.2950110","journal-title":"IEEE Access"},{"key":"4018_CR44","doi-asserted-by":"crossref","unstructured":"Moses J, Iyer R, Illikkal R, et al (2011) Shared resource monitoring and throughput optimization in cloud-computing datacenters. In: Proceedings\u201425th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2011. pp 1024\u20131033","DOI":"10.1109\/IPDPS.2011.98"},{"key":"4018_CR45","doi-asserted-by":"crossref","unstructured":"Tripathi KN, Yadav AM, Sharma SC (2020) DOSP: Data Dissemination with Optimized and Secured Path for Ad-hoc Vehicular Communication Networks. In: IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS). IEEE, pp 121\u2013128","DOI":"10.1109\/MASS50613.2020.00025"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04018-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-04018-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-04018-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T13:27:02Z","timestamp":1644240422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-04018-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,25]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["4018"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-04018-6","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,25]]},"assertion":[{"value":"5 August 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 August 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}