{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T08:58:26Z","timestamp":1781168306841,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T00:00:00Z","timestamp":1409788800000},"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":["J Heuristics"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s10732-014-9260-3","type":"journal-article","created":{"date-parts":[[2014,9,3]],"date-time":"2014-09-03T04:56:42Z","timestamp":1409720202000},"page":"643-676","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["A lagrangian relaxation and ACO hybrid for resource constrained project scheduling with discounted cash flows"],"prefix":"10.1007","volume":"20","author":[{"given":"Dhananjay","family":"Thiruvady","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Wallace","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hanyu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Schutt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,9,4]]},"reference":[{"key":"9260_CR1","doi-asserted-by":"crossref","unstructured":"Abramson, D., Giddy, J., Kotler, L.: High Performance Parametric Modeling with Nimrod\/G: Killer Application for the Global Grid? In: International Parallel and Distributed Processing Symposium (IPDPS), pp. 520\u2013528. IEEE Computer Society, Washington, DC (2000)","DOI":"10.1109\/IPDPS.2000.846030"},{"key":"9260_CR2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., Mohring, 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."},{"key":"9260_CR3","doi-asserted-by":"crossref","DOI":"10.1515\/9780691212920","volume-title":"Self-Organization in Biological Systems","author":"S Camazine","year":"2001","unstructured":"Camazine, S., Deneubourg, J.L., Franks, N.R., Sneyd, J., Theraulaz, G., Bonabeau, E.: Self-Organization in Biological Systems. Princeton University Press, Princeton (2001)"},{"issue":"1","key":"9260_CR4","doi-asserted-by":"crossref","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., z Huang, R., Liu, O.: Optimizing discounted cash flows in project scheduling\u2014an 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":"9260_CR5","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":"9260_CR6","doi-asserted-by":"crossref","unstructured":"den Besten, M., St\u0171tzle, T., Dorigo, M.: Ant Colony Optimization for the Total Weighted Tardiness Problem. Lecture Notes in Computer Science, vol. 1917, pp. 611\u2013620. Springer, Berlin Heidelberg (2000)","DOI":"10.1007\/3-540-45356-3_60"},{"key":"9260_CR7","unstructured":"Dorigo, M.: Optimization, Learning and Natural Algorithms. Ph.D. thesis, Dip. Elettronica, Politecnico di Milano, Milan (1992)"},{"key":"9260_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1, 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9260_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u0171tzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"issue":"12","key":"9260_CR10","doi-asserted-by":"crossref","first-page":"1861","DOI":"10.1287\/mnsc.1040.0263","volume":"50","author":"M Fisher","year":"2004","unstructured":"Fisher, M.: The lagrangian relaxation method for solving integer programming problems. Manag. Sci. 50(12), 1861\u20131871 (2004)","journal-title":"Manag. Sci."},{"key":"9260_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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.: A lagrangian relaxation based forward-backward improvement heuristic for maximising the net present value of resource-constrained projects. In: Gomes, C., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science, vol. 7874, pp. 340\u2013346. Springer, Berlin (2013)"},{"key":"9260_CR12","doi-asserted-by":"crossref","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."},{"key":"9260_CR13","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 96, 205\u2013216 (1997)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9260_CR14","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/0377-2217(92)90320-9","volume":"56","author":"KY Li","year":"1992","unstructured":"Li, K.Y., Willis, R.J.: An iterative scheduling technique for resource-constrained project scheduling. Eur. J. Oper. Res. 56(3), 370\u2013379 (1992)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9260_CR15","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."},{"issue":"4","key":"9260_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":"9260_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24800-2","volume-title":"Project Scheduling with Time Windows and Scarce Resources","author":"K Neumann","year":"2003","unstructured":"Neumann, K., Schwindt, C., Zimmermann, J.: Project Scheduling with Time Windows and Scarce Resources. Springer, Berlin (2003)"},{"key":"9260_CR18","doi-asserted-by":"crossref","unstructured":"Show, YY.: Ant Colony Algorithm for Scheduling Resource Cconstrained Projects with Discounted Cash Flows. In: In Proceedings of the Fifth International Conference on Machine Learning and Cybernetics, pp. 176\u2013180. IEEE, Dalain (2006)","DOI":"10.1109\/ICMLC.2006.258892"},{"issue":"5","key":"9260_CR19","first-page":"363","volume":"39","author":"G Singh","year":"2011","unstructured":"Singh, G., Ernst, A.T.: Resource constraint scheduling with a fractional shared resource. Oper. Res. Lett. 39(5), 363\u2013368 (2011)","journal-title":"Oper. Res. Lett."},{"key":"9260_CR20","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u0171tzle","year":"2000","unstructured":"St\u0171tzle, T., Hoos, H.H.: MAX-MIN ant system. Future Gener. Comput. Syst. 16, 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"9260_CR21","doi-asserted-by":"crossref","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."},{"key":"9260_CR22","doi-asserted-by":"crossref","unstructured":"Thiruvady, D., Ernst, A.T., Singh, G.: Parallel ant colony optimization for resource constrained job scheduling. Ann. Oper. Res. 1\u201318 (2014)","DOI":"10.1007\/s10479-014-1577-7"},{"key":"9260_CR23","doi-asserted-by":"crossref","first-page":"1983","DOI":"10.1080\/00207540802010781","volume":"48","author":"M Vanhoucke","year":"2010","unstructured":"Vanhoucke, M.: A scatter search heuristic for maximizing the net present value of a resource-constrained project with fixed activity cash flows. Int. J. Prod. Res. 48, 1983\u20132001 (2010)","journal-title":"Int. J. Prod. Res."},{"issue":"8","key":"9260_CR24","doi-asserted-by":"crossref","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":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9260-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9260-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9260-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T12:52:35Z","timestamp":1746363155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9260-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,4]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["9260"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9260-3","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,4]]}}}