AN EFFICIENT META- HEURISTIC ALGORITHM FOR PROJECT SCHEDULING WITH MULTIPLE MODES

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.

SEBT M.H.; AFSHAR M.R.; ALIPOURI Y.

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

Journal Paper

Paper Information

Journal: Ferdowsi Civil Engineering Year:2016 | Volume:27 | Issue:1 Page(s): 101-114

Download Full-Text

Persian Verion

View:

686

Download:

365

Cites:

Information Journal Paper

Title

AN EFFICIENT META- HEURISTIC ALGORITHM FOR PROJECT SCHEDULING WITH MULTIPLE MODES

Author(s)

SEBT M.H. | AFSHAR M.R. | ALIPOURI Y. | Issue Writer Certificate

Keywords

MULTI- MODE RESOURCE CONSTRAINED PROJECT SCHEDULING PROBLEMQ2

PRECEDENCE CONSTRAINTSQ1

RESOURCE CONSTRAINTSQ2

FULLY INFORMED PARTICLE SWARM (FIPS) ALGORITHMQ2

RANDOM KEY REPRESENTATIONQ2

Abstract

In this paper, a Fully Informed Particle Swarm (FIPS) algorithm is proposed for solving the Multi-mode Resource- Constrained Project Scheduling Problem (MRCPSP) with minimization of project makespan as the objective subject to resource and PRECEDENCE CONSTRAINTS. In the proposed FIPS, A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In particular, a new fitness function which reduces the average deviation from optimality and CPU- time is presented. Comparing the results of the proposed FIPS with other approaches using the well- known benchmark sets in PSPLIB validate the effectiveness of the proposed algorithm to solve the MRCPSP.

Cites

No record.

References

No record.

Cite

APA: Copy

SEBT, M.H., AFSHAR, M.R., & ALIPOURI, Y.. (2016). AN EFFICIENT META- HEURISTIC ALGORITHM FOR PROJECT SCHEDULING WITH MULTIPLE MODES. JOURNAL OF CIVIL ENGINEERING (JOURNAL OF SCHOOL OF ENGINEERING), 27(1), 101-114. SID. https://sid.ir/paper/195988/en

Vancouver: Copy

SEBT M.H., AFSHAR M.R., ALIPOURI Y.. AN EFFICIENT META- HEURISTIC ALGORITHM FOR PROJECT SCHEDULING WITH MULTIPLE MODES. JOURNAL OF CIVIL ENGINEERING (JOURNAL OF SCHOOL OF ENGINEERING)[Internet]. 2016;27(1):101-114. Available from: https://sid.ir/paper/195988/en

IEEE: Copy

M.H. SEBT, M.R. AFSHAR, and Y. ALIPOURI, “AN EFFICIENT META- HEURISTIC ALGORITHM FOR PROJECT SCHEDULING WITH MULTIPLE MODES,” JOURNAL OF CIVIL ENGINEERING (JOURNAL OF SCHOOL OF ENGINEERING), vol. 27, no. 1, pp. 101–114, 2016, [Online]. Available: https://sid.ir/paper/195988/en

Related Journal Papers