May 28, 2004 - Computers & Operations Research 32 (2005) 2731â2750 ... Therefore, this research proposes two heuristic approaches that lead to good.
Computers & Operations Research 32 (2005) 2731 – 2750
www.elsevier.com/locate/dsw
Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times Lars M*oncha;∗ , Hari Balasubramanianb , John W. Fowlerb , Michele E. Pfundb a
Institute of Information Systems, Technical University of Ilmenau, 98684 Ilmenau, Germany b Department of Industrial Engineering, Arizona State University, Tempe, AZ 85287, USA Available online 28 May 2004
Abstract This research is motivated by a scheduling problem found in the di6usion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two di6erent decomposition approaches. The
