Preemptive multi-skilled resource constrained project scheduling problem with hard/soft interval due dates

¹ Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
² Department of Industrial Engineering, Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran
³ Department of Industrial Engineering, Sharif University of Technology, Tehran, Iran

^* Corresponding author: afsharnb@alum.sharif.edu

Received: 13 August 2017
Accepted: 13 November 2018

Abstract

This paper considers a preemptive multi-skilled resource constrained project scheduling problem in a just-in-time environment where each activity has an interval due date to be completed. In this problem setting, resuming a preempted activity requires an extra setup cost, while each time unit violation from the given due date incurs earliness or tardiness penalty. Also, processing cost of each skill to execute any activity depends on the assigned staff member to accomplish the skill. The objective function of the model aims to minimize the total cost of allocating staff to skills, earliness–tardiness penalties and preemption costs. Two integer formulations are proposed for the model which are compared in terms of number of variables, constraints and elapsed run-time to optimality. Furthermore, an ant colony based metaheuristic is developed to tackle real life scales of the proposed model. This algorithm relies on two intelligent local search heuristics. Parameters of the algorithm are calibrated using Taguchi method. The results of the experiments for the proposed algorithm confirm that the proposed algorithm has satisfying performance.