A branch-and-bound algorithm for the coupled task problem
- First Online:
- Cite this article as:
- Békési, J., Galambos, G., Jung, M.N. et al. Math Meth Oper Res (2014) 80: 47. doi:10.1007/s00186-014-0469-6
- 201 Downloads
The coupled task problem is to schedule jobs on a single machine where each job consists of two subtasks and where the second subtask has to be started after a given time interval with respect to the first one. The problem has several applications and is NP-hard. In this paper we present a branch-and-bound algorithm for this problem and compare its performance with four integer programming models.