Flexible scheduling approach for resource-constrained project scheduling problems

Shixin Liu; Oya I. Tukel; W. Rom

doi:10.1109/WCICA.2008.4593483

Flexible scheduling approach for resource-constrained project scheduling problems

Shixin Liu, Oya I. Tukel, W. Rom

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper presents a multi-start variable neighborhood simulated annealing (MVNSA) algorithm for solving resource-constrained project scheduling problems (RCPSP) to minimize project makespan and maximize schedule robustness. The MVNSA applies a multi-pass process to continually improve a heuristic initial solution. Each pass consists of multiple periods during which the MVNSA iteratively destructs the current solution and reconstructs it according to a heuristic rule until a stopping criterion is met. The MVNSA solves the RCPSP by adding disjunctive arcs into project networks to resolve resource conflicts, so that the resulting networks are precedence and resource feasible. A full factorial computational experiment is set up citing instances from problem library PSPLIB. Computational results show that the MVNSA can generate project schedules with short project makespan and high schedule robustness.

Original language	American English
Title of host publication	Proceedings of the 7th World Congress on Intelligent Control and Automation, WCICA'08
Pages	3522-3526
Number of pages	5
DOIs	https://doi.org/10.1109/WCICA.2008.4593483
State	Published - 2008
Externally published	Yes
Event	7th World Congress on Intelligent Control and Automation, WCICA'08 - Chongqing, China Duration: Jun 25 2008 → Jun 27 2008

Publication series

Name	Proceedings of the World Congress on Intelligent Control and Automation (WCICA)

Other

Other	7th World Congress on Intelligent Control and Automation, WCICA'08
Country/Territory	China
City	Chongqing
Period	6/25/08 → 6/27/08

ASJC Scopus subject areas

Control and Systems Engineering
Software
Computer Science Applications

Keywords

Minimal forbidden set
Project scheduling
Resource allocation
Simulated annealing

Access to Document

10.1109/WCICA.2008.4593483

Cite this

Liu, S., Tukel, O. I., & Rom, W. (2008). Flexible scheduling approach for resource-constrained project scheduling problems. In Proceedings of the 7th World Congress on Intelligent Control and Automation, WCICA'08 (pp. 3522-3526). Article 4593483 (Proceedings of the World Congress on Intelligent Control and Automation (WCICA)). https://doi.org/10.1109/WCICA.2008.4593483

@inproceedings{02a745516f8d4121981d2415204c91f7,

title = "Flexible scheduling approach for resource-constrained project scheduling problems",

abstract = "This paper presents a multi-start variable neighborhood simulated annealing (MVNSA) algorithm for solving resource-constrained project scheduling problems (RCPSP) to minimize project makespan and maximize schedule robustness. The MVNSA applies a multi-pass process to continually improve a heuristic initial solution. Each pass consists of multiple periods during which the MVNSA iteratively destructs the current solution and reconstructs it according to a heuristic rule until a stopping criterion is met. The MVNSA solves the RCPSP by adding disjunctive arcs into project networks to resolve resource conflicts, so that the resulting networks are precedence and resource feasible. A full factorial computational experiment is set up citing instances from problem library PSPLIB. Computational results show that the MVNSA can generate project schedules with short project makespan and high schedule robustness.",

keywords = "Minimal forbidden set, Project scheduling, Resource allocation, Simulated annealing",

author = "Shixin Liu and Tukel, {Oya I.} and W. Rom",

year = "2008",

doi = "10.1109/WCICA.2008.4593483",

language = "American English",

isbn = "9781424421145",

series = "Proceedings of the World Congress on Intelligent Control and Automation (WCICA)",

pages = "3522--3526",

booktitle = "Proceedings of the 7th World Congress on Intelligent Control and Automation, WCICA'08",

note = "7th World Congress on Intelligent Control and Automation, WCICA'08 ; Conference date: 25-06-2008 Through 27-06-2008",

}

Liu, S, Tukel, OI & Rom, W 2008, Flexible scheduling approach for resource-constrained project scheduling problems. in Proceedings of the 7th World Congress on Intelligent Control and Automation, WCICA'08., 4593483, Proceedings of the World Congress on Intelligent Control and Automation (WCICA), pp. 3522-3526, 7th World Congress on Intelligent Control and Automation, WCICA'08, Chongqing, China, 6/25/08. https://doi.org/10.1109/WCICA.2008.4593483

Flexible scheduling approach for resource-constrained project scheduling problems. / Liu, Shixin; Tukel, Oya I.; Rom, W.
Proceedings of the 7th World Congress on Intelligent Control and Automation, WCICA'08. 2008. p. 3522-3526 4593483 (Proceedings of the World Congress on Intelligent Control and Automation (WCICA)).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Flexible scheduling approach for resource-constrained project scheduling problems

AU - Liu, Shixin

AU - Tukel, Oya I.

AU - Rom, W.

PY - 2008

Y1 - 2008

N2 - This paper presents a multi-start variable neighborhood simulated annealing (MVNSA) algorithm for solving resource-constrained project scheduling problems (RCPSP) to minimize project makespan and maximize schedule robustness. The MVNSA applies a multi-pass process to continually improve a heuristic initial solution. Each pass consists of multiple periods during which the MVNSA iteratively destructs the current solution and reconstructs it according to a heuristic rule until a stopping criterion is met. The MVNSA solves the RCPSP by adding disjunctive arcs into project networks to resolve resource conflicts, so that the resulting networks are precedence and resource feasible. A full factorial computational experiment is set up citing instances from problem library PSPLIB. Computational results show that the MVNSA can generate project schedules with short project makespan and high schedule robustness.

AB - This paper presents a multi-start variable neighborhood simulated annealing (MVNSA) algorithm for solving resource-constrained project scheduling problems (RCPSP) to minimize project makespan and maximize schedule robustness. The MVNSA applies a multi-pass process to continually improve a heuristic initial solution. Each pass consists of multiple periods during which the MVNSA iteratively destructs the current solution and reconstructs it according to a heuristic rule until a stopping criterion is met. The MVNSA solves the RCPSP by adding disjunctive arcs into project networks to resolve resource conflicts, so that the resulting networks are precedence and resource feasible. A full factorial computational experiment is set up citing instances from problem library PSPLIB. Computational results show that the MVNSA can generate project schedules with short project makespan and high schedule robustness.

KW - Minimal forbidden set

KW - Project scheduling

KW - Resource allocation

KW - Simulated annealing

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

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

U2 - 10.1109/WCICA.2008.4593483

DO - 10.1109/WCICA.2008.4593483

M3 - Conference contribution

SN - 9781424421145

T3 - Proceedings of the World Congress on Intelligent Control and Automation (WCICA)

SP - 3522

EP - 3526

BT - Proceedings of the 7th World Congress on Intelligent Control and Automation, WCICA'08

T2 - 7th World Congress on Intelligent Control and Automation, WCICA'08

Y2 - 25 June 2008 through 27 June 2008

ER -

Flexible scheduling approach for resource-constrained project scheduling problems

Abstract

Publication series

Other

ASJC Scopus subject areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this