Huo, Yumei; Leung, Joseph Y.-T. - In: European Journal of Operational Research 204 (2010) 2, pp. 229-236
We consider the problem of scheduling a set of n independent jobs on m parallel machines, where each job can only be scheduled on a subset of machines called its processing set. The machines are linearly ordered, and the processing set of job j is given by two machine indexes aj and bj; i.e.,...