SOLVING MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS VIA BEE COLONY ALGORITHM

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.

SADEQI AMIR; SAFI SAMGH ABADI AEZAMDOKHT; BARZINJPOUR FARNAX

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

Journal Paper

Paper Information

Journal: Year:2011 | Volume:6 | Issue:15 Page(s): 1-19

Download Full-Text

Persian Verion

View:

3,541

Download:

Cites:

Information Journal Paper

Title

SOLVING MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS VIA BEE COLONY ALGORITHM

Author(s)

SADEQI AMIR | SAFI SAMGH ABADI AEZAMDOKHT | BARZINJPOUR FARNAX | Issue Writer Certificate

Keywords

PROJECT SCHEDULINGQ1

RESOURCE-CONSTRAINEDQ2

MULTIMODEQ2

BEE COLONY ALGORITHMQ2

Abstract

Multimode RESOURCE-CONSTRAINED PROJECT SCHEDULING problem (MRCPSP) is a type of RESOURCE-CONSTRAINED PROJECT SCHEDULING problem (RCPSP). In this problem the projects involves activities that condition each other and there is constraint of resources, both renewable and non-renewable. Each activity can be executed in more than one mode, each mode requiring a different resource. This problem is among the NP-Hard ones; therefore, scholars have always been eager to find a solution for it. In this study BEE COLONY ALGORITHM has been proposed as a solution. No other research has used BEE COLONY ALGORITHM for this problem before, and the present article is innovating this solution. We have solved the standard problems in the existing literature via this algorithm and have compared our results with the results created by the best and newest algorithms which are usually used for these problems in order to testify the strength of BEE COLONY ALGORITHM in this regard. The results demonstrate successful performance of BEE COLONY ALGORITHM for solving MRCPSP.

Cites

No record.

References

No record.

Cite

APA: Copy

SADEQI, AMIR, SAFI SAMGH ABADI, AEZAMDOKHT, & BARZINJPOUR, FARNAX. (2011). SOLVING MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS VIA BEE COLONY ALGORITHM. JOURNAL OF INDUSTRIAL MANAGEMENT, 6(15), 1-19. SID. https://sid.ir/paper/171086/en

Vancouver: Copy

SADEQI AMIR, SAFI SAMGH ABADI AEZAMDOKHT, BARZINJPOUR FARNAX. SOLVING MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS VIA BEE COLONY ALGORITHM. JOURNAL OF INDUSTRIAL MANAGEMENT[Internet]. 2011;6(15):1-19. Available from: https://sid.ir/paper/171086/en

IEEE: Copy

AMIR SADEQI, AEZAMDOKHT SAFI SAMGH ABADI, and FARNAX BARZINJPOUR, “SOLVING MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEMS VIA BEE COLONY ALGORITHM,” JOURNAL OF INDUSTRIAL MANAGEMENT, vol. 6, no. 15, pp. 1–19, 2011, [Online]. Available: https://sid.ir/paper/171086/en

Related Journal Papers