Parallel machine scheduling with release time and machine eligibility restrictions
We present an algorithm for the problem of minimizing maximum lateness in a parallel machine environment with release dates and machine eligibility restrictions (Pm\r(j),M-j\L-max) for the special case where due dates are equal to release dates plus a constant. No preemption of jobs is allowed. The algorithm has been evaluated using real data from an operational environment of a semiconductor manufacturing firm. Comparison is also made with the actual scheduling system being used by the organization. (C) 1997 Elsevier Science Ltd.
parallel machine scheduling machine eligibility lateness semiconductor manufacturing