A HYBRID GRASP ALGORITHM FOR MINIMIZING TOTAL WEIGHTED RESOURCE TARDINESS PENALTY COSTS IN SCHEDULING OF PROJECT NETWORKS

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.

RANJBAR M.

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

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2012 | Volume:23 | Issue:3 Page(s): 231-243

Download Full-Text

View:

338

Download:

104

Cites:

Information Journal Paper

Title

A HYBRID GRASP ALGORITHM FOR MINIMIZING TOTAL WEIGHTED RESOURCE TARDINESS PENALTY COSTS IN SCHEDULING OF PROJECT NETWORKS

Author(s)

RANJBAR M. | Issue Writer Certificate

Keywords

PROJECT SCHEDULING

WEIGHTED RESOURCE TARDINESS

GRASP

PATH-RELINKING

Abstract

In this paper, we consider scheduling of project networks under minimization of total WEIGHTED RESOURCE TARDINESS penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a due date for each resource such that no resource can be available before its ready date but the resources are allowed to be used after their due dates by paying penalty costs depending on the resource type. We also assume, there is only one unit available of each resource type and no activity needs more than it for execution. The goal is to find a schedule with minimal total WEIGHTED RESOURCE TARDINESS penalty costs. For this purpose, we present a hybrid metaheuristic procedure based on the greedy randomized adaptive search algorithm and PATH-RELINKING algorithm. We develop reactive and non-reactive versions of the algorithm. Also, we use different bias probability functions to make our solution procedure more efficient. The computational experiments show the reactive version of the algorithm outperforms the non-reactive version. Moreover, the bias probability functions defined based on the duration and precedence relation characteristics give better results than other bias probability functions.

Cites

No record.

References

No record.

Cite

APA: Copy

RANJBAR, M.. (2012). A HYBRID GRASP ALGORITHM FOR MINIMIZING TOTAL WEIGHTED RESOURCE TARDINESS PENALTY COSTS IN SCHEDULING OF PROJECT NETWORKS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 23(3), 231-243. SID. https://sid.ir/paper/610011/en

Vancouver: Copy

RANJBAR M.. A HYBRID GRASP ALGORITHM FOR MINIMIZING TOTAL WEIGHTED RESOURCE TARDINESS PENALTY COSTS IN SCHEDULING OF PROJECT NETWORKS. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2012;23(3):231-243. Available from: https://sid.ir/paper/610011/en

IEEE: Copy

M. RANJBAR, “A HYBRID GRASP ALGORITHM FOR MINIMIZING TOTAL WEIGHTED RESOURCE TARDINESS PENALTY COSTS IN SCHEDULING OF PROJECT NETWORKS,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 23, no. 3, pp. 231–243, 2012, [Online]. Available: https://sid.ir/paper/610011/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops