{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T04:46:04Z","timestamp":1726029964968},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030209117"},{"type":"electronic","value":"9783030209124"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-20912-4_37","type":"book-chapter","created":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:02:29Z","timestamp":1558911749000},"page":"399-411","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Solving the Software Project Scheduling Problem with Hyper-heuristics"],"prefix":"10.1007","author":[{"given":"Joaquim","family":"de Andrade","sequence":"first","affiliation":[]},{"given":"Leila","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Britto","sequence":"additional","affiliation":[]},{"given":"Rodrigo","family":"Amaral","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,24]]},"reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"2380","DOI":"10.1016\/j.ins.2006.12.020","volume":"177","author":"E Alba","year":"2007","unstructured":"Alba, E., Chicano, F.: Software project management with gas. Inf. Sci. 177, 2380\u20132401 (2007)","journal-title":"Inf. Sci."},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Basgalupp, M.P., Barros, R.C., da Silva, T.S., de Carvalho, A.C.: Software effort prediction: a hyper-heuristic decision-tree based approach. In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, pp. 1109\u20131116. ACM (2013)","DOI":"10.1145\/2480362.2480571"},{"issue":"10","key":"37_CR3","first-page":"2051","volume":"45","author":"S Bechikh","year":"2015","unstructured":"Bechikh, S., Chaabani, A., Said, L.B.: An efficient chemical reaction optimization algorithm for multiobjective optimization. IEEE Trans. Evol. Comput. 45(10), 2051\u20132064 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"12","key":"37_CR4","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"key":"37_CR5","series-title":"Genetic and Evolutionary Computation","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-36797-2","volume-title":"Evolutionary Algorithms for Solving Multi-Objective Problems","author":"CAC Coello","year":"2007","unstructured":"Coello, C.A.C., Lamont, G.B., Veldhuizen, D.A.V.: Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic and Evolutionary Computation, 2nd edn. Springer, US (2007). \n                      https:\/\/doi.org\/10.1007\/978-0-387-36797-2","edition":"2"},{"issue":"2","key":"37_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Argawal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"37_CR7","doi-asserted-by":"crossref","unstructured":"Guizzo, G., Fritsche, G.M., Vergilio, S.R., Pozo, A.T.R.: A hyper-heuristic for the multi-objective integration and test order problem. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1343\u20131350. ACM (2015)","DOI":"10.1145\/2739480.2754725"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Harman, M., Burke, E., Clark, J., Yao, X.: Dynamic adaptive search based software engineering. In: Proceedings of the ACM-IEEE International Symposium on Empirical Software Engineering and Measurement, pp. 1\u20138. ACM (2012)","DOI":"10.1145\/2372251.2372253"},{"issue":"14","key":"37_CR9","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/S0950-5849(01)00189-6","volume":"43","author":"M Harman","year":"2001","unstructured":"Harman, M., Jones, B.F.: Search-based software engineering. Inf. Softw. Technol. 43(14), 833\u2013839 (2001)","journal-title":"Inf. Softw. Technol."},{"issue":"1","key":"37_CR10","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2379776.2379787","volume":"45","author":"M Harman","year":"2012","unstructured":"Harman, M., Mansouri, S.A., Zhang, Y.: Search-based software engineering: trends, techniques and applications. ACM Comput. Surv. (CSUR) 45(1), 11 (2012)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Jia, Y., Cohen, M.B., Harman, M., Petke, J.: Learning combinatorial interaction test generation strategies using hyperheuristic search. In: Proceedings of the 37th International Conference on Software Engineering, vol. 1, pp. 540\u2013550. IEEE Press (2015)","DOI":"10.1109\/ICSE.2015.71"},{"key":"37_CR12","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Neural Networks, 1995. Proceedings., IEEE International Conference on Neural Networks, vol. 6, December 1995"},{"key":"37_CR13","series-title":"Complex Adaptive Systems","volume-title":"Genetic Programming: On the Programming of Computers by Means of Natural Selection","author":"J Koza","year":"1992","unstructured":"Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. Complex Adaptive Systems, 1st edn. A Bradford Book, Massachusetts (1992)","edition":"1"},{"key":"37_CR14","unstructured":"Kumari, A.C., Srinivas, K., Gupta, M.: Software module clustering using a hyper-heuristic based multi-objective genetic algorithm. In: Advance Computing Conference (IACC), 2013 IEEE 3rd International, pp. 813\u2013818. IEEE (2013)"},{"key":"37_CR15","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.asoc.2013.10.015","volume":"15","author":"F Luna","year":"2014","unstructured":"Luna, F., Gonz\u00e1lez-\u00c1lvarez, D.L., Chicano, F., Vega-Rodr\u00edguez, M.A.: The software project scheduling problem: a scalability analysis of multi-objective metaheuristics. Appl. Soft Comput. J. 15, 136\u2013148 (2014)","journal-title":"Appl. Soft Comput. J."},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Mariani, T., Guizzo, G., Vergilio, S.R., Pozo, A.T.: Grammatical evolution for the multi-objective integration and test order problem. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016, pp. 1069\u20131076. ACM (2016)","DOI":"10.1145\/2908812.2908816"},{"key":"37_CR17","series-title":"Progress in Theoretical Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-1-4612-4118-8_2","volume-title":"ALGOL-like Languages","author":"P Naur","year":"1997","unstructured":"Naur, P., et al.: Revised report on the algorithmic language Algol 60. In: O\u2019Hearn, P.W., Tennent, R.D. (eds.) ALGOL-like Languages. Progress in Theoretical Computer Science, pp. 19\u201349. Springer, Boston (1997). \n                      https:\/\/doi.org\/10.1007\/978-1-4612-4118-8_2"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Nebro, A.J., Durillo, J.J., Garcia-Nieto, J., Coello, C.C., Luna, F., Alba, E.: SMPSO: a new PSO-based metaheuristic for multi-objective optimization. In: 2009 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making(MCDM), pp. 66\u201373. IEEE (2009)","DOI":"10.1109\/MCDM.2009.4938830"},{"issue":"4","key":"37_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/4235.942529","volume":"5","author":"M O\u2019Neill","year":"2001","unstructured":"O\u2019Neill, M., Ryan, C.: Grammatical evolution. IEEE Trans. Evol. Comput. 5(4), 349\u2013358 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"37_CR20","unstructured":"Project Management Institute: Pulse of the Profession (2017). Report"},{"key":"37_CR21","first-page":"4","volume":"3","author":"NR Sabar","year":"2012","unstructured":"Sabar, N.R., Ayob, M., Kendall, G., Qu, R.: Grammatical evolution hyper-heuristic for combinatorial optimization problems. Strategies 3, 4 (2012)","journal-title":"Strategies"},{"key":"37_CR22","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ijpe.2018.04.020","volume":"202","author":"M\u00c1 Vega-Vel\u00e1zquez","year":"2018","unstructured":"Vega-Vel\u00e1zquez, M.\u00c1., Garc\u00eda-N\u00e1jera, A., Cervantes, H.: A survey on the software project scheduling problem. Int. J. Prod. Econ. 202, 145\u2013161 (2018)","journal-title":"Int. J. Prod. Econ."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20912-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T23:16:58Z","timestamp":1558912618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20912-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209117","9783030209124"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20912-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/icaisc.eu\/About","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Own online software","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"333","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"122","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}