Intelligent search method for project scheduling problems

Journal of Intelligent Manufacturing

Volumn 10, Issue 3, 1999, Pages 279-288

  Shue, Li Yen ^a   Zamani, Reza ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BENCHMARKING; CONSTRAINT THEORY; HEURISTIC METHODS; LEARNING SYSTEMS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROCESS ENGINEERING; REAL TIME SYSTEMS; RESOURCE ALLOCATION; SCHEDULING;

HEURISTIC LEARNING PROCESS; INTELLIGENT SEARCH METHODS; STATE TRANSITION OPERATORS;

COMPUTER INTEGRATED MANUFACTURING;

EID: 0032598804     PISSN: 09565515     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008952024958     Document Type: Article

References (20)

1. Alvarez-Valdes, R. and Tamarit, J. (1989) Heuristic algorithms for resource-constrained project scheduling: a review and an empirical analysis. Part 1, in Advances in Project Scheduling, 1989 (R Slowinski and J Weglarz Eds), Chapter 5, Elsevier Science, Amsterdam.
2. Baker, K. R. (1974) Introduction to Sequencing and Scheduling, Wiley, New York.
3. Bell, C. and Park, P. (1990) Solving resource-contrainted project scheduling problems by A* search. Naval Research Logistics, 37, 280-318.
4. Blazewicz, J., Lenstra, J. and Rinnooy Kan, A. (1983) Scheduling projects to resource constraints: classification and complexity. Discrete Appl Math., 5, 11-24.
5. Boctor, F. (1990) Some efficient multi-heuristic procedures for resource-constrained project scheduling. Euro. J. Opl. Res., 49, 3-13.
6. Brand, J., Mater, W. and Shaffer, L. (1964) The resource scheduling problem in construction, Civil Engineering Studies report No 5. University of Illinois.
7. Christofides, N., Alvarez-Valdes, R. and Taramit, J. (1987) Project scheduling with resource constraints: a branch and bound approach. Euro. J. Opl. Res., 29, 262-273.
8. Cooper, D. (1976) Heuristic for scheduling resource-constrained projects: an experimental investigation. Mgmt. Sci., 22, 1186-1194.
9. David, E. and Heidorn, G. (1971) An algorithm for optimal project scheduling under multiple resource constraints. Mgmt. Sci., 17, B803-B816.
10. David, E. and Patterson, J. (1975) A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Mgmt. Sci., 21, 944-955.
11. Demeulemeester, E. and Herroelen, W. (1992) A branch-and -bound procedure for the multiple resource-constrained project scheduling problems. Mgmt. Sci., 38, 803-1818.
12. Demeulemeester, E. and Herroelen, W. (1996) An efficient optimal solution procedure for the preemptive resource-contrained project scheduling problem. Euro. J. Opl. Res., 90, 334-348
13. Franch, S. (1982) Sequencing and Scheduling; An Introduction to the Mathematics of the Job-Shop, Wiley, New York.
14. Korf, R. (1990) Real time heuristic search. Journal of artificial intelligence, 42, 189-211
15. Nilsson, N. (1982) Principle of Artificial Intelligence, Springer-Verlag, New York.
16. Paterson, J. (1984) A comparison of exact approaches for solving the multi-constrained resource project scheduling. Mgmt. Sci., 30, 854-867.
17. Rinnooy Kan, A. (1976) Machine Scheduling Problems: Classification, Complexity and Computations, Martinus Nijhoff, The Hague.
18. Schrage, L. (1970) Solving resource-constrained network problems by implicit enumeration-non preemptive case. Opns. Res., 18, 263-278.
19. Stinson, J., David, E. and Kuumawala, B. (1978) Multiple resource-constrained scheduling using branch and bound. AIIE Trans., 3, 91-98.
20. Talbot, F. and Patterson, J. (1978) An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling program. Mgmt. Sci., 24, 1163-1174.