메뉴 건너뛰기




Volumn 2470, Issue , 2002, Pages 63-79

A new multi-resource cumulatives constraint with negative heights

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER PROGRAMMING; OPTIMIZATION; SCHEDULING; SIGNAL FILTERING AND PREDICTION;

EID: 84956986575     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_5     Document Type: Conference Paper
Times cited : (53)

References (20)
  • 1
    • 0002869954 scopus 로고
    • Extending CHIP to solve Complex Scheduling and Packing Problems
    • Aggoun, A., Beldiceanu, N.: Extending CHIP to solve Complex Scheduling and Packing Problems. Mathl. Comput. Modelling, 17(7), pages 57-73, (1993).
    • (1993) Mathl. Comput. Modelling , vol.17 , Issue.7 , pp. 57-73
    • Aggoun, A.1    Beldiceanu, N.2
  • 2
    • 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. In European Journal of Operational Research (EJOR), 127, pages 297-316, (2000).
    • (2000) European Journal of Operational Research (EJOR) , vol.127 , pp. 297-316
    • Artigues, C.1    Roubellat, F.2
  • 3
    • 84957005431 scopus 로고    scopus 로고
    • Dynamic Constraint Models for Planning and Scheduling Problems
    • Cyprus, October 25-27, 1999)LNAI 1865, Springer Verlag
    • Barták, R.: Dynamic Constraint Models for Planning and Scheduling Problems. In New Trends in Constraints (Papers from the Joint ERCIM/Compulog-Net Workshop, Cyprus, October 25-27, 1999), LNAI 1865, Springer Verlag, (2000).
    • (2000) New Trends in Constraints (Papers from the Joint Ercim/Compulog-Net Workshop
    • Barták, R.1
  • 5
    • 0034250305 scopus 로고    scopus 로고
    • Constraint-directed techniques for scheduling alternative activities
    • Beck, J. C., Fox, M. S.: Constraint-directed techniques for scheduling alternative activities. In Artificial Intelligence 121, pages 211-250, (2000).
    • (2000) Artificial Intelligence 121 , pp. 211-250
    • Beck, J.C.1    Fox, M.S.2
  • 6
    • 84947922824 scopus 로고    scopus 로고
    • Pruning for the minimum Constraint Family and for the number of distinct values Constraint Family
    • Paphos
    • Beldiceanu, N.: Pruning for the minimum Constraint Family and for the number of distinct values Constraint Family. In Proc. of the 7th CP, 211-224, Paphos, (2001).
    • (2001) Proc of the 7 , pp. 211-224
    • Beldiceanu, N.1
  • 7
    • 84947944462 scopus 로고    scopus 로고
    • Sweep as a Generic Pruning Technique Applied to the Non-Overlapping Rectangles Constraint
    • Paphos
    • Beldiceanu, N., Carlsson, M.: Sweep as a Generic Pruning Technique Applied to the Non-Overlapping Rectangles Constraint. In Proc. of the 7th CP, 377-391, Paphos, (2001).
    • (2001) Proc of the 7 , pp. 377-391
    • Beldiceanu, N.1    Carlsson, M.2
  • 9
    • 0032736579 scopus 로고    scopus 로고
    • Resourceconstrained project scheduling: Notation, classification, models and methods
    • Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E.: Resourceconstrained project scheduling: Notation, classification, models and methods, in EJOR 112, pages 3-41, (1999).
    • (1999) EJOR 112 , pp. 3-41
    • Brucker, P.1    Drexl, A.2    Möhring, R.3    Neumann, K.4    Pesch, E.5
  • 10
    • 84923057783 scopus 로고    scopus 로고
    • An Open-Ended Finite Domain Constraint Solver. Proc. Programming Languages
    • Springer-Verlag
    • Carlsson, M., Ottosson G., Carlson, B.: An Open-Ended Finite Domain Constraint Solver. Proc. Programming Languages: Implementations, Logics, and Programs, vol. 1292 of Lecture Notes in Computer Science, pages 191-206, Springer-Verlag, (1997).
    • (1997) Implementations, Logics, and Programs , pp. 191-206
    • Carlsson, M.1    Ottosson, G.2    Carlson, B.3
  • 13
    • 33947518636 scopus 로고
    • Energy-based approach for task scheduling under time and resources constraints
    • Compiègne (France), June 20-22
    • Erschler, J., Lopez, P.: Energy-based approach for task scheduling under time and resources constraints. In 2nd International Workshop on Project Management and Scheduling, pages 115-121, Compiègne (France), June 20-22, (1990).
    • (1990) 2Nd International Workshop on Project Management and Scheduling , pp. 115-121
    • Erschler, J.1    Lopez, P.2
  • 15
    • 0142125475 scopus 로고
    • Scheduling: The Notions of Hump, Compulsory Parts and their Use in Cumulative Problems
    • Paris, t. 294
    • Lahrichi, A.: Scheduling: the Notions of Hump, Compulsory Parts and their Use in Cumulative Problems. in: C. R. Acad. Sc. Paris, t. 294, pages 209-211, (1982).
    • (1982) C. R. Acad. Sc , pp. 209-211
    • Lahrichi, A.1
  • 18
    • 55849106116 scopus 로고
    • Modelling Producer/Consumer Constraints
    • Cassis
    • Simonis, H., Cornelissens, T.: Modelling Producer/Consumer Constraints. In Proc. of the 1st CP, 449-462, Cassis, (1995).
    • (1995) Proc of the 1 , pp. 449-462
    • Simonis, H.1    Cornelissens, T.2
  • 19
    • 84957015938 scopus 로고
    • Modelling Producer/Consumer Constraints
    • Cassis
    • Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, Implementation and Evaluation of the Constraint Language cc(FD). In A. Podelski, ed., Constraints: Basics and Trends, vol. 910 of Lecture Notes in Computer Science, Springer- Verlag, (1995).
    • (1995) Basics and Trends
    • Van Hentenryck, P.1    Saraswat, V.2    Deville, Y.3


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