메뉴 건너뛰기




Volumn , Issue , 2009, Pages 201-206

Reasoning with conditional time-intervals Part II: An algebraical model for resources

Author keywords

[No Author keywords available]

Indexed keywords

INTERVAL VARIABLE; MODEL PROBLEMS; MODELING LANGUAGES; MODELING POWER; OPTIMIZERS; SCHEDULING MODELS; SCHEDULING PROBLEM; STRUCTURAL ASPECTS;

EID: 70350510857     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (61)

References (12)
  • 1
    • 0002869954 scopus 로고
    • Extending CHIP in order to Solve Complex Scheduling and PlacementProblems
    • Aggoun, A., and Beldiceanu, N. 1993. Extending CHIP in order to Solve Complex Scheduling and PlacementProblems. Mathematical and Computer Modelling 17:57-73.
    • (1993) Mathematical and Computer Modelling , vol.17 , pp. 57-73
    • Aggoun, A.1    Beldiceanu, N.2
  • 4
    • 70350514360 scopus 로고    scopus 로고
    • Choco. 2008. Choco User Guide. http:llchoco-solver.netl. Frank, J., and Jónsson, A. 2003. Constraint-Based Attribute and Interval Planning. Constraints 8(4):339-364.
    • Choco. 2008. Choco User Guide. http:llchoco-solver.netl. Frank, J., and Jónsson, A. 2003. Constraint-Based Attribute and Interval Planning. Constraints 8(4):339-364.
  • 6
    • 70350489906 scopus 로고    scopus 로고
    • ILOG. 2008. ILOG CP 1.4 Reference Manual. Laborie, P., and Godard, D. 2007. Self-Adapting Large Neighborhood Search: Application to single-mode scheduling problems. In Proc. MISTA-07.
    • ILOG. 2008. ILOG CP 1.4 Reference Manual. Laborie, P., and Godard, D. 2007. Self-Adapting Large Neighborhood Search: Application to single-mode scheduling problems. In Proc. MISTA-07.
  • 7
    • 70350518730 scopus 로고    scopus 로고
    • Reasoning with Conditional Time-intervals
    • Laborie, P., and Rogerie, J. 2008. Reasoning with Conditional Time-intervals. In Proc. FL4IRS-08.
    • (2008) Proc. FL4IRS-08
    • Laborie, P.1    Rogerie, J.2
  • 8
    • 69849103141 scopus 로고    scopus 로고
    • ILOG CP Optimizer: Detailed Scheduling Model and OPL Formulation
    • Technical Report 08-002, ILOG
    • Laborie, P.; Rogerie, J.; Shaw, P.; Vilím, P.; and Wagner, F. 2008. ILOG CP Optimizer: Detailed Scheduling Model and OPL Formulation. Technical Report 08-002, ILOG. http://www2.ilog.com/techreports/.
    • (2008)
    • Laborie, P.1    Rogerie, J.2    Shaw, P.3    Vilím, P.4    Wagner, F.5
  • 9
    • 84880814324 scopus 로고    scopus 로고
    • Resource Temporal Networks: Definition and Complexity
    • Laborie, P. 2003. Resource Temporal Networks: Definition and Complexity. In Proc. IJCAI-03.
    • (2003) Proc. IJCAI-03
    • Laborie, P.1
  • 10
    • 70350489907 scopus 로고    scopus 로고
    • ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems
    • Technical Report 09-002, ILOG
    • Laborie, P. 2009. ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems. Technical Report 09-002, ILOG. http://www2.ilog.com/ techreports/.
    • (2009)
    • Laborie, P.1
  • 11
    • 70350501947 scopus 로고    scopus 로고
    • Generating robust schedules through temporal flexibility
    • 5
    • Policella, N.; Cesta, A.; Oddi, A.; and Smith, 5. 2004. Generating robust schedules through temporal flexibility. In Proc. ICAPS 04.
    • (2004) Proc. ICAPS 04
    • Policella, N.1    Cesta, A.2    Oddi, A.3    Smith4


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