Scheduling parallel batch processors with incompatible job families to minimise weighted completion time

M. Venkataramana and N.R. Srinivasa Raghavan

International Journal of Industrial and Systems Engineering, 2009, vol. 4, issue 1, 76-93

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. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=21689 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijisen:v:4:y:2009:i:1:p:76-93

Access Statistics for this article

More articles in International Journal of Industrial and Systems Engineering from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().