An iterative sampling procedure for resource constrained project

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1999, Pages 1022-1029

  Cesta, Amedeo ^a   Oddi, Angelo ^a   Smith, Stephen F ^b  

^a CNR   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPARATIVE PERFORMANCE ANALYSIS; CONFLICT RESOLUTION; GENERALIZED PRECEDENCE RELATIONS; OPTIMIZATION PROBLEMS; RESOURCE CONSTRAINED SCHEDULING; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; SAMPLING PROCEDURES; STATE-OF-THE-ART PROCEDURES;

ARTIFICIAL INTELLIGENCE; BENCHMARKING; OPERATIONS RESEARCH; SCHEDULING;

ITERATIVE METHODS;

EID: 84880684460     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. M. Bartusch, R. H. Mohring, and F. J. Radermacher. Scheduling Project Networks with Resource Constraints and Time Windows. Annals of Operations Research, 16:201-240, 1988.
2. A. Cesta, A. Oddi, and S.F. Smith. Profile Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems. In Proceedings of the Fourth Int. Conf. on Artificial Intelligence Planning Systems (A1PS-98), 1998.
3. A. Cesta, A. Oddi, and S.F. Smith. Scheduling Multi-Capacitated Resources under Complex Temporal Constraints. Technical Report CMU-RI-TR-98-17, Robotics Institute, Carnegie Mellon University, 1998.
4. C. Cheng and S.F. Smith. Generating Feasible Schedules under Complex Metric-Constraints. In Proceedings 12th National Conference on AI (AAAI-94), 1994.
5. C. Cheng and S.F. Smith. Applying Constraint Satisfaction Techniques to Job Shop Scheduling. Annals of Operations Research, 70:327-357, 1997. (Pubitemid 127429163)
6. B. De Reyck and W. Herroelen. A Branch-and-Bound Procedure for the Resource-Constrained Project Scheduling Problem with Generalized Precedence Relations. European Journal on Operations Research, 1998. to appear.
7. U. Dorndorf, E. Pesch, and T. Phan Huy. A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalized Precedence Relations. Technical report, University of Bonn, Faculty of Economics, 1998.
8. B. Franck and K. Neumann. Resource Constrained Project Scheduling Problems with Time Windows - Structural Questions and Priority-Rule Methods. Technical Report WIOR- 492, Universitat Karlsruhe, 1998. (Revised November 1998).
9. R. Heilmann and C. Schwindt. Lower Bounds for RCPSP/max. Technical Report WIOR-511, Universitat Karlsruhe, 1997.
10. R.r Kolisch, C. Schwindt, and A. Sprecher. Benchmark Instances for Project Scheduling Problems. In J. Weglarz, editor, Handbook on Recent Advances in Project Scheduling, Kluwer, 1998.
11. P. Laborie and M. Ghallab. Planning with Sharable Resource Constraints. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-95), 1995.
12. R. Mohring, F. Stork, and M. Uetz. Resource Constrained Project Scheduling with Time Windows: A Branching Scheme Based on Dynamic Release Dates. Technical Report 596/1998, Fachbereich Mathematick, Technische Universitat Berlin, 1998.
13. W.P.M. Nuijten and E.H.L. Aarts. A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling. European Journal of Operational Research, 90(2):269 284, 1996.
14. W.P.M. Nuijten and C. Le Pape. Constraint-Based Job Shop Scheduling with ILOG-SCHEDULER. Journal of Heuristics, 3:271 286, 1998.
15. A. Oddi and S.F. Smith. Stochastic Procedures for Generating Feasible Schedules. In Proceedings 14th National Conference on A I (AAAI-97), 1997.
16. C. Schwindt. Generation of Resource Constrained Project Scheduling Problems with Minimal and Maximal Time Lags. Technical Report WIOR-489, Universitat Karlsruhe, 1996.
17. C. Schwindt. A Branch and Bound Algorithm for the Resource-Constrained Project Duration Problem Subject to Temporal Constraints. Technical Report WIOR-544, Universitat Karlsruhe, 1998.