%0 Journal Article
%T The preemptive resource-constrained project scheduling problem subject
to due dates and preemption penalties: An integer programming approach
%J Journal of Optimization in Industrial Engineering
%I QIAU
%Z 2251-9904
%A Afshar nadjafi, Behrouz
%A Shadrokh, Shahram
%D 2010
%\ 02/07/2010
%V Volume 1
%N Issue 1
%P 35-39
%! The preemptive resource-constrained project scheduling problem subject
to due dates and preemption penalties: An integer programming approach
%K Earliness-tardiness cost
%K Preemptive scheduling
%K Project Scheduling
%K Resource Constrained
%R
%X 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.
%U http://www.qjie.ir/article_14_846417eb65dd68706956fec9347821e7.pdf