AN EXACT ALGORITHM FOR THE MODE IDENTITY PROJECT SCHEDULING PROBLEM

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.

AFSHAR NADJAFI BEHROUZ; RAHIMI AMIR; KARIMI HAMID

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

Journal Paper

Paper Information

Journal: JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING) Year:2012 | Volume:6 | Issue:1 (10) Page(s): 55-63

Download Full-Text

View:

385

Download:

117

Cites:

Information Journal Paper

Title

AN EXACT ALGORITHM FOR THE MODE IDENTITY PROJECT SCHEDULING PROBLEM

Author(s)

AFSHAR NADJAFI BEHROUZ | RAHIMI AMIR | KARIMI HAMID | Issue Writer Certificate

Keywords

PROJECT SCHEDULING

BRANCH AND BOUND

MODE-IDENTITY

MULTI-MODE

RESOURCE CONSTRAINED

Abstract

In this paper we consider the non-preemptive variant of a MULTI-MODE RESOURCE CONSTRAINED PROJECT SCHEDULING problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first BRANCH AND BOUND algorithm for the RESOURCE CONSTRAINED PROJECT SCHEDULING problem with mode identity. The proposed algorithm is extended with some bounding rules to reduce the size of BRANCH AND BOUND tree. Finally, some test problems are solved and their computational results are reported.

Cites

No record.

References

Cite

APA: Copy

AFSHAR NADJAFI, BEHROUZ, RAHIMI, AMIR, & KARIMI, HAMID. (2012). AN EXACT ALGORITHM FOR THE MODE IDENTITY PROJECT SCHEDULING PROBLEM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 6(1 (10)), 55-63. SID. https://sid.ir/paper/623526/en

Vancouver: Copy

AFSHAR NADJAFI BEHROUZ, RAHIMI AMIR, KARIMI HAMID. AN EXACT ALGORITHM FOR THE MODE IDENTITY PROJECT SCHEDULING PROBLEM. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2012;6(1 (10)):55-63. Available from: https://sid.ir/paper/623526/en

IEEE: Copy

BEHROUZ AFSHAR NADJAFI, AMIR RAHIMI, and HAMID KARIMI, “AN EXACT ALGORITHM FOR THE MODE IDENTITY PROJECT SCHEDULING PROBLEM,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 6, no. 1 (10), pp. 55–63, 2012, [Online]. Available: https://sid.ir/paper/623526/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops