{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T08:58:33Z","timestamp":1781168313741,"version":"3.54.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030059828","type":"print"},{"value":"9783030059835","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T00:00:00Z","timestamp":1545091200000},"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-05983-5_2","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T12:27:46Z","timestamp":1545049666000},"page":"16-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Maximising the Net Present Value of Project Schedules Using CMSA and Parallel ACO"],"prefix":"10.1007","author":[{"given":"Dhananjay","family":"Thiruvady","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas T.","family":"Ernst","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/3-540-45356-3_60","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"M den Besten","year":"2000","unstructured":"den Besten, M., St\u00fctzle, T., Dorigo, M.: Ant colony optimization for the total weighted tardiness problem. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 611\u2013620. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_60"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-39636-1_2","volume-title":"Hybrid Metaheuristics","author":"C Blum","year":"2016","unstructured":"Blum, C.: Construct, merge, solve and adapt: application to unbalanced minimum common string partition. In: Blesa, M.J., et al. (eds.) HM 2016. LNCS, vol. 9668, pp. 17\u201331. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39636-1_2"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-30698-8_4","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"C Blum","year":"2016","unstructured":"Blum, C., Blesa, M.J.: Construct, merge, solve and adapt: application to the repetition-free longest common subsequence problem. In: Chicano, F., Hu, B., Garc\u00eda-S\u00e1nchez, P. (eds.) EvoCOP 2016. LNCS, vol. 9595, pp. 46\u201357. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30698-8_4"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","volume":"68","author":"C Blum","year":"2016","unstructured":"Blum, C., Pinacho, P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Lozano, J.A.: Construct, merge, solve & adapt a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75\u201388 (2016)","journal-title":"Comput. Oper. Res."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Brent, O., Thiruvady, D., G\u00f3mez-Iglesias, A., Garcia-Flores, R.: A parallel lagrangian-ACO heuristic for project scheduling. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 2985\u20132991 (2014)","DOI":"10.1109\/CEC.2014.6900504"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112, 3\u201341 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TSMCC.2009.2027335","volume":"40","author":"WN Chen","year":"2010","unstructured":"Chen, W.N., Zhang, J., Chung, H.S.H., Huang, R.Z., Liu, O.: Optimizing discounted cash flows in project scheduling - an ant colony optimization approach. IEEE Trans. Syst. Man Cybern. Part C 40(1), 64\u201377 (2010)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-319-51691-2_23","volume-title":"Artificial Life and Computational Intelligence","author":"D Cohen","year":"2017","unstructured":"Cohen, D., G\u00f3mez-Iglesias, A., Thiruvady, D., Ernst, A.T.: Resource constrained job scheduling with parallel constraint-based ACO. In: Wagner, M., Li, X., Hendtlass, T. (eds.) ACALCI 2017. LNCS (LNAI), vol. 10142, pp. 266\u2013278. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-51691-2_23"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/99.660313","volume":"5","author":"L Dagum","year":"1998","unstructured":"Dagum, L., Menon, R.: OpenMP: an industry-standard API for shared-memory programming. IEEE Comput. Sci. Eng. 5(1), 46\u201355 (1998)","journal-title":"IEEE Comput. Sci. Eng."},{"key":"2_CR10","volume-title":"Project Scheduling: A Research Handbook","author":"E Demeulemeester","year":"2002","unstructured":"Demeulemeester, E., Herroelen, W.: Project Scheduling: A Research Handbook. Kluwer, Boston (2002)"},{"key":"2_CR11","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. Ph.D. thesis, Dip. Elettronica (1992)"},{"key":"2_CR12","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-38171-3_24","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"H Gu","year":"2013","unstructured":"Gu, H., Schutt, A., Stuckey, P.J.: A lagrangian relaxation based forward-backward improvement heuristic for maximising the net present value of resource-constrained projects. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 340\u2013346. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38171-3_24"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1023\/A:1010962300979","volume":"102","author":"A Kimms","year":"2001","unstructured":"Kimms, A.: Maximizing the net present value of a project under resource constraints using a lagrangian relaxation based heuristic with tight upper bounds. Ann. Oper. Res. 102, 221\u2013236 (2001)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB - a project scheduling problem library: OR software - ORSEP operations research software exchange program. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"2_CR16","first-page":"893","volume":"6","author":"D Merkle","year":"2000","unstructured":"Merkle, D., Middendorf, M., Schmeck, H.: Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6(4), 893\u2013900 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24800-2","volume-title":"Project Scheduling with Time Windows and Scarce Resources: Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions","author":"K Neumann","year":"2003","unstructured":"Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources: Temporal and Resource-Constrained Project Scheduling with Regular and Nonregular Objective Functions, vol. 508. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24800-2"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Show, Y.Y.: Ant colony algorithm for scheduling resource constrained projects with discounted cash flows. In: Proceedings of the Fifth International Conference on Machine Learning and Cybernetics, Dalain, China, pp. 176\u2013180. IEEE (2006)","DOI":"10.1109\/ICMLC.2006.258892"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10479-014-1577-7","volume":"242","author":"D Thiruvady","year":"2016","unstructured":"Thiruvady, D., Ernst, A.T., Singh, G.: Parallel ant colony optimization for resource constrained job scheduling. Ann. Oper. Res. 242(2), 355\u2013372 (2016)","journal-title":"Ann. Oper. Res."},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-319-07644-7_10","volume-title":"Hybrid Metaheuristics","author":"D Thiruvady","year":"2014","unstructured":"Thiruvady, D., Singh, G., Ernst, A.T.: Hybrids of integer programming and ACO for resource constrained job scheduling. In: Blesa, M.J., Blum, C., Vo\u00df, S. (eds.) HM 2014. LNCS, vol. 8457, pp. 130\u2013144. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07644-7_10"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.ijpe.2012.06.012","volume":"141","author":"D Thiruvady","year":"2012","unstructured":"Thiruvady, D., Singh, G., Ernst, A.T., Meyer, B.: Constraint-based ACO for a shared resource constrained scheduling problem. Int. J. Prod. Econ. 141(1), 230\u2013242 (2012)","journal-title":"Int. J. Prod. Econ."},{"issue":"6","key":"2_CR22","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/s10732-014-9260-3","volume":"20","author":"D Thiruvady","year":"2014","unstructured":"Thiruvady, D., Wallace, M., Gu, H., Schutt, A.: A lagrangian relaxation and ACO hybrid for resource constrained project scheduling with discounted cash flows. J. Heuristics 20(6), 643\u2013676 (2014)","journal-title":"J. Heuristics"},{"issue":"7","key":"2_CR23","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1080\/00207540802010781","volume":"48","author":"M Vanhoucke","year":"2010","unstructured":"Vanhoucke, M.: A scatter search heuristic for maximising the net present value of a resource-constrained project with fixed activity cash flows. Int. J. Prod. Res. 48(7), 1983\u20132001 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"8","key":"2_CR24","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1287\/mnsc.47.8.1113.10226","volume":"47","author":"M Vanhoucke","year":"2001","unstructured":"Vanhoucke, M., Demeulemeester, E., Herroelen, W.: On maximizing the net present value of a project under renewable resource constraints. Manag. Sci. 47(8), 1113\u20131121 (2001)","journal-title":"Manag. Sci."}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05983-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:23:56Z","timestamp":1710361436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05983-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,18]]},"ISBN":["9783030059828","9783030059835"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05983-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,18]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Hybrid Metaheuristics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","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 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hm2019.ing.udec.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}