Robust Optimization of Resource-constrained Multi-Project Scheduling Problem with Uncertain Activities Duration

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Nabipoor Afruzi Elham; AGHAIE ABDOLLAH

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Advances in Industrial Engineering Year:2018 | Volume:52 | Issue:2 Page(s): 291-307

Download Full-Text

Persian Verion

View:

407

Download:

Cites:

Information Journal Paper

Title

Robust Optimization of Resource-constrained Multi-Project Scheduling Problem with Uncertain Activities Duration

Author(s)

Nabipoor Afruzi Elham | AGHAIE ABDOLLAH | Issue Writer Certificate

Keywords

Multi-project scheduling problemQ1

resource constraintQ1

activity duration scenarioQ1

minimization of maximum regretQ1

robust optimizationQ1

Abstract

Multi-project scheduling problem is one of the most important problems in the project scheduling applications which has attracted considerable attention in the past decades. Due to the importance of resources in the Multi-project scheduling problem, the resource sharing policy is applied in this research. In addition, in each project, the activities durations are subject to the considerable uncertainty. According to the rapid changing of the environment and also the uniqueness of the project, one cannot set the probability distribution for the activity durations with certainty. In addition, the problem in multi-project scale needs more conservative approach while facing with uncertainty. Therefore, the robust optimization approach is applied in this paper in such a way that the maximum total weighted tardiness of the projects would become minimum. The robust resource-constrained Multi-project scheduling problem (RRCMPSP) is investigated in this paper as a two stage models. The scenario relaxation algorithm is applied while resulting the exact solution for the RRCMPSP and tested on the examples produces by the RanGen. So in this paper, one optimal structure containing all of the projects for the multi-project problem is obtained in such a way that the maximum differences between the finish time of projects and their due date would become minimum.

Cites

No record.

References

No record.

Cite

APA: Copy

Nabipoor Afruzi, Elham, & AGHAIE, ABDOLLAH. (2018). Robust Optimization of Resource-constrained Multi-Project Scheduling Problem with Uncertain Activities Duration. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 52(2 ), 291-307. SID. https://sid.ir/paper/166438/en

Vancouver: Copy

Nabipoor Afruzi Elham, AGHAIE ABDOLLAH. Robust Optimization of Resource-constrained Multi-Project Scheduling Problem with Uncertain Activities Duration. ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2018;52(2 ):291-307. Available from: https://sid.ir/paper/166438/en

IEEE: Copy

Elham Nabipoor Afruzi, and ABDOLLAH AGHAIE, “Robust Optimization of Resource-constrained Multi-Project Scheduling Problem with Uncertain Activities Duration,” ADVANCES IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 52, no. 2 , pp. 291–307, 2018, [Online]. Available: https://sid.ir/paper/166438/en

Related Journal Papers