### 抄録

Resource-constrained project scheduling problem (RCPSP) is a well known NP hard problem. This paper proposes a hybrid approach of constraint programming (CP) and integer programming (IP) which could solve RCPSP with ideal efficiency and quality. Constraint propagation is key element of constraint programming and is widely used in cumulative resource problem (CRP). CRP can be taken as a relaxed problem of RCPSP. This paper discussed how to eliminate the resource constraint, and transform RCPSP to project scheduling problem (PSP) so that the problem will became easier. Experiment shows this hybrid approach has certain efficient advantage compared with traditional CP method.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Lecture Notes in Engineering and Computer Science |

ページ | 1574-1577 |

ページ数 | 4 |

巻 | 2 |

出版物ステータス | Published - 2012 |

イベント | 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012 - Kowloon 継続期間: 2012 3 14 → 2012 3 16 |

### Other

Other | 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012 |
---|---|

市 | Kowloon |

期間 | 12/3/14 → 12/3/16 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science (miscellaneous)

### これを引用

*Lecture Notes in Engineering and Computer Science*(巻 2, pp. 1574-1577)

**Hybrid approach of constraint programming and integer programming for solving resource-constrained project-scheduling problems.** / Zhao, Cheng; Murata, Tomohiro.

研究成果: Conference contribution

*Lecture Notes in Engineering and Computer Science.*巻. 2, pp. 1574-1577, 2012 International MultiConference of Engineers and Computer Scientists, IMECS 2012, Kowloon, 12/3/14.

}

TY - GEN

T1 - Hybrid approach of constraint programming and integer programming for solving resource-constrained project-scheduling problems

AU - Zhao, Cheng

AU - Murata, Tomohiro

PY - 2012

Y1 - 2012

N2 - Resource-constrained project scheduling problem (RCPSP) is a well known NP hard problem. This paper proposes a hybrid approach of constraint programming (CP) and integer programming (IP) which could solve RCPSP with ideal efficiency and quality. Constraint propagation is key element of constraint programming and is widely used in cumulative resource problem (CRP). CRP can be taken as a relaxed problem of RCPSP. This paper discussed how to eliminate the resource constraint, and transform RCPSP to project scheduling problem (PSP) so that the problem will became easier. Experiment shows this hybrid approach has certain efficient advantage compared with traditional CP method.

AB - Resource-constrained project scheduling problem (RCPSP) is a well known NP hard problem. This paper proposes a hybrid approach of constraint programming (CP) and integer programming (IP) which could solve RCPSP with ideal efficiency and quality. Constraint propagation is key element of constraint programming and is widely used in cumulative resource problem (CRP). CRP can be taken as a relaxed problem of RCPSP. This paper discussed how to eliminate the resource constraint, and transform RCPSP to project scheduling problem (PSP) so that the problem will became easier. Experiment shows this hybrid approach has certain efficient advantage compared with traditional CP method.

KW - Constraint programming (CP)

KW - Cumulative resource problem (CRP)

KW - Integer programming (IP)

KW - Project scheduling problem (PSP)

KW - Resource-constrained project scheduling problems (RCPSP)

UR - http://www.scopus.com/inward/record.url?scp=84867460474&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867460474&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84867460474

SN - 9789881925190

VL - 2

SP - 1574

EP - 1577

BT - Lecture Notes in Engineering and Computer Science

ER -