SCHEDULING AND ALLOCATION OF CONSTRAINED RESOURCE FOR PARALLEL PROJECTS

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.

FATEMI GHOMI S.M.T.; ASHJARI B.

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

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN) Year:2002 | Volume:12 | Issue:4 Page(s): 193-208

Download Full-Text

Persian Verion

View:

1,540

Download:

Cites:

Information Journal Paper

Title

SCHEDULING AND ALLOCATION OF CONSTRAINED RESOURCE FOR PARALLEL PROJECTS

Author(s)

FATEMI GHOMI S.M.T. | ASHJARI B. | Issue Writer Certificate

Keywords

Not Registered.

Abstract

This paper discusses the scheduling and allocation of common and constrained resources of parallel projects with consideration of activities precedeuce’s to take maximum benefit of resources. At the present time the general problem of multi - project resource allocation is formulated as a zero- one programming and goal programming models [1,2]. But the complexity in the cited models would be highly increased when the size of projects will grow up. This complexity is especially important when the level of available resources varies during the project implementation. This paper tries to model the problem in the from of some subproblems of multidimensional knapsach kind. Then, a heuristic method is proposed to faciliate the solution of the problem. This method is capabable to obtain near– optimal solutions. To evaluate the accuracy of the proposed method, the numerical results gained by the method are compared with optimal values.

Cites

No record.

References

No record.

Cite

APA: Copy

FATEMI GHOMI, S.M.T., & ASHJARI, B.. (2002). SCHEDULING AND ALLOCATION OF CONSTRAINED RESOURCE FOR PARALLEL PROJECTS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), 12(4), 193-208. SID. https://sid.ir/paper/66001/en

Vancouver: Copy

FATEMI GHOMI S.M.T., ASHJARI B.. SCHEDULING AND ALLOCATION OF CONSTRAINED RESOURCE FOR PARALLEL PROJECTS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN)[Internet]. 2002;12(4):193-208. Available from: https://sid.ir/paper/66001/en

IEEE: Copy

S.M.T. FATEMI GHOMI, and B. ASHJARI, “SCHEDULING AND ALLOCATION OF CONSTRAINED RESOURCE FOR PARALLEL PROJECTS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION MANAGEMENT (IJIE) (INTERNATIONAL JOURNAL OF ENGINEERING SCIENCE) (PERSIAN), vol. 12, no. 4, pp. 193–208, 2002, [Online]. Available: https://sid.ir/paper/66001/en

Related Journal Papers