Bäuerle, Nicole; Brüstl, Gabi; Rieder, Ulrich - In: Computational Statistics 48 (1998) 3, pp. 337-347
We consider a two-station network with two types of jobs: type 0 jobs require service at station 1 only and type 1 jobs require service both at station 1 and 2 in sequence. Each station has a single server. The problem is to schedule the server at station 1 between the two types of jobs in order...