Ahr, Dino; Békési, József; Galambos, Gábor; Oswald, … - In: Mathematical Methods of Operations Research 59 (2004) 2, pp. 193-203
The coupled task problem is to schedule n jobs on one machine where each job consists of two subtasks with required delay time between them. The objective is to minimize the makespan. This problem was analyzed in depth by Orman and Potts [3]. They investigated the complexity of different cases...
