메뉴 건너뛰기




Volumn 2740, Issue , 2003, Pages 39-59

Solving dynamic resource constraint project scheduling problems using new constraint programming tools

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; SCHEDULING; TEACHING;

EID: 33645978780     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45157-0_3     Document Type: Article
Times cited : (14)

References (32)
  • 1
    • 0034561509 scopus 로고    scopus 로고
    • A Polynomial Activity Insertion Algorithm in a Multiresource Schedule with Cumulative Constraints and Multiple Modes
    • Artigues, C., Roubellat, F.: A Polynomial Activity Insertion Algorithm in a Multiresource Schedule with Cumulative Constraints and Multiple Modes. Eur. J. Oper. Res. 127 (2000) 179-198
    • (2000) Eur. J. Oper. Res. , vol.127 , pp. 179-198
    • Artigues, C.1    Roubellat, F.2
  • 2
    • 77952492430 scopus 로고
    • Arc Consistency in Dynamic Constraint Satisfaction Problems
    • Bessière, C.: Arc Consistency in Dynamic Constraint Satisfaction Problems. In: Proc. AAAI'91 (1991)
    • (1991) Proc. AAAI'91
    • Bessière, C.1
  • 3
    • 0019342681 scopus 로고
    • Scheduling Projects Subject to Resource Constraints: Classification and Complexity
    • Blazewicz, J., Lenstra, J.K., Rinnoy Kan, A.H.G.: Scheduling Projects Subject to Resource Constraints: Classification and Complexity. Discr. Appl. Math. 5 (1983) 11-24
    • (1983) Discr. Appl. Math. , vol.5 , pp. 11-24
    • Blazewicz, J.1    Lenstra, J.K.2    Rinnoy Kan, A.H.G.3
  • 5
    • 0032736579 scopus 로고    scopus 로고
    • Resource-Constrained Project Scheduling: Notation, Classification, Models and Methods
    • Brucker, P., Drexl, A., Möring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models and Methods. Eur. J. Oper. Res. 112 (1999) 3-41
    • (1999) Eur. J. Oper. Res. , vol.112 , pp. 3-41
    • Brucker, P.1    Drexl, A.2    Möring, R.3    Neumann, K.4    Pesch, E.5
  • 6
    • 0032096810 scopus 로고    scopus 로고
    • A Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem
    • Brucker, P., Knust, S., Schoo, A., Thiele, O.: A Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem. Eur. J. Oper. Res. 107 (1998) 272-288
    • (1998) Eur. J. Oper. Res. , vol.107 , pp. 272-288
    • Brucker, P.1    Knust, S.2    Schoo, A.3    Thiele, O.4
  • 7
    • 0038527516 scopus 로고    scopus 로고
    • Resource-Constrained Project Scheduling and Timetabling
    • Burke, E, Erben W. (Eds.): Practice and Theory of Automated Timetabling III (PATAT 2000, Konstanz, Germany, August, selected papers). Springer-Verlag, Berlin Heidelberg New York
    • Brucker, P., Knust, S.: Resource-Constrained Project Scheduling and Timetabling. In: Burke, E, Erben W. (Eds.): Practice and Theory of Automated Timetabling III (PATAT 2000, Konstanz, Germany, August, selected papers). Lecture Notes in Computer Science, Vol. 2079. Springer-Verlag, Berlin Heidelberg New York (2001) 277-293
    • (2001) Lecture Notes in Computer Science , vol.2079 , pp. 277-293
    • Brucker, P.1    Knust, S.2
  • 8
    • 84958983442 scopus 로고
    • A University Timetabling System Based on Graph Colouring and Constraint Manipulation
    • Burke, E.K., Elliman, D.G., Weare, R.F.: A University Timetabling System Based on Graph Colouring and Constraint Manipulation. J. Res. Comput. in Ed. 27 (1994) 1-18
    • (1994) J. Res. Comput. in Ed. , vol.27 , pp. 1-18
    • Burke, E.K.1    Elliman, D.G.2    Weare, R.F.3
  • 10
    • 0002785086 scopus 로고
    • Improving CLP Scheduling with Task Intervals
    • Van Hentenryck, P. (Ed.): MIT Press, Cambridge, MA
    • Caseau, Y., Laburthe, F.: Improving CLP Scheduling with Task Intervals. In: Van Hentenryck, P. (Ed.): Proc. 11th Int. Conf. Logic Program. (ICLP'94). MIT Press, Cambridge, MA (1994) 369-383
    • (1994) Proc. 11th Int. Conf. Logic Program. (ICLP'94) , pp. 369-383
    • Caseau, Y.1    Laburthe, F.2
  • 12
    • 0002907360 scopus 로고
    • A Branch and Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
    • Demeulemeester, E., Herroelen, W.: A Branch and Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem. Management Sci. 38 (1992) 1803-1818
    • (1992) Management Sci. , vol.38 , pp. 1803-1818
    • Demeulemeester, E.1    Herroelen, W.2
  • 14
    • 35248890712 scopus 로고    scopus 로고
    • Combined Automatic and Interactive Timetabling using Constraint Logic Programming
    • Konstanz, Germany, August
    • Goltz, H.J.: Combined Automatic and Interactive Timetabling using Constraint Logic Programming. In: Proc. PATAT 2000 (Konstanz, Germany, August)
    • Proc. PATAT 2000
    • Goltz, H.J.1
  • 15
    • 84958739675 scopus 로고    scopus 로고
    • Building University Timetables Using Constraint Logic Programming
    • Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Springer-Verlag, Berlin Heidelberg New York
    • Guéret, C., Jussien, N., Boizumault, P., Prins, C.: Building University Timetables Using Constraint Logic Programming. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 130-145
    • (1996) Lecture Notes in Computer Science , vol.1153 , pp. 130-145
    • Guéret, C.1    Jussien, N.2    Boizumault, P.3    Prins, C.4
  • 16
    • 0343878108 scopus 로고    scopus 로고
    • Using Intelligent Backtracking to Improve Branch and Bound Methods: An Application to Open-Shop Problems
    • Guéret, C., Jussien, N., Prins, C.: Using Intelligent Backtracking to Improve Branch and Bound Methods: an Application to Open-Shop Problems. Eur. J. Oper. Res. 127 (2000) 344-354
    • (2000) Eur. J. Oper. Res. , vol.127 , pp. 344-354
    • Guéret, C.1    Jussien, N.2    Prins, C.3
  • 17
    • 0026417190 scopus 로고
    • Tabu Search for Large Scale Timetabling Problems
    • Hertz, A.: Tabu Search for Large Scale Timetabling Problems. Eur. J. Oper. Res. 54 (1991) 39-47
    • (1991) Eur. J. Oper. Res. , vol.54 , pp. 39-47
    • Hertz, A.1
  • 18
    • 26444473026 scopus 로고    scopus 로고
    • E-constraints: Explanation-Based Constraint Programming
    • CP'01, Paphos, Cyprus, December
    • Jussien, N.: E-constraints: Explanation-Based Constraint Programming. In: Workshop on User-Interaction in Constraint Satisfaction (CP'01, Paphos, Cyprus, December) (2001)
    • (2001) Workshop on User-Interaction in Constraint Satisfaction
    • Jussien, N.1
  • 19
    • 35248841629 scopus 로고    scopus 로고
    • Dynamic Backtracking with Constraint Propagation - Application to Static and Dynamic CSPs
    • CP'97, Schloss Hagenberg, Austria, November
    • Jussien, N., Boizumault, P.: Dynamic Backtracking with Constraint Propagation - Application to Static and Dynamic CSPs. In: Workshop on The Theory and Practice of Dynamic Constraint Satisfaction (CP'97, Schloss Hagenberg, Austria, November) (1997)
    • (1997) Workshop on the Theory and Practice of Dynamic Constraint Satisfaction
    • Jussien, N.1    Boizumault, P.2
  • 20
    • 84945915031 scopus 로고    scopus 로고
    • Maintaining Arc-Consistency within Dynamic Backtracking
    • Principles and Practice of Constraint Programming (CP 2000, Singapore, September). Springer-Verlag, Berlin Heidelberg New York
    • Jussien, N., Debruyne, R., Boizumault, P.: Maintaining Arc-Consistency within Dynamic Backtracking. In: Principles and Practice of Constraint Programming (CP 2000, Singapore, September). Lecture Notes in Computer Science, Vol. 1894. Springer-Verlag, Berlin Heidelberg New York (2000) 249-261
    • (2000) Lecture Notes in Computer Science , vol.1894 , pp. 249-261
    • Jussien, N.1    Debruyne, R.2    Boizumault, P.3
  • 21
    • 0036641319 scopus 로고    scopus 로고
    • Local Search with Constraint Propagation and Conflict-Based Heuristics
    • Jussien, N., Lhomme, O.: Local Search with Constraint Propagation and Conflict-Based Heuristics. Artif. Intell. 139 (2002) 21-45
    • (2002) Artif. Intell. , vol.139 , pp. 21-45
    • Jussien, N.1    Lhomme, O.2
  • 23
    • 0026926482 scopus 로고
    • A Logic Approach to the Resolution of Constraint in Timetabling
    • Kang, L., White, G.M.: A Logic Approach to the Resolution of Constraint in Timetabling. Eur. J. Oper. Res. 61 (1992) 306-317
    • (1992) Eur. J. Oper. Res. , vol.61 , pp. 306-317
    • Kang, L.1    White, G.M.2
  • 24
    • 0032709489 scopus 로고    scopus 로고
    • Computing Lower Bounds by Destructive Improvement: An Application to Resource-Constrained Project Scheduling Problem
    • Klein R., Scholl, A.: Computing Lower Bounds by Destructive Improvement: an Application to Resource-Constrained Project Scheduling Problem. Eur. J. Oper. Res. 112 (1999) 322-345
    • (1999) Eur. J. Oper. Res. , vol.112 , pp. 322-345
    • Klein, R.1    Scholl, A.2
  • 25
    • 0002030301 scopus 로고    scopus 로고
    • Heuristic Algorithms for Solving the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis
    • Weglarz, J. (Ed.): Kluwer, Dordrecht
    • Kolisch, R., Hartmann, S.: Heuristic Algorithms for Solving the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis. In: Weglarz, J. (Ed.): Handbook on Recent Advances in Project Scheduling. Kluwer, Dordrecht (1998) 147-178
    • (1998) Handbook on Recent Advances in Project Scheduling , pp. 147-178
    • Kolisch, R.1    Hartmann, S.2
  • 26
    • 84958750405 scopus 로고    scopus 로고
    • Complete University Modular Timetabling Using Constraint Logic Programming
    • Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Springer-Verlag, Berlin Heidelberg New York
    • Lajos, G.: Complete University Modular Timetabling Using Constraint Logic Programming. In: Burke, E, Ross, P. (Eds.): Practice and Theory of Automated Timetabling I (PATAT 1995, Edinburgh, Aug/Sept, selected papers). Lecture Notes in Computer Science, Vol. 1153. Springer-Verlag, Berlin Heidelberg New York (1996) 148-161
    • (1996) Lecture Notes in Computer Science , vol.1153 , pp. 148-161
    • Lajos, G.1
  • 27
    • 0032070635 scopus 로고    scopus 로고
    • An Exact Algorithm for Project Scheduling with Resource Constraints Based on a New Mathematical Formulation
    • Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An Exact Algorithm for Project Scheduling with Resource Constraints Based on a New Mathematical Formulation. Management Sci. 44 (1998) 714-729
    • (1998) Management Sci. , vol.44 , pp. 714-729
    • Mingozzi, A.1    Maniezzo, V.2    Ricciardelli, S.3    Bianco, L.4
  • 28
    • 84992930122 scopus 로고
    • Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation
    • Parallel Problem Solving in Nature III. Springer-Verlag, Berlin Heidelberg New York
    • Ross, P., Corne, D., Fang., H-L.: Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation. In: Parallel Problem Solving in Nature III. Lecture Notes in Computer Science, Vol. 866. Springer-Verlag, Berlin Heidelberg New York (1994) 565-566
    • (1994) Lecture Notes in Computer Science , vol.866 , pp. 565-566
    • Ross, P.1    Corne, D.2    Fang, H.-L.3
  • 30
    • 84958976022 scopus 로고    scopus 로고
    • On-line scheduling - A Survey
    • Fiat, A., Woeginger, G.J. (Eds.): On-Line Algorithms: The State of the Art. Springer-Verlag, Berlin Heidelberg New York
    • Sgall, J.: On-line scheduling - a Survey. In: Fiat, A., Woeginger, G.J. (Eds.): On-Line Algorithms: The State of the Art. Lecture Notes in Computer Science, Vol. 1442. Springer-Verlag, Berlin Heidelberg New York (1998) 196-231
    • (1998) Lecture Notes in Computer Science , vol.1442 , pp. 196-231
    • Sgall, J.1
  • 31
    • 0018011301 scopus 로고
    • Multiple Resource-Constrained Scheduling using Branch and Bound
    • Stinson, J.P., David, E.W., Khamawala, B.M.: Multiple Resource-Constrained Scheduling using Branch and Bound. IIE Trans. 1 (1978) 252-259
    • (1978) IIE Trans. , vol.1 , pp. 252-259
    • Stinson, J.P.1    David, E.W.2    Khamawala, B.M.3
  • 32
    • 0021603760 scopus 로고
    • School Timetabling - A Case in Large Binary Integer Linear Programming
    • Tripathy, A.: School Timetabling - a Case in Large Binary Integer Linear Programming. Management Sci. 30 (1984) 1473-1489
    • (1984) Management Sci. , vol.30 , pp. 1473-1489
    • Tripathy, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.