An evolution programme for the resource-constrained project scheduling problem

International Journal of Computer Integrated Manufacturing

Volumn 11, Issue 3, 1998, Pages 274-287

  Cheng, Runwei ^a   Gen, Mitsuo ^a  

^a ASHIKAGA INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004421071     PISSN: 0951192X     EISSN: 13623052     Source Type: Journal    
DOI: 10.1080/095119298130804     Document Type: Article

References (32)

1. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B., 1993, Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs).
2. Alvarez-ValdEs, R., and Tamarit, J. m., 1989, Heuristic algorithms for resource constrained project scheduling: A review and an empirical analysis. In R. Slowinski and J. Weglarz (eds) Advances in Project Scheduling (Elsevier, Amsterdam), pp. 113-134.
3. Baker, K. R., 1974, Introduction to Sequencing and Scheduling (Wiley, New York).
4. Back, T., 1996, Evolutionary Algorithms in Theory and Practice (Oxford University Press, New York).
5. Bell, C. E., and Han, j., 1991, Anewheuristic solution method in resource constrained project scheduling. Naval Research Logistics, 38, 315-331.
6. Blazewicz, j., 1978, Complexity of computer scheduling algorithms under resource constraints, Proceedings of the First Meeting AFCET-SMF on Applied Mathematics, pp. 169-178.
7. Boctor, F., 1990, Some efficient multi-heuristic procedures for resource constrained project scheduling. European Journal of Operational Research, 49, 3-13.
8. Cheng, R., and Gen, m., 1994, Evolution program for resource constrained project scheduling problem. In D. B. Fogel (ed.) Proceedings of The First IEEE Conference on Evolutionary Computation (IEEE Press), pp. 736-741.
9. Cheng, R., Gen, m., and Tsujimura, Y, 1996, a tutorial survey of job-shop scheduling problems using genetic algorithms: Part I. representation. International Journal of Computers and Industrial Engineering, 30, 983-997.
10. Christofides, N., Alvarez-ValdEs, R., and Tamarit, J. M., 1987, Project scheduling with resource constrained: Abranch and bound approach. European Journal of Operational Research, 29, 262-273.
11. Cormen, T. H., Leiserson, C. E., and Rivest, R. L., 1990, Introduction to Algorithms (Cambridge: The MIT Press).
12. Davis, E. W., 1969, Computational experience with a new multi-re source algorithm. In H. J. M. Lombaers (ed.) Project Planning by Network An alysis (New York: North-Holland), pp. 256-260.
13. Davis, E. W., and Heidorn, G. E., 1971, An algorithm for optimal project scheduling under multiple resources constraints. Management Science, 17, B803-B816.
14. Davis, E. W., and Patterson, J. H., 1975, A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Science, 21, 944-955.
15. De Wit, J., and Herroelen, W., 1990, An evaluation of microcomputer-based software packages for project management. European Journal of Operational Research, 49, 102-139.
16. Drexl, a., and Gruenewald, j., 1993, Nonpreemptive multimode resource constrained project scheduling. AIIEE Transactions, 25, 74-81.
17. Gen, m., and Cheng, R., 1997, Genetic Algorithms and Engineering Design (John Wiley & Sons, New York).
18. Goldberg, d., 1989, Genetic Algorithms in Search, Optimization & Machine Learning (Addison-Wesley, Reading).
19. Jeffcoat, D. E., and Bulfin, R. L., 1993, Simulated annealing for resource constrained scheduling. European Journal of Operational Research, 70, 43-51.
20. Kelley, J. E., 1963, The critical path method: Resource planning and scheduling. In J. F. Muth and G. L. Thompson (eds) Industrial Scheduling (Prentice-Hall, Englewood Cliffs).
21. Kobayashi, S., 1993, Foundations of genetic algorithms and its applications. Communications of Operations Research Society of Japan, 45, 256-261, (in Japanese).
22. Kolisch, R., and Sprecher, a., 1996, PSPLIB: A project scheduling problem library, Technical report, Instituten fur Betriebswirtschaftslehre der Universität Kiel (Germany).
23. Manber, U., 1989, Introduction of Algorithms: A Creative Approach (Addison-Wesley, Reading).
24. Michalewicz, Z., 1994, Genetic Algorithm + Data Structure = Evolution Programs, second edition (Springer-Verlag).
25. Patterson, J. H., and Roth, G. W., 1976, Scheduling a project under multiple resource constraints: A 0-1 programming approach. AIIE Transactions, 8, 449-455.
26. Patterson, J. H., Talbot, F. E., Slowinski, R., and Weglaz, j., 1990, Computational experience with a backtracking algorithm for solving a general class of precedence and resource constrained scheduling problem. European Journal of Operational Research, 49, 68-79.
27. Pritsker, A. A., Waters, L. J., and Wolfe, P. m., 1969, Multiproject scheduling with limited resources: A 0-1 approach. Management Science, 16, 93-108.
28. Sampson, S. E., and Weiss, E. N., 1993, Local search techniques for the generalized resource constrained project scheduling problem. Naval Research Logistics, 40, 665-675.
29. Schwefel, H., 1994, Evolution and Optimum Seeking (John Wiley & Sons, New York).
30. Stinson, J. P., Davis, E. W., and Khumawala, E. H., 1978, Multiple resource constrained scheduling using branch and bound. AIIE Transactions, 10, 252-259.
31. Syswerda, G., 1991, Schedule optimization using genetic algorithms. In L. Davis (ed.) Handbook of Genetic Algorithms (Van Nostrand Reinhold, New York), pp. 332-349.
32. Talbot, F. E., and Patterson, J. H., 1978, An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems. Management Science, 24, 1163-1174.