The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach

Journal of Optimization in Industrial Engineering

مقاله 5، Volume 1، Issue 1، مرداد 2008، صفحه 35-39   

نویسندگان

Behrouz Afshar nadjafi¹؛ Shahram Shadrokh²

¹Department of Industrial Engineering, Islamic Azad University of Qazvin, Qazvin, Iran,

²Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran,

چکیده

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.

کلیدواژه‌ها

Earliness-tardiness cost؛ Preemptive scheduling؛ Project Scheduling؛ Resource Constrained