{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T04:29:21Z","timestamp":1723350561324},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T00:00:00Z","timestamp":1647043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T00:00:00Z","timestamp":1647043200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1936114"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62006096"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Natural Science Foundation of Fujian Province of China","award":["2020J01699"]},{"name":"Natural Science Foundation of Fujian Province of China","award":["2020J01700"]},{"name":"Natural Science Foundation of Fujian Province of China","award":["2020J05146"]},{"name":"Natural Science Foundation of Fujian Province of China","award":["2020J01697"]},{"name":"General project of Education Department of Fujian Province","award":["JAT190320"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Unrelated Parallel Machines Scheduling Problem (UPMSP) with sequence-dependent setup times has been widely applied to cloud computing, edge computing and so on. When the setup times are ignored, UPMSP will be a NP problem. Moreover, when considering the sequence related setup times, UPMSP is difficult to solve, and this situation will be more serious in the case of high-dimensional. This work firstly select the maximum completion time as the optimization objective, which establishes a mathematical model of UPMSP with sequence-dependent setup times. In addition, an improved firefly algorithm with courtship learning is proposed. Finally, in order to provide an approximate solution in an acceptable time, the proposed algorithm is applied to solve the UPMSP with sequence-dependent setup times. The experimental results show that the proposed algorithm has competitive performance when dealing with UPMSP with sequence-dependent setup times.<\/jats:p>","DOI":"10.1186\/s13677-022-00282-w","type":"journal-article","created":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T11:02:46Z","timestamp":1647082966000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved firefly algorithm with courtship learning for unrelated parallel machine scheduling problem with sequence-dependent setup times"],"prefix":"10.1186","volume":"11","author":[{"given":"Xingwang","family":"Huang","sequence":"first","affiliation":[]},{"given":"Lingqing","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Yuxin","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Shubin","family":"Su","sequence":"additional","affiliation":[]},{"given":"Yangbin","family":"Lin","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-2533-4325","authenticated-orcid":false,"given":"Xuhui","family":"Cao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,12]]},"reference":[{"key":"282_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.knosys.2019.02.005","volume":"172","author":"A Ezugwu","year":"2019","unstructured":"Ezugwu A (2019) Enhanced symbiotic organisms search algorithm for unrelated parallel machines manufacturing scheduling with setup times. Knowl-Based Syst 172:15\u201332.","journal-title":"Knowl-Based Syst"},{"key":"282_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00170-008-1692-1","volume":"43","author":"CL Chen","year":"2008","unstructured":"Chen CL, Chen CL (2008) Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times. Int J Adv Manuf Technol 43:161\u2013169.","journal-title":"Int J Adv Manuf Technol"},{"key":"282_CR3","doi-asserted-by":"publisher","first-page":"54,459","DOI":"10.1109\/ACCESS.2018.2872110","volume":"6","author":"A Ezugwu","year":"2018","unstructured":"Ezugwu A, Akutsah F (2018) An improved firefly algorithm for the unrelated parallel machines scheduling problem with sequence-dependent setup times. IEEE Access 6:54,459\u201354,478.","journal-title":"IEEE Access"},{"key":"282_CR4","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ijpe.2018.04.013","volume":"201","author":"L Wu","year":"2018","unstructured":"Wu L, Wang S (2018) Exact and heuristic methods to solve the parallel machine scheduling problem with multi-processor tasks. Int J Prod Econ 201:26\u201340.","journal-title":"Int J Prod Econ"},{"issue":"11","key":"282_CR5","doi-asserted-by":"publisher","first-page":"8494","DOI":"10.1007\/s11227-019-03121-z","volume":"76","author":"F Orts","year":"2020","unstructured":"Orts F, Ortega G, Puertas A (2020) On solving the unrelated parallel machine scheduling problem: active microrheology as a case study. J Supercomput 76(11):8494\u20138509.","journal-title":"J Supercomput"},{"key":"282_CR6","first-page":"225","volume":"40","author":"B Li","year":"2012","unstructured":"Li B, Fu X, Gao X, Zhang Z (2012) Research on parallel machine scheduling problem in cloud computing based on ant colony algorithm. J Huazhong Univ Sci Technol 40:225\u2013229.","journal-title":"J Huazhong Univ Sci Technol"},{"key":"282_CR7","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/s10586-019-02983-5","volume":"23","author":"X Huang","year":"2019","unstructured":"Huang X, Li C, Chen H, An D (2019) Task scheduling in cloud computing using particle swarm optimization with time varying inertia weight strategies. Clust Comput 23:1137\u20131147.","journal-title":"Clust Comput"},{"issue":"4","key":"282_CR8","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10951-016-0485-x","volume":"20","author":"K B\u00fclb\u00fcl","year":"2017","unstructured":"B\u00fclb\u00fcl K, \u015een H (2017) An exact extended formulation for the unrelated parallel machine total weighted completion time problem. J Sched 20(4):373\u2013389.","journal-title":"J Sched"},{"issue":"4","key":"282_CR9","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1007\/s10845-010-0428-x","volume":"23","author":"X Li","year":"2012","unstructured":"Li X, Yalaoui F, Amodeo L, Chehade H (2012) Metaheuristics and exact methods to solve a multiobjective parallel machines scheduling problem. J Intell Manuf 23(4):1179\u20131194.","journal-title":"J Intell Manuf"},{"issue":"1","key":"282_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1504\/IJSI.2013.055801","volume":"1","author":"XS Yang","year":"2013","unstructured":"Yang XS, He X (2013) Firefly algorithm: recent advances and applications. Int J Swarm Intell 1(1):36\u201350.","journal-title":"Int J Swarm Intell"},{"key":"282_CR11","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ins.2020.05.111","volume":"543","author":"H Peng","year":"2021","unstructured":"Peng H, Zhu W, Deng C, Wu Z (2021) Enhancing firefly algorithm with courtship learning. Inf Sci 543:18\u201342.","journal-title":"Inf Sci"},{"issue":"8","key":"282_CR12","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1057\/jors.1991.132","volume":"42","author":"A Guinet","year":"1991","unstructured":"Guinet A (1991) Textile production systems: a succession of non-identical parallel processor shops. J Oper Res Soc 42(8):655\u2013671.","journal-title":"J Oper Res Soc"},{"key":"282_CR13","unstructured":"Vallada E, Ruiz R (2012). Springer, Just-in-Time Systems."},{"issue":"2","key":"282_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0305-0548(98)00051-3","volume":"26","author":"N Balakrishnan","year":"1999","unstructured":"Balakrishnan N, Kanet JJ, Sridharan V (1999) Early\/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput Oper Res 26(2):127\u2013141.","journal-title":"Comput Oper Res"},{"key":"282_CR15","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"PL Rocha","year":"2008","unstructured":"Rocha PL, Ravetti MG, Mateus G, Pardalos P (2008) Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput Oper Res 35:1250\u20131264.","journal-title":"Comput Oper Res"},{"issue":"9-12","key":"282_CR16","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1007\/s00170-014-6390-6","volume":"76","author":"O Avalos-Rosales","year":"2015","unstructured":"Avalos-Rosales O, Angel-Bello F, Alvarez A (2015) Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. Int J Adv Manuf Technol 76(9-12):1705\u20131718.","journal-title":"Int J Adv Manuf Technol"},{"key":"282_CR17","first-page":"774","volume":"242","author":"TT Tran","year":"2012","unstructured":"Tran TT, Beck JC (2012) Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups. Front Artif Intell Appl 242:774\u2013779.","journal-title":"Front Artif Intell Appl"},{"issue":"1","key":"282_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1287\/ijoc.2015.0666","volume":"28","author":"TT Tran","year":"2016","unstructured":"Tran TT, Araujo A, Beck JC (2016) Decomposition methods for the parallel machine scheduling problem with setups. INFORMS J Comput 28(1):83\u201395.","journal-title":"INFORMS J Comput"},{"key":"282_CR19","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.knosys.2018.01.018","volume":"145","author":"J Pacheco","year":"2018","unstructured":"Pacheco J, Porras S, Casado S, Baruque B (2018) Variable neighborhood search with memory for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times. Knowl Based Syst 145:236\u2013249.","journal-title":"Knowl Based Syst"},{"key":"282_CR20","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1093\/imaman\/dpm016","volume":"18","author":"MR Paula","year":"2007","unstructured":"Paula MR, Ravetti MG, Mateus G, Pardalos P (2007) Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. IMA J Manag Math 18:101\u2013115.","journal-title":"IMA J Manag Math"},{"key":"282_CR21","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/j.ejor.2011.01.011","volume":"211","author":"E Vallada","year":"2011","unstructured":"Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur J Oper Res 211:612\u2013622.","journal-title":"Eur J Oper Res"},{"key":"282_CR22","doi-asserted-by":"publisher","first-page":"9637","DOI":"10.1016\/j.eswa.2008.10.007","volume":"36","author":"J Behnamian","year":"2009","unstructured":"Behnamian J, Zandieh M, Ghomi S (2009) Parallel-machine scheduling problems with sequence-dependent setup times using an aco, sa and vns hybrid algorithm. Expert Syst Appl 36:9637\u20139644.","journal-title":"Expert Syst Appl"},{"key":"282_CR23","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s10845-009-0246-1","volume":"21","author":"JPM Arnaout","year":"2010","unstructured":"Arnaout JPM, Rabadi G, Musa R (2010) A two-stage ant colony optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. J Intell Manuf 21:693\u2013701.","journal-title":"J Intell Manuf"},{"key":"282_CR24","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.apm.2021.01.017","volume":"94","author":"AA Ewees","year":"2021","unstructured":"Ewees AA, Al-qaness MA, Elaziz MA (2021) Enhanced salp swarm algorithm based on firefly algorithm for unrelated parallel machine scheduling with setup times. Appl Math Model 94:285\u2013305.","journal-title":"Appl Math Model"},{"issue":"z1","key":"282_CR25","first-page":"163","volume":"42","author":"N Qun","year":"2012","unstructured":"Qun N, Taijin Z, Xiaohai W, Hongyun Z (2012) Clonal selection algorithm for parallel machine scheduling with setup time. J SE Univ (Nat Sci Ed) 42(z1):163\u2013167.","journal-title":"J SE Univ (Nat Sci Ed)"},{"issue":"12","key":"282_CR26","first-page":"2829","volume":"35","author":"L Changyuan","year":"2020","unstructured":"Changyuan L, Yuyan R, Xiaojun B (2020) Timing optimization of regional traffic signals based on improved firefly algorithm. Control Theory Appl 35(12):2829\u20132834.","journal-title":"Control Theory Appl"},{"issue":"1","key":"282_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1504\/IJBIC.2016.074630","volume":"8","author":"H Wang","year":"2016","unstructured":"Wang H, Wang W, Sun H, Rahnamayan S (2016) Firefly algorithm with random attraction. Int J Bio-Inspired Comput 8(1):33\u201341.","journal-title":"Int J Bio-Inspired Comput"},{"key":"282_CR28","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/S0736-5845(02)00013-3","volume":"18","author":"D Kim","year":"2002","unstructured":"Kim D, Kim K, Jang W, Chen FF (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robot Comput Integr Manuf 18:223\u2013231.","journal-title":"Robot Comput Integr Manuf"},{"issue":"10","key":"282_CR29","first-page":"2242","volume":"37","author":"S Qiang","year":"2020","unstructured":"Qiang S (2020) A hybrid multi-objective teaching-learning-based optimization algorithm for unrelated parallel machine scheduling problem. Control Theory Appl 37(10):2242\u20132256.","journal-title":"Control Theory Appl"},{"key":"282_CR30","doi-asserted-by":"publisher","first-page":"107,521","DOI":"10.1016\/j.asoc.2021.107521","volume":"110","author":"R Jovanovic","year":"2021","unstructured":"Jovanovic R, Vo\u00df S (2021) Fixed set search application for minimizing the makespan on unrelated parallel machines with sequence-dependent setup times. Appl Soft Comput 110:107,521.","journal-title":"Appl Soft Comput"},{"issue":"1","key":"282_CR31","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10479-019-03138-w","volume":"285","author":"JP Arnaout","year":"2020","unstructured":"Arnaout JP (2020) A worm optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times. Ann Oper Res 285(1):273\u2013293.","journal-title":"Ann Oper Res"},{"issue":"1","key":"282_CR32","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1016\/j.asoc.2010.03.003","volume":"11","author":"PC Chang","year":"2011","unstructured":"Chang PC, Chen SH (2011) Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times. Appl Soft Comput 11(1):1263\u20131274.","journal-title":"Appl Soft Comput"},{"key":"282_CR33","doi-asserted-by":"publisher","first-page":"54,459","DOI":"10.1109\/ACCESS.2018.2872110","volume":"6","author":"AE Ezugwu","year":"2018","unstructured":"Ezugwu AE, Akutsah F (2018) An improved firefly algorithm for the unrelated parallel machines scheduling problem with sequence-dependent setup times. IEEE Access 6:54,459\u201354,478.","journal-title":"IEEE Access"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-022-00282-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-022-00282-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-022-00282-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,12]],"date-time":"2022-03-12T11:35:35Z","timestamp":1647084935000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-022-00282-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,12]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["282"],"URL":"https:\/\/doi.org\/10.1186\/s13677-022-00282-w","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,12]]},"assertion":[{"value":"19 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The work is a novel work and has not been published elsewhere nor is it currently under review for publication elsewhere.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"9"}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1186%2FS13677-022-00282-W', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '><div><a href='#diffid115' style='color: white;' onClick="parent.window.postMessage('ixistenz.opendiff:115', '*');; return false;" style='text-decoration: none; '>Project </a> <a style='color: white;' href='#diffid115'><sup>1</sup></a></div></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>