A branch-and-bound algorithm for the coupled task problem
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.
KeywordsCoupled task problem Branch-and-bound Integer programming
We would like to thank two anonymous referees for very helpful and extensive comments and suggestions. They improved this paper considerably.
- Li H, Zhao H (2007) Scheduling coupled-tasks on a single machine. In: IEEE symposium on computational intelligence in scheduling SCIS ’07, pp 137–142Google Scholar
- Tanas M, Blazewicz J, Ecker K (2007) Polynomial time algorithm for coupled tasks scheduling problem. In: Blazewicz J, Ecker K, Hammer B (eds) ICOLE 2007. Lessach, Austria. Report IfI-07-03, TU Clausthal, pp 76–69Google Scholar