An efficient hybrid method for the Coupled-Tasks Scheduling Problem

This article addresses the CTSP (Coupled-Tasks Scheduling Problem), where a set of tasks, divided into two parts, needs to be scheduled as early as possible. The scheduling of the two parts needs to be done so that there is a fixed time interval between them. A new hybrid method was proposed that uses Constraint Programming modeling and a heuristic procedure for generating time windows for task execution. The computational results showed that the method presents good robustness and also manages to surpass several of the best results in the literature.