{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:28:05Z","timestamp":1729628885121,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/tai.2003.1250202","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"284-289","source":"Crossref","is-referenced-by-count":0,"title":["Ant colony optimization for resource-constrained project scheduling with generalized precedence relations"],"prefix":"10.1109","author":[{"family":"Shipeng Luo","sequence":"first","affiliation":[]},{"family":"Cheng Wang","sequence":"additional","affiliation":[]},{"family":"Jinwen Wang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"A branch-and-bound algorithm for the resource-constrained project duration problem subject to temporal constraints","author":"schwindt","year":"1998","journal-title":"Technical Report WIOR-544 Institute for Economic Theory and Operations Research"},{"journal-title":"Technical Report 596 Department of Mathematics","year":"1999","author":"fest","key":"ref3"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","article-title":"Ant Colony Optimization for Resource-Constrained Project Scheduling","volume":"6","author":"middendorf","year":"2002","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF00123686"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/3477.484436"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01545589"},{"key":"ref12","first-page":"252","article-title":"Ant-Q: Reinforcement Learning approach to the traveling salesman problem","author":"gambardella","year":"1999","journal-title":"Proceedings of ML-95 Twelfth Intern Conf On Machine Learning"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/PL00013356","article-title":"Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling","volume":"23","author":"neumann","year":"2001","journal-title":"OR Spektrum"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90016-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.46.10.1365.12272"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(95)00357-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00305-6"}],"event":{"name":"15th IEEE International Conference on Tools with Artificial Intelligence","acronym":"TAI-03","location":"Sacramento, CA, USA"},"container-title":["Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8840\/27974\/01250202.pdf?arnumber=1250202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:05:50Z","timestamp":1497585950000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1250202\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/tai.2003.1250202","relation":{},"subject":[]}}