We tackle the makespan minimization coupledtasksproblem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and id...
详细信息
ISBN:
(纸本)9781479967735
We tackle the makespan minimization coupledtasksproblem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.
暂无评论