An Approach for the Teamwork Scheduling Problem with Job-person Constraint

This paper deals with the teamwork scheduling problem with job-person constraint. This problem has been posed by combining the three constraints: the jobs can split into some sub-jobs which should not be less than a threshold called splitmin’ the jobs/sub-jobs are only assigned to team members' available time windows, and the sub-jobs of the same job are assigned to only one team member. The goal aims to determine a feasible schedule with minimal completion time for all jobs. The MILP model is given to achieve the optimal goal of this problem. The proposed heuristics to determine effective solutions are the Assignment algorithm based on the FCFS rule, the Assignment algorithm based on the SPT/LPT rule, and the Simulated Annealing algorithm. The experimental results show that the Simulated Annealing algorithm achieves the best solution quality, but the time to determine the solution is longer than other algorithms.