The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
سال انتشار: 1386
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 359
فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_JOIE-1-1_005
تاریخ نمایه سازی: 22 آبان 1397
چکیده مقاله:
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid toproblems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project schedulingproblem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, where eachtime an activity is started after being preempted; a constant setup penalty is incurred. We propose a solution method based on a pure integerformulation for the problem. Finally, some test problems are solved with LINGO version 8 and computational results are reported
کلیدواژه ها:
نویسندگان
B. Afshar Nadjafi
Department of Industrial Engineering, Islamic Azad University of Qazvin, Qazvin, Iran
S Shadrokh
Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran