Ant Colony Optimization for Resource-Constrained Project Scheduling with Generalized Precedence Relations

Proceedings of the International Conference on Tools with Artificial Intelligence

Volumn , Issue , 2003, Pages 284-289

  Luo, Shipeng ^a   Wang, Cheng ^a   Wang, Jinwen ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; WORLD WIDE WEB;

ANT COLONY OPTIMIZATION (ACO); GENERALIZED PRECEDENCE RELATIONS (GPR); RESOURCE CONSTRAINTS; RESOURCE SCHEDULING METHOD (RSM);

SCHEDULING;

EID: 0345097615     PISSN: 10636730     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. De Reyck B,W. Herroelen, "A branch-and-bound procedure for the resource constrained project scheduling problem with generalized precedence relations", European Journal of Operational Research, 111: 152-174, 1998.
2. U. Dorndorf, E. Pesch, T. H. Phan, "A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalized precedence constraints", Management Science, 46: 1365-1384, 2000.
3. Fest, R. H. Möhring, F. Stork, M. Uetz, "Resource-constrained project scheduling with time windows: A branching scheme based on dynamic release dates", Technical Report 596, Department of Mathematics, Technical University of Berlin, 1999
4. Schwindt, "A branch-and-bound algorithm for the resource-constrained project duration problem subject to temporal constraints", Technical Report WIOR-544, Institute for Economic Theory and Operations Research, University of Karlsruhe, 1998
5. K. Neumann, C. Schwindt, "Activity-on-node networks with minimal and maximal time lags and their application to make-to-order production", OR Spektrum, 19: 205-217, 1997.
6. K. Neumann, J. Zhan, "Heuristics for the minimum project-duration problem with minimal and maximal time-lags under fixed resource constraints", Journal of Intelligent Manufacturing, 6: 145-154, 1995.
7. J. Zhan, "Heuristics for scheduling resource-constrained projects in MPM networks", European Journal of Operational Research, 76:192-205, 1994.
8. Franck, K. Neumann, and C. Schwindt, "Truncated branch-and-bound, schedule-construction, and schedule-improvement procedures for resource-constrained project scheduling", OR Spektrum, 23: 297-324, 2001.
9. R. Kolisch, "Serial and Parallel resource-constrained project scheduling methods revisited: Theory and computation", European Journal of Operational Research, 90:320-333, 1996
10. Merkle, M. Middendorf, H. Schmeck, "Ant Colony Optimization for Resource-Constrained Project Scheduling", IEEE Transactions On Evolutionary Computation, 6(4): 333-346, 2002.
11. M. Dorigo, V. Maniezzo, A. Colorni, "Ant system: Optimization by a colony of cooperating agents," IEEE Transactions On System Man Cybernetics B, 26: 29-41, 1996.
12. L.M.Gambardella, M.Dorigo, "Ant-Q: Reinforcement Learning approach to the traveling salesman problem", Proceedings of ML-95,Twelfth Intern. Conf. On Machine Learning, Morgan Kaufmann, 252-260, 1999