THE PREEMPTIVE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM SUBJECT TO DUE DATES AND PREEMPTION PENALTIES: AN INTEGER PROGRAMMING APPROACH

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 B.; SHADROKH S.

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:2008 | Volume:1 | Issue:PRE. NO. 1 Page(s): 35-39

Download Full-Text

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

Persian Verion

View:

841

Download:

176

Cites:

Information Journal Paper

Title

THE PREEMPTIVE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM SUBJECT TO DUE DATES AND PREEMPTION PENALTIES: AN INTEGER PROGRAMMING APPROACH

Author(s)

AFSHAR NADJAFI B. | SHADROKH S. | Issue Writer Certificate

Keywords

PROJECT SCHEDULINGQ4

RESOURCE CONSTRAINEDQ4

PREEMPTIVE SCHEDULINGQ4

EARLINESS-TARDINESS COSTQ4

Abstract

Extensive research has been devoted to RESOURCE CONSTRAINED PROJECT SCHEDULING problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the PROJECT SCHEDULING problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, where each time an activity is started after being preempted, a constant setup penalty is incurred. We propose a solution method based on a pure integer formulation for the problem. Finally, some test problems are solved with LINGO version 8 and computational results are reported.

Cites

No record.

References

No record.

Cite

APA: Copy

AFSHAR NADJAFI, B., & SHADROKH, S.. (2008). THE PREEMPTIVE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM SUBJECT TO DUE DATES AND PREEMPTION PENALTIES: AN INTEGER PROGRAMMING APPROACH. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), 1(PRE. NO. 1), 35-39. SID. https://sid.ir/paper/205922/en

Vancouver: Copy

AFSHAR NADJAFI B., SHADROKH S.. THE PREEMPTIVE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM SUBJECT TO DUE DATES AND PREEMPTION PENALTIES: AN INTEGER PROGRAMMING APPROACH. JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING)[Internet]. 2008;1(PRE. NO. 1):35-39. Available from: https://sid.ir/paper/205922/en

IEEE: Copy

B. AFSHAR NADJAFI, and S. SHADROKH, “THE PREEMPTIVE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM SUBJECT TO DUE DATES AND PREEMPTION PENALTIES: AN INTEGER PROGRAMMING APPROACH,” JOURNAL OF OPTIMIZATION IN INDUSTRIAL ENGINEERING (JOURNAL OF INDUSTRIAL ENGINEERING), vol. 1, no. PRE. NO. 1, pp. 35–39, 2008, [Online]. Available: https://sid.ir/paper/205922/en

Related Journal Papers