A precedence constraint posting approach for the rcpsp with time lags and variable durations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5732 LNCS, Issue , 2009, Pages 569-583

  Lombardi, Michele ^a   Milano, Michela ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVITY DURATION; COMPLETE SEARCH; COMPUTING RESOURCE; MINIMUM FLOW; MULTI PROCESSOR SYSTEMS; NOVEL METHODS; PARALLEL APPLICATION; PRECEDENCE CONSTRAINT POSTINGS; PRECEDENCE CONSTRAINTS; RESOURCE CONFLICT; RESOURCE OPTIMIZATION; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; TIME LAG;

COMPUTER PROGRAMMING; RESOURCE ALLOCATION; SCHEDULING;

CONSTRAINED OPTIMIZATION;

EID: 70350413803     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04244-7_45     Document Type: Conference Paper

References (20)

1. Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112(1), 3-41 (1999)
2. Stork, F.: Branch-and-bound algorithms for stochastic resource-constrained project scheduling. Technical Report Research Report No. 702/2000, Technische Univer-sität Berlin (2000)
3. Stork, F.: Stochastic resource-constrained project scheduling. PhD thesis, Technische Universität Berlin (2001)
4. Igelmund, G., Radermacher, F.J.: Algorithmic approaches to preselective strategies for stochastic scheduling problems. Networks 13(1), 29-48 (1983)
5. Igelmund, G., Radermacher, F.J.: Preselective strategies for the optimization of stochastic project networks under resource constraints. Networks 13(1), 1-28 (1983)
6. Herroelen, W., Leus, R.: Project scheduling under uncertainty: Survey and research potentials. European Journal of Operational Research 165(2), 289-306 (2005); Project Management and Scheduling
7. Beck, J.C., Davenport, A.J.: A survey of techniques for scheduling with uncertainty (2002), http://www.eil.utoronto.ca/profiles/chris/gz/uncertainty- survey.ps
8. Laborie, P.: Complete MCS-Based Search: Application to Resource Constrained Project Scheduling. In: IJCAI, pp. 181-186 (2005)
9. Benini, L., Lombardi, M., Milano, M.: Robust non-preemptive hard real-time scheduling for clustered multicore platforms. In: Proc. of DATE 2009 (2009)
10. Golumbic, M.: Algorithmic Graph Theory And Perfect Graphs, 2nd edn. Elsevier, Amsterdam (2004)
11. Morris, P.H., Muscettola, N.: Temporal dynamic controllability revisited. In: AAAI, pp. 1193-1198 (2005)
12. Morris, P.H., Muscettola, N., Vidal, T.: Dynamic control of plans with temporal uncertainty. In: IJCAI, pp. 494-502 (2001)
13. Muscettola, N.: Computing the envelope for stepwise-constant resource allocations. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 139-154. Springer, Heidelberg (2002)
14. Policella, N., Cesta, A., Oddi, A., Smith, S.F.: From precedence constraint posting to partial order schedules: a csp approach to robust scheduling. AI Commun. 20(3), 163-180 (2007)
15. Policella, N., Oddi, A., Smith, S.F., Cesta, A.: Generating robust partial order schedules. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 496-511. Springer, Heidelberg (2004)
16. Möhring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems I - General strategies. Mathematical Methods of Operations Research 28(7), 193-260 (1984)
17. Möhring, R.H., Radermacher, F.J., Weiss, G.: Stochastic scheduling problems II - set strategies. Mathematical Methods of Operations Research 29(3), 65-104 (1985)
18. De Reyck, B., Herroelen, W.: A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research 111(1), 152-174 (1998)
19. Möhring, R.H., Stork, F.: Linear preselective policies for stochastic project scheduling. Mathematical Methods of Operations Research 52(3), 501-515 (2000)
20. Vidal, T., Fargier, H.: Handling contingency in temporal constraint networks: from consistency to controllabilities. J. Exp. Theor. Artif. Intell. 11(1), 23-45 (1999)