Title: Scheduling parallel batch processors with incompatible job families to minimise weighted completion time
Author: M. Venkataramana, N.R. Srinivasa Raghavan
Decision Sciences Lab, Department of Management Studies, Indian Institute of Science, Bangalore-560012, India.
GM R&D and Strategic Planning, India Science Lab, Bangalore-560066, India
Abstract: We consider the static scheduling of jobs to parallel identical batch processors with incompatible job families by minimising the total weighted completion time. This scheduling problem is applicable in many practical systems such as burn-in operations and wafer fabrication in semiconductor manufacturing. The scheduling problem is formulated as a mixed integer non-linear program. We develop the solution framework based on decomposition approach for the problems with realistic settings. Two heuristics are proposed based on the proposed decomposition approach and the performance of these heuristics is evaluated in the case of two and three batch processors.
Keywords: scheduling; batch processing; parallel proccessing; total weighted completion time; job family incompatibility; job families; MINLP; burn-in operations; wafer fabrication; semiconductor manufacturing; mixed integer nonlinear programming.
Int. J. of Industrial and Systems Engineering, 2009 Vol.4, No.1, pp.76 - 93
Available online: 30 Nov 2008