The preemptive resource-constrained project scheduling problem subjectto due dates and preemption penalties: An integer programming approach
محورهای موضوعی : Design of Experiment
Behrouz Afshar nadjafi
1
(Department of Industrial Engineering, Islamic Azad University of Qazvin, Qazvin, Iran,)
Shahram Shadrokh
2
(Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran,)
کلید واژه: Project Scheduling, Resource Constrained, Preemptive scheduling, Earliness-tardiness cost,
چکیده مقاله :
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.
