{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T06:57:32Z","timestamp":1782543452759,"version":"3.54.5"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T00:00:00Z","timestamp":1575244800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T00:00:00Z","timestamp":1575244800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61773192"],"award-info":[{"award-number":["61773192"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10586-019-03022-z","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T12:32:18Z","timestamp":1575289938000},"page":"2483-2499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":103,"title":["A hybrid multi-objective artificial bee colony algorithm for flexible task scheduling problems in cloud computing system"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3617-6708","authenticated-orcid":false,"given":"Jun-qing","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yun-qi","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,12,2]]},"reference":[{"key":"3022_CR1","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1109\/TASE.2017.2693688","volume":"15","author":"P Zhang","year":"2017","unstructured":"Zhang, P., Zhou, M.: Dynamic cloud task scheduling based on a two-stage strategy. IEEE Trans. Autom. Sci. Eng. 15, 772\u2013783 (2017)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1","key":"3022_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TASE.2016.2526781","volume":"14","author":"H Yuan","year":"2017","unstructured":"Yuan, H., Bi, J., Tan, W., Li, B.H.: Temporal task scheduling with constrained service delay for profit maximization in hybrid clouds. IEEE Trans. Autom. Sci. Eng. 14(1), 337\u2013348 (2017)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"3022_CR3","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2017.2693187","author":"Y Xiong","year":"2017","unstructured":"Xiong, Y., Huang, S., Wu, M., She, J., Jiang, K.: A Johnson\u2019s-rule-based genetic algorithm for two-stage-task scheduling problem in data-centers of cloud computing. IEEE Trans. Cloud Comput. (2017). https:\/\/doi.org\/10.1109\/TCC.2017.2693187","journal-title":"IEEE Trans. Cloud Comput."},{"key":"3022_CR4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.ins.2015.07.040","volume":"326","author":"X Li","year":"2016","unstructured":"Li, X., Jiang, T., Ruiz, R.: Heuristics for periodical batch job scheduling in a MapReduce computing framework. Inf. Sci. 326, 119\u2013133 (2016)","journal-title":"Inf. Sci."},{"key":"3022_CR5","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1007\/s10489-015-0676-8","volume":"43","author":"JL Wang","year":"2015","unstructured":"Wang, J.L., Gong, B., Liu, H., Li, S.H.: Multidisciplinary approaches to artificial swarm intelligence for heterogeneous computing and cloud scheduling. Appl. Intell. 43, 662\u2013675 (2015)","journal-title":"Appl. Intell."},{"key":"3022_CR6","doi-asserted-by":"publisher","first-page":"105492","DOI":"10.1016\/j.asoc.2019.105492","volume":"81","author":"QK Pan","year":"2019","unstructured":"Pan, Q.K., Gao, L., Li, X.Y., Framinan, M.: Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem. Appl. Soft Comput. 81, 105492 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2019.105492","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"3022_CR7","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1109\/TASE.2015.2425404","volume":"13","author":"JQ Li","year":"2016","unstructured":"Li, J.Q., Pan, Q.K., Mao, K.: A hybrid fruit fly optimization algorithm for the realistic hybrid flowshop rescheduling problem in steelmaking systems. IEEE Trans. Autom. Sci. Eng. 13(2), 932\u2013949 (2016)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"3","key":"3022_CR8","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Glob. Optim. 39(3), 459\u2013471 (2007)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"3022_CR9","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1109\/TCYB.2015.2444383","volume":"46","author":"JQ Li","year":"2016","unstructured":"Li, J.Q., Pan, Q.K., Duan, P.Y.: An improved artificial bee colony algorithm for solving hybrid flexible flowshop with dynamic operation skipping. IEEE Trans. Cybern. 46(6), 1311\u20131324 (2016)","journal-title":"IEEE Trans. Cybern."},{"key":"3022_CR10","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2019.1571687","author":"JQ Li","year":"2019","unstructured":"Li, J.Q., Bai, S.C., Duan, P.Y., Sang, H.Y., Han, Y.Y., Zheng, Z.X.: An improved artificial bee colony algorithm for addressing distributed flow shop with distance coefficient in a prefabricated system. Int. J. Prod. Res. (2019). https:\/\/doi.org\/10.1080\/00207543.2019.1571687","journal-title":"Int. J. Prod. Res."},{"issue":"1","key":"3022_CR11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/oca.2334","volume":"39","author":"PY Duan","year":"2018","unstructured":"Duan, P.Y., Li, J.Q., Wang, Y., Sang, H., Jia, B.: Solving chiller loading optimization problems using an improved teaching-learning-based optimization algorithm. Optim. Control Appl. Methods. 39(1), 65\u201377 (2018)","journal-title":"Optim. Control Appl. Methods."},{"issue":"1","key":"3022_CR12","first-page":"279","volume":"37","author":"JQ Li","year":"2015","unstructured":"Li, J.Q., Pan, Q.K., Mao, K.: A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems. Eng. Appl. Artif. Intell. 37(1), 279\u2013292 (2015)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"3022_CR13","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.enbuild.2017.12.020","volume":"161","author":"Z Zheng","year":"2018","unstructured":"Zheng, Z., Li, J.Q.: Optimal chiller loading by improved invasive weed optimization algorithm for reducing energy consumption. Energy Build. 161, 80\u201388 (2018)","journal-title":"Energy Build."},{"issue":"6","key":"3022_CR14","doi-asserted-by":"crossref","first-page":"1337","DOI":"10.1007\/s10845-015-1182-x","volume":"29","author":"HY Sang","year":"2018","unstructured":"Sang, H.Y., Pan, Q.K., Duan, P.Y., Li, J.Q.: An effective discrete invasive weed optimization algorithm for lot-streaming flowshop scheduling problems. J. Intell. Manuf. 29(6), 1337\u20131349 (2018)","journal-title":"J. Intell. Manuf."},{"key":"3022_CR15","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","volume":"83","author":"R Ruiz","year":"2019","unstructured":"Ruiz, R., Pan, Q.K., Naderi, B.: Iterated Greedy methods for the distributed permutation flowshop scheduling problem. Omega 83, 213\u2013222 (2019)","journal-title":"Omega"},{"issue":"18","key":"3022_CR16","first-page":"9353","volume":"218","author":"JQ Li","year":"2012","unstructured":"Li, J.Q., Pan, Q.K., Xie, S.X.: An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems. Appl. Math. Comput. 218(18), 9353\u20139371 (2012)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"3022_CR17","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.: A fast and elitist multiobjective genetic algorithm. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3022_CR18","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1007\/s00170-010-3140-2","volume":"55","author":"JQ Li","year":"2011","unstructured":"Li, J.Q., Pan, Q.K., Gao, K.Z.: Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int. J. Adv. Manuf. Technol. 55, 1159\u20131169 (2011)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"3","key":"3022_CR19","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1016\/j.apm.2013.07.038","volume":"38","author":"JQ Li","year":"2014","unstructured":"Li, J.Q., Pan, Q.K., Tasgetiren, M.F.: A discrete artificial bee colony algorithm for the multi-objective flexible job-shop scheduling problem with maintenance activities. Appl. Math. Model. 38(3), 1111\u20131132 (2014)","journal-title":"Appl. Math. Model."},{"key":"3022_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100600","author":"JQ Li","year":"2019","unstructured":"Li, J.Q., Tao, X.R., Jia, B.X., Han Y.Y., Liu, C., Duan, P., Zheng, Z.X., Sang, H.Y.: Efficient multi-objective algorithm for the lot-streaming hybrid flowshop with variable sub-lots. Swarm. Evol. Comput. (2019).  https:\/\/doi.org\/10.1016\/j.swevo.2019.100600.","journal-title":"Swarm. Evol. Comput."},{"key":"3022_CR21","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/j.energy.2018.01.159","volume":"148","author":"K Yu","year":"2018","unstructured":"Yu, K., While, L., Reynolds, M., Wang, X., Liang, J.J., Zhao, L., Wang, Z.: Multiobjective optimization of ethylene cracking furnace system using self-adaptive multiobjective teaching-learning-based optimization. Energy 148, 469\u2013481 (2018)","journal-title":"Energy"},{"issue":"2","key":"3022_CR22","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TEM.2016.2516986","volume":"63","author":"S Li","year":"2016","unstructured":"Li, S., Wang, N., Jia, T., He, Z., Liang, H.: Multiobjective optimization for multiperiod reverse logistics network design. IEEE Trans. Eng. Manag. 63(2), 223\u2013236 (2016)","journal-title":"IEEE Trans. Eng. Manag."},{"issue":"4","key":"3022_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIE.2015.2510977","volume":"63","author":"J Yi","year":"2015","unstructured":"Yi, J., Huang, D., Fu, S., He, H., Li, T.: Multi-objective bacterial foraging optimization algorithm based on parallel cell entropy for aluminum electrolysis production process. IEEE Trans. Ind. Electron. 63(4), 1 (2015)","journal-title":"IEEE Trans. Ind. Electron."},{"issue":"3","key":"3022_CR24","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1007\/s10586-015-0454-8","volume":"18","author":"MC Nita","year":"2015","unstructured":"Nita, M.C., Pop, F., Voicu, C., Dobre, C., Xhafa, F.: MOMTH: multi-objective scheduling algorithm of many tasks in Hadoop. Clust. Comput. 18(3), 1011\u20131024 (2015)","journal-title":"Clust. Comput."},{"issue":"6","key":"3022_CR25","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"3022_CR26","first-page":"1","volume":"20","author":"Y Yuan","year":"2015","unstructured":"Yuan, Y., Xu, H., Wang, B., et al.: Balancing convergence and diversity in decomposition-based many-objective optimizers. IEEE Trans. Evol. Comput. 20, 1 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"3022_CR27","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1109\/TEVC.2015.2457616","volume":"20","author":"L Wang","year":"2016","unstructured":"Wang, L., Zhang, Q., Zhou, A., Gong, M., Jiao, L.: Constrained subproblems in a decomposition-based multiobjective evolutionary algorithm. IEEE Trans. Evol. Comput. 20(3), 475\u2013480 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"3022_CR28","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1109\/TEVC.2016.2521175","volume":"20","author":"R Wang","year":"2016","unstructured":"Wang, R., Zhang, Q., Zhang, T.: Decomposition-based algorithms using pareto adaptive scalarizing methods. IEEE Trans. Evol. Comput. 20(6), 821\u2013837 (2016)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"3022_CR29","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.cie.2010.07.014","volume":"59","author":"JQ Li","year":"2010","unstructured":"Li, J.Q., Pan, Q.K., Liang, Y.C.: An effective hybrid tabu search algorithm for multi-objective flexible job shop scheduling problems. Comput. Ind. Eng. 59(4), 647\u2013662 (2010)","journal-title":"Comput. Ind. Eng."},{"key":"3022_CR30","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/TCYB.2017.2771213","volume":"49","author":"YY Han","year":"2018","unstructured":"Han, Y.Y., Gong, D.W., Jin, Y.C., Pan, Q.K.: Evolutionary multi-objective blocking lot-streaming flow shop scheduling with machine breakdowns. IEEE Trans. Cybern. 49, 184\u2013197 (2018)","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"3022_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2009.09.024","volume":"205","author":"R Ruiz","year":"2010","unstructured":"Ruiz, R., V\u00e1zquez-Rodr\u00edguez, J.A.: The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1), 1\u201318 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"3022_CR32","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.asoc.2016.12.021","volume":"52","author":"B Zhang","year":"2017","unstructured":"Zhang, B., Pan, Q.K., Gao, L., Zhang, X.L., Sang, H.Y., Li, J.Q.: An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Appl. Soft. Comput. 52, 14\u201327 (2017)","journal-title":"Appl. Soft. Comput."},{"key":"3022_CR33","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2943606","author":"JQ Li","year":"2019","unstructured":"Li, J.Q., Song, M.X., Wang, L., Duan, P.Y., Han, Y.Y., Sang, H.Y., Pan, Q.K.: Hybrid artificial bee colony algorithm for a parallel batching distributed flow shop problem with deteriorating jobs. IEEE Trans. Cybern. (2019). https:\/\/doi.org\/10.1109\/TCYB.2019.2943606","journal-title":"IEEE Trans. Cybern."},{"issue":"8","key":"3022_CR34","doi-asserted-by":"crossref","first-page":"1915","DOI":"10.1007\/s10845-015-1078-9","volume":"28","author":"C Chamnanlor","year":"2017","unstructured":"Chamnanlor, C., Sethanan, K., Gen, M., Chien, C.F.: Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. J. Intell. Manuf. 28(8), 1915\u20131931 (2017)","journal-title":"J. Intell. Manuf."},{"key":"3022_CR35","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.asoc.2017.07.058","volume":"61","author":"D Lei","year":"2017","unstructured":"Lei, D., Zheng, Y.: Hybrid flow shop scheduling with assembly operations and key objectives: a novel neighborhood search. Appl. Soft Comput. 61, 122\u2013128 (2017)","journal-title":"Appl. Soft Comput."},{"key":"3022_CR36","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.apm.2019.04.006","volume":"73","author":"QK Pan","year":"2019","unstructured":"Pan, Q.K., Gao, L., Wang, L.: A multi-objective hot-rolling scheduling problem in the compact strip production. Appl. Math. Model. 73, 327\u2013334 (2019)","journal-title":"Appl. Math. Model."},{"issue":"20","key":"3022_CR37","doi-asserted-by":"crossref","first-page":"6001","DOI":"10.1007\/s00500-017-2539-1","volume":"21","author":"JQ Li","year":"2017","unstructured":"Li, J.Q., Wang, J.D., Pan, Q.K., Duan, P.Y.: A hybrid artificial bee colony for optimizing a reverse logistics network system. Soft Comput. 21(20), 6001\u20136018 (2017)","journal-title":"Soft Comput."},{"issue":"6","key":"3022_CR38","doi-asserted-by":"crossref","first-page":"1755","DOI":"10.1016\/j.asoc.2012.01.011","volume":"12","author":"CJ Liao","year":"2012","unstructured":"Liao, C.J., Tjandradjaja, E., Chung, T.P.: An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem. Appl. Soft Comput. 12(6), 1755\u20131764 (2012)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"3022_CR39","doi-asserted-by":"crossref","first-page":"437","DOI":"10.3724\/SP.J.1004.2012.00437","volume":"38","author":"SY Wang","year":"2012","unstructured":"Wang, S.Y., Wang, L., Xu, Y., Zhou, G.: An estimation of distribution algorithm for solving hybrid flow-shop scheduling problem. Acta Autom. Sin. 38(3), 437\u2013443 (2012)","journal-title":"Acta Autom. Sin."},{"issue":"6","key":"3022_CR40","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1016\/j.future.2004.03.014","volume":"20","author":"O Engin","year":"2004","unstructured":"Engin, O., Doyen, A.: A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Gen. Comput. Syst. 20(6), 1083\u20131095 (2004)","journal-title":"Future Gen. Comput. Syst."},{"issue":"5\u20136","key":"3022_CR41","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00170-007-1048-2","volume":"35","author":"K Alaykyran","year":"2007","unstructured":"Alaykyran, K., Engin, O., Doyen, A.: Using ant colony optimization to solve hybrid flow shop scheduling problems. Int. J. Adv. Manuf. Technol. 35(5\u20136), 541\u2013550 (2007)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"6","key":"3022_CR42","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0305-0483(01)00040-8","volume":"29","author":"E Neron","year":"2001","unstructured":"Neron, E., Baptiste, P., Gupta, J.N.D.: Solving hybrid flow shop problem using energetic reasoning and global operations. Omega Int. J. Manag. Sci. 29(6), 501\u2013511 (2001)","journal-title":"Omega Int. J. Manag. Sci."},{"issue":"12","key":"3022_CR43","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2010","unstructured":"Pan, Q.K., Tasgetiren, M.F., Suganthan, P.N., Chua, T.J.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181(12), 2455\u20132468 (2010)","journal-title":"Inf. Sci."},{"issue":"6","key":"3022_CR44","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1016\/S1004-9541(12)60588-6","volume":"20","author":"GL Deng","year":"2012","unstructured":"Deng, G.L., Xu, Z.H., Gu, X.S.: A discrete artificial bee colony algorithm for minimizing the total flow time in the blocking flow shop scheduling. Chin. J. Chem. Eng. 20(6), 1067\u20131073 (2012)","journal-title":"Chin. J. Chem. Eng."},{"issue":"1\u20134","key":"3022_CR45","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s00170-012-4493-5","volume":"67","author":"YY Han","year":"2013","unstructured":"Han, Y.Y., Liang, J.J., Pan, Q.K., Li, J.Q., Sang, H.Y., Cao, N.N.: Effective hybrid discrete artificial bee colony algorithms for the total flowtime minimization in the blocking flowshop problem. Int. J. Adv. Manuf. Technol. 67(1\u20134), 397\u2013414 (2013)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"1","key":"3022_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro:2000103","volume":"34","author":"J Carlier","year":"2000","unstructured":"Carlier, J., Neron, E.: An exact method for solving the multi-processor flowshop. Rairo-Oper. Res. 34(1), 1\u201325 (2000)","journal-title":"Rairo-Oper. Res."},{"key":"3022_CR47","unstructured":"Liu F., Zhang X.P., Zou F.X., Zeng L.L.: Immune clonal selection algorithm for hybrid flow-shop scheduling problem. In: Proceedings of the Chinese Control and Decision Conference, Guilin, China, pp. 2605\u20132609. IEEE (2009)"},{"key":"3022_CR48","doi-asserted-by":"crossref","unstructured":"Xu Y., Wang L., Zhou G., Wang S.Y.: An effective shuffled frog leaping algorithm for solving hybrid flow-shop scheduling problem. In: Proceedings of the International Conference on Intelligent Computing, Zhengzhou, China, pp. 560\u2013567. Springer (2011)","DOI":"10.1007\/978-3-642-24728-6_76"},{"key":"3022_CR49","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.11.018","author":"CD Li","year":"2018","unstructured":"Li, C.D., Yi, J., Wang, H., Zhang, G., Li, J.Q.: Interval data driven construction of shadowed sets with application to linguistic word modelling. Inf. Sci. (2018). https:\/\/doi.org\/10.1016\/j.ins.2018.11.018","journal-title":"Inf. Sci."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-019-03022-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10586-019-03022-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-019-03022-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,30]],"date-time":"2020-11-30T19:54:55Z","timestamp":1606766095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10586-019-03022-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,2]]},"references-count":49,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["3022"],"URL":"https:\/\/doi.org\/10.1007\/s10586-019-03022-z","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,2]]},"assertion":[{"value":"4 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 November 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}