Brucker, Peter; Knust, Sigrid; Oğuz, Ceyda - In: Mathematical Methods of Operations Research 63 (2006) 1, pp. 63-75
In this paper we study the single-machine problem 1|chains(l), p <Subscript> j </Subscript>=p|∑ C <Subscript> j </Subscript> in which jobs with constant processing times and generalized precedence constraints in form of chains with constant delays are given. One has to schedule the jobs on a single machine such that all delays between...</subscript></subscript>
