{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T15:49:09Z","timestamp":1748015349899},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319685045"},{"type":"electronic","value":"9783319685052"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68505-2_18","type":"book-chapter","created":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T01:08:03Z","timestamp":1509325683000},"page":"201-213","source":"Crossref","is-referenced-by-count":4,"title":["A Hybrid Artificial Bee Colony Algorithm to Solve Multi-objective Hybrid Flowshop in Cloud Computing Systems"],"prefix":"10.1007","author":[{"given":"Jun-qing","family":"Li","sequence":"first","affiliation":[]},{"given":"Yu-yan","family":"Han","sequence":"additional","affiliation":[]},{"given":"Cun-gang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,31]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/TPDS.2015.2401003","volume":"27","author":"Z Xia","year":"2016","unstructured":"Xia, Z., Wang, X., Sun, X., et al.: A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans. Parallel Distrib. Syst. 27(2), 340\u2013352 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"9","key":"18_CR2","doi-asserted-by":"crossref","first-page":"2546","DOI":"10.1109\/TPDS.2015.2506573","volume":"27","author":"Z Fu","year":"2016","unstructured":"Fu, Z., Ren, K., Shu, J., et al.: Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Trans. Parallel Distrib. Syst. 27(9), 2546\u20132559 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"6","key":"18_CR3","first-page":"929","volume":"15","author":"P Guo","year":"2014","unstructured":"Guo, P., Wang, J., Li, B., Lee, S.: A variable threshold-value authentication architecture for wireless mesh networks. J. Internet Technol. 15(6), 929\u2013936 (2014)","journal-title":"J. Internet Technol."},{"issue":"1","key":"18_CR4","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1587\/transcom.E98.B.190","volume":"98","author":"Z Fu","year":"2015","unstructured":"Fu, Z., Sun, X., Liu, Q., et al.: Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE Trans. Commun. 98(1), 190\u2013200 (2015)","journal-title":"IEICE Trans. Commun."},{"issue":"2","key":"18_CR5","first-page":"317","volume":"16","author":"Y Ren","year":"2015","unstructured":"Ren, Y., Shen, J., Wang, J., et al.: Mutual verifiable provable data auditing in public cloud storage. J. Internet Technol. 16(2), 317\u2013323 (2015)","journal-title":"J. Internet Technol."},{"issue":"6","key":"18_CR6","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.future.2008.12.001","volume":"25","author":"R Buyya","year":"2009","unstructured":"Buyya, R., Yeo, C.S., Venugopal, S., et al.: Cloud computing and emerging IT platforms: vision, hype, and reality for delivering computing as the 5th utility. Future Gener. Comput. Syst. 25(6), 599\u2013616 (2009)","journal-title":"Future Gener. Comput. Syst."},{"issue":"5","key":"18_CR7","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.jpdc.2012.02.002","volume":"72","author":"J Li","year":"2012","unstructured":"Li, J., Qiu, M., Ming, Z., et al.: Online optimization for scheduling preemptable tasks on IaaS cloud systems. J. Parallel Distrib. Comput. 72(5), 666\u2013677 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1","key":"18_CR8","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."},{"issue":"8","key":"18_CR9","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1016\/j.cor.2009.11.001","volume":"37","author":"I Ribas","year":"2010","unstructured":"Ribas, I., Leisten, R., Frami\u00f1an, J.M.: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput. Oper. Res. 37(8), 1439\u20131454 (2010)","journal-title":"Comput. Oper. Res."},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"JND Gupta","year":"1988","unstructured":"Gupta, J.N.D.: Two-stage, hybrid flowshop scheduling problem. J. Oper. Res. Soc. 39, 359\u2013364 (1988)","journal-title":"J. Oper. Res. Soc."},{"issue":"2","key":"18_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/S0925-5273(03)00011-2","volume":"86","author":"HT Lin","year":"2003","unstructured":"Lin, H.T., Liao, C.J.: A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int. J. Prod. Econ. 86(2), 133\u2013143 (2003)","journal-title":"Int. J. Prod. Econ."},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/0377-2217(94)90407-3","volume":"77","author":"JND Gupta","year":"1994","unstructured":"Gupta, J.N.D., Tunc, E.A.: Scheduling a two-stage hybrid flowshop with separable setup and removal times. Eur. J. Oper. Res. 77, 415\u2013428 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"4731","DOI":"10.1080\/0020754041233127044","volume":"42","author":"GC Lee","year":"2004","unstructured":"Lee, G.C., Kim, Y.D.: A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness. Int. J. Prod. Res. 42, 4731\u20134743 (2004)","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"18_CR14","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1080\/00207540802691374","volume":"48","author":"J Yang","year":"2010","unstructured":"Yang, J.: A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines. Int. J. Prod. Res. 48(5), 1531\u20131538 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"18_CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0377-2217(98)00060-5","volume":"109","author":"F Riane","year":"1998","unstructured":"Riane, F., Artiba, A., Elmaghraby, S.E.: A hybrid three-stage flowshop problem: efficient heuristics to minimize makespan. Eur. J. Oper. Res. 109(2), 321\u2013329 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR16","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1080\/00207540310001602946","volume":"42","author":"A Babayan","year":"2004","unstructured":"Babayan, A., He, D.: Solving the n-job three-stage flexible flowshop scheduling problem using an agent-based approach. Int. J. Prod. Res. 42, 777\u2013799 (2004)","journal-title":"Int. J. Prod. Res."},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1111\/j.1937-5956.2002.tb00492.x","volume":"11","author":"ZH Jin","year":"2002","unstructured":"Jin, Z.H., Ohno, K., Ito, T., Elmaghraby, S.E.: Scheduling hybrid flowshops in printed circuit board assembly lines. Prod. Oper. Manag. 11, 216\u2013230 (2002)","journal-title":"Prod. Oper. Manag."},{"issue":"2","key":"18_CR18","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1109\/70.282536","volume":"10","author":"SC Chang","year":"1994","unstructured":"Chang, S.C., Liao, D.Y.: Scheduling flexible flow shops with no setup effects. IEEE Trans. Robot. Autom. 10(2), 112\u2013122 (1994)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/S0377-2217(97)00333-0","volume":"107","author":"MC Portmann","year":"1998","unstructured":"Portmann, M.C., Vignier, A., Dardilhac, D., Dezalay, D.: Branch and bound crossed with GA to solve hybrid flowshops. Eur. J. Oper. Res. 107, 389\u2013400 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"18_CR20","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10951-005-1640-y","volume":"8","author":"C Oguz","year":"2005","unstructured":"Oguz, C., Ercan, M.: A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks. J. Sched. 8, 323\u2013351 (2005)","journal-title":"J. Sched."},{"issue":"3","key":"18_CR21","doi-asserted-by":"crossref","first-page":"3056","DOI":"10.1016\/j.asoc.2010.12.006","volume":"11","author":"O Engin","year":"2011","unstructured":"Engin, O., Ceran, G., Yilmaz, M.K.: An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems. Appl. Soft Comput. 11(3), 3056\u20133065 (2011)","journal-title":"Appl. Soft Comput."},{"key":"18_CR22","first-page":"765","volume":"15","author":"Q Niu","year":"2009","unstructured":"Niu, Q., Zhou, T., Ma, S.: A quantum-inspired immune algorithm for hybrid flow shop with makespan criterion. J. Univ. Comput. Sci. 15, 765\u2013785 (2009)","journal-title":"J. Univ. Comput. Sci."},{"issue":"16","key":"18_CR23","doi-asserted-by":"crossref","first-page":"3161","DOI":"10.1080\/00207540500536939","volume":"44","author":"KC Ying","year":"2006","unstructured":"Ying, K.C., Lin, S.W.: Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach. Int. J. Prod. Res. 44(16), 3161\u20133177 (2006)","journal-title":"Int. J. Prod. Res."},{"key":"18_CR24","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, 1755\u20131764 (2012)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"18_CR25","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ijpe.2012.05.015","volume":"141","author":"FD Chou","year":"2013","unstructured":"Chou, F.D.: Particle swarm optimization with cocktail decoding method for hybrid flow shop scheduling problems with multiprocessor tasks. Int. J. Prod. Econ. 141(1), 137\u2013145 (2013)","journal-title":"Int. J. Prod. Econ."},{"key":"18_CR26","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.ins.2014.02.152","volume":"277","author":"QK Pan","year":"2014","unstructured":"Pan, Q.K., Dong, Y.: An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation. Inf. Sci. 277, 643\u2013655 (2014)","journal-title":"Inf. Sci."},{"key":"18_CR27","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.omega.2013.12.004","volume":"45","author":"QK Pan","year":"2014","unstructured":"Pan, Q.K., Wang, L., Li, J.Q., et al.: A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega 45, 42\u201356 (2014)","journal-title":"Omega"},{"key":"18_CR28","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.asoc.2014.02.005","volume":"19","author":"MK Marichelvam","year":"2014","unstructured":"Marichelvam, M.K., Prabaharan, T., Yang, X.S.: Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan. Appl. Soft Comput. 19, 93\u2013101 (2014)","journal-title":"Appl. Soft Comput."},{"key":"18_CR29","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1016\/j.asoc.2014.03.011","volume":"21","author":"P Savsani","year":"2014","unstructured":"Savsani, P., Jhala, R.L., Savsani, V.: Effect of hybridizing Biogeography-Based Optimization (BBO) technique with Artificial Immune Algorithm (AIA) and Ant Colony Optimization (ACO). Appl. Soft Comput. 21, 542\u2013553 (2014)","journal-title":"Appl. Soft Comput."},{"key":"18_CR30","doi-asserted-by":"publisher","unstructured":"Chamnanlor, C., Sethanan, K., Gen, M., et al.: Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints. J. Intell. Manuf. (2015). doi:\n10.1007\/s10845-015-1078-9","DOI":"10.1007\/s10845-015-1078-9"},{"issue":"1","key":"18_CR31","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2009.06.031","volume":"203","author":"F Dugardin","year":"2010","unstructured":"Dugardin, F., Yalaoui, F., Amodeo, L.: New multi-objective method to solve reentrant hybrid flow shop scheduling problem. Eur. J. Oper. Res. 203(1), 22\u201331 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"8","key":"18_CR32","doi-asserted-by":"crossref","first-page":"11057","DOI":"10.1016\/j.eswa.2009.02.080","volume":"36","author":"J Behnamian","year":"2009","unstructured":"Behnamian, J., Ghomi, S.F., Zandieh, M.: A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Syst. Appl. 36(8), 11057\u201311069 (2009)","journal-title":"Expert Syst. Appl."},{"issue":"9\u201312","key":"18_CR33","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1007\/s00170-009-2475-z","volume":"49","author":"E Rashidi","year":"2010","unstructured":"Rashidi, E., Jahandar, M., Zandieh, M.: An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines. Int. J. Adv. Manuf. Technol. 49(9\u201312), 1129\u20131139 (2010)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"6","key":"18_CR34","doi-asserted-by":"crossref","first-page":"4024","DOI":"10.1016\/j.eswa.2009.09.005","volume":"37","author":"N Karimi","year":"2010","unstructured":"Karimi, N., Zandieh, M., Karamooz, H.R.: Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach. Expert Syst. Appl. 37(6), 4024\u20134032 (2010)","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"18_CR35","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/TEVC.2013.2240304","volume":"18","author":"MK Marichelvam","year":"2014","unstructured":"Marichelvam, M.K., Prabaharan, T., Yang, X.S.: A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems. IEEE Trans. Evol. Comput. 18(2), 301\u2013305 (2014)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"18_CR36","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1007\/s10845-009-0374-7","volume":"22","author":"M Zandieh","year":"2011","unstructured":"Zandieh, M., Karimi, N.: An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times. J. Intell. Manuf. 22(6), 979\u2013989 (2011)","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"18_CR37","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.cie.2011.04.008","volume":"61","author":"HM Cho","year":"2011","unstructured":"Cho, H.M., Bae, S.J., Kim, J., Jeong, I.J.: Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Comput. Ind. Eng. 61(3), 529\u2013541 (2011)","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"18_CR38","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1080\/00207543.2013.847983","volume":"52","author":"S Wang","year":"2014","unstructured":"Wang, S., Liu, M.: Two-stage hybrid flow shop scheduling with preventive maintenance using multi-objective tabu search method. Int. J. Prod. Res. 52(5), 1495\u20131508 (2014)","journal-title":"Int. J. Prod. Res."},{"key":"18_CR39","unstructured":"Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical report-TR06, Computer Engineering Department, Engineering Faculty, Erciyes University (2005)"},{"issue":"1","key":"18_CR40","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC) algorithm. Appl. Soft Comput. 8(1), 687\u2013697 (2008)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"18_CR41","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga, D., Akay, B.: A comparative study of artificial bee colony algorithm. Appl. Math. Comput. 214(1), 108\u2013132 (2009)","journal-title":"Appl. Math. Comput."},{"issue":"12","key":"18_CR42","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan, Q.K., Tasgetiren, M.F., Suganthan, P.N., et al.: A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf. Sci. 181(12), 2455\u20132468 (2011)","journal-title":"Inf. Sci."},{"issue":"9","key":"18_CR43","first-page":"1159","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(9), 1159\u20131169 (2011)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"2","key":"18_CR44","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TASE.2012.2204874","volume":"10","author":"QK Pan","year":"2013","unstructured":"Pan, Q.K., Wang, L., Mao, K., Zhao, J.H., Zhang, M.: An effective artificial bee colony algorithm for a real-world hybrid flowshop problem in steelmaking process. IEEE Trans. Autom. Sci. Eng. 10(2), 307\u2013322 (2013)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"1","key":"18_CR45","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.ijpe.2013.05.004","volume":"145","author":"S Wang","year":"2013","unstructured":"Wang, S., Wang, L., Liu, M., et al.: An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem. Int. J. Prod. Econ. 145(1), 387\u2013396 (2013)","journal-title":"Int. J. Prod. Econ."},{"issue":"6","key":"18_CR46","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., D\u00f6yen, A.: A new approach to solve hybrid flow shop scheduling problems by artificial immune system. Future Gener. Comput. Syst. 20(6), 1083\u20131095 (2004)","journal-title":"Future Gener. Comput. Syst."},{"issue":"5","key":"18_CR47","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00170-007-1048-2","volume":"35","author":"K Alayk\u00fdran","year":"2007","unstructured":"Alayk\u00fdran, K., Engin, O., D\u00f6yen, A.: Using ant colony optimization to solve hybrid flow shop scheduling problems. Int. J. Adv. Manuf. Technol. 35(5), 541\u2013550 (2007)","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"18_CR48","unstructured":"Liu, F., Zhang, X., Zou, F., et al.: Immune clonal selection algorithm for hybrid flow-shop scheduling problem. In: Control and Decision Conference, CCDC 2009, pp. 2605\u20132609. IEEE (2009). (In Chinese)"},{"key":"18_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-642-24728-6_76","volume-title":"Advanced Intelligent Computing","author":"Y Xu","year":"2011","unstructured":"Xu, Y., Wang, L., Zhou, G., Wang, S.: An effective shuffled frog leaping algorithm for solving hybrid flow-shop scheduling problem. In: Huang, D.-S., Gan, Y., Bevilacqua, V., Figueroa, J.C. (eds.) ICIC 2011. LNCS, vol. 6838, pp. 560\u2013567. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-24728-6_76"},{"issue":"6","key":"18_CR50","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":"18_CR51","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."}],"container-title":["Lecture Notes in Computer Science","Cloud Computing and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68505-2_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,30]],"date-time":"2017-10-30T01:16:07Z","timestamp":1509326167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68505-2_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319685045","9783319685052"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68505-2_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}