Scheduling parallel batch processors with incompatible job families to minimise weighted completion time
by M. Venkataramana, N.R. Srinivasa Raghavan
International Journal of Industrial and Systems Engineering (IJISE), Vol. 4, No. 1, 2009

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.

Online publication date: Sun, 30-Nov-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com