A Simple Dual-RAMP Algorithm for Resource Constraint Project Scheduling

Haitao Li; Chris Riley; Cesar Rego

doi:10.1145/1900008.1900097

A Simple Dual-RAMP Algorithm for Resource Constraint Project Scheduling

Haitao Li, Chris Riley, Cesar Rego

University of Missouri-St. Louis

Research output: Contribution to journal › Article › peer-review

Abstract

A Relaxation Adaptive Memory Programming (RAMP) algorithm is developed to solve large-scale resource constrained project scheduling problems (RCPSP). The RAMP algorithm presented here takes advantage of a cross-parametric relaxation and extends a recent approach that casts the relaxed problem as a minimum cut problem. Computational results on a classical set of benchmark problems show that even a relatively simple implementation of the RAMP algorithm can find optimal or near-optimal solutions for a large set of those instances.

Original language	American English
Journal	Proceedings of the 48th Annual Southeast Regional Conference Article No. 67
DOIs	https://doi.org/10.1145/1900008.1900097
State	Published - 2010

Disciplines

Business Administration, Management, and Operations

Access to Document

10.1145/1900008.1900097License: Unspecified

Cite this

@article{1a083f84aca54f18b67a465ee6841687,

title = "A Simple Dual-RAMP Algorithm for Resource Constraint Project Scheduling",

abstract = " A Relaxation Adaptive Memory Programming (RAMP) algorithm is developed to solve large-scale resource constrained project scheduling problems (RCPSP). The RAMP algorithm presented here takes advantage of a cross-parametric relaxation and extends a recent approach that casts the relaxed problem as a minimum cut problem. Computational results on a classical set of benchmark problems show that even a relatively simple implementation of the RAMP algorithm can find optimal or near-optimal solutions for a large set of those instances.",

author = "Haitao Li and Chris Riley and Cesar Rego",

year = "2010",

doi = "10.1145/1900008.1900097",

language = "American English",

journal = "Proceedings of the 48th Annual Southeast Regional Conference Article No. 67",

}

TY - JOUR

T1 - A Simple Dual-RAMP Algorithm for Resource Constraint Project Scheduling

AU - Li, Haitao

AU - Riley, Chris

AU - Rego, Cesar

PY - 2010

Y1 - 2010

N2 - A Relaxation Adaptive Memory Programming (RAMP) algorithm is developed to solve large-scale resource constrained project scheduling problems (RCPSP). The RAMP algorithm presented here takes advantage of a cross-parametric relaxation and extends a recent approach that casts the relaxed problem as a minimum cut problem. Computational results on a classical set of benchmark problems show that even a relatively simple implementation of the RAMP algorithm can find optimal or near-optimal solutions for a large set of those instances.

AB - A Relaxation Adaptive Memory Programming (RAMP) algorithm is developed to solve large-scale resource constrained project scheduling problems (RCPSP). The RAMP algorithm presented here takes advantage of a cross-parametric relaxation and extends a recent approach that casts the relaxed problem as a minimum cut problem. Computational results on a classical set of benchmark problems show that even a relatively simple implementation of the RAMP algorithm can find optimal or near-optimal solutions for a large set of those instances.

UR - http://delivery.acm.org/10.1145/1910000/1900097/a67-riley.pdf?ip=134.124.93.74&id=1900097&acc=ACTIVE%20SERVICE&key=B63ACEF81C6334F5%2E676C655280F53299%2E4D4702B0C3E38B35%2E4D4702B0C3E38B35&__acm__=1548699405_41c26cb72e1b2c599aac109cf49168d6

U2 - 10.1145/1900008.1900097

DO - 10.1145/1900008.1900097

M3 - Article

JO - Proceedings of the 48th Annual Southeast Regional Conference Article No. 67

JF - Proceedings of the 48th Annual Southeast Regional Conference Article No. 67

ER -

A Simple Dual-RAMP Algorithm for Resource Constraint Project Scheduling

Abstract

Disciplines

Access to Document

Other files and links

Cite this