SOLVING RESOURCE CONSTRAINED SCHEDULING PROBLEM BY GENETIC 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.

TAREGHIAN H.R.; FARAHI M.H.; MOARAB M.

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

Journal Paper

Paper Information

Journal: SHAHID CHAMRAN UNIVERSITY JOURNAL OF SCIENCE Year:2007 | Volume:NEW SERIES | Issue:16 (SECTION A) Page(s): 24-34

Download Full-Text

Persian Verion

View:

2,661

Download:

Cites:

Information Journal Paper

Title

SOLVING RESOURCE CONSTRAINED SCHEDULING PROBLEM BY GENETIC ALGORITHM

Author(s)

TAREGHIAN H.R. | FARAHI M.H. | MOARAB M. | Issue Writer Certificate

Keywords

PROJECT MANAGEMENTQ3

RESOURCE CONSTRAINED SCHEDULING PROBLEMQ3

GENETIC ALGORITHMQ3

OPTIMIZATIONQ3

Abstract

A project consists of a set of activities with precedence relations. There is also a set of limited resources with which one can perform the activities. Each activity may be executed in more than one manner, depending on which resource(s) is (are) assigned to it. The objective of the limited resource scheduling problem which is known as NP-hard is to find the starting time and the manner in which each activity is performed in order to minimize the project span. In this paper a solution procedure based on GENETIC ALGORITHM is proposed. Each chromosome is encoded by 9 priority rules. In addition, chromosomes represent best solutions obtained between three cases of: (i) activities are performed at their earliest possible time, (ii) activities are performed at their latest possible time, and (iii) activities are performed at a time randomly selected from their time windows. To describe the solution procedure a numerical example is Presented.

Cites

No record.

References

No record.

Cite

APA: Copy

TAREGHIAN, H.R., FARAHI, M.H., & MOARAB, M.. (2007). SOLVING RESOURCE CONSTRAINED SCHEDULING PROBLEM BY GENETIC ALGORITHM. SHAHID CHAMRAN UNIVERSITY JOURNAL OF SCIENCE, NEW SERIES(16 (SECTION A)), 24-34. SID. https://sid.ir/paper/57998/en

Vancouver: Copy

TAREGHIAN H.R., FARAHI M.H., MOARAB M.. SOLVING RESOURCE CONSTRAINED SCHEDULING PROBLEM BY GENETIC ALGORITHM. SHAHID CHAMRAN UNIVERSITY JOURNAL OF SCIENCE[Internet]. 2007;NEW SERIES(16 (SECTION A)):24-34. Available from: https://sid.ir/paper/57998/en

IEEE: Copy

H.R. TAREGHIAN, M.H. FARAHI, and M. MOARAB, “SOLVING RESOURCE CONSTRAINED SCHEDULING PROBLEM BY GENETIC ALGORITHM,” SHAHID CHAMRAN UNIVERSITY JOURNAL OF SCIENCE, vol. NEW SERIES, no. 16 (SECTION A), pp. 24–34, 2007, [Online]. Available: https://sid.ir/paper/57998/en

Related Journal Papers