Mathirajan, M and Sivakumar, AI and Chandru, V (2004) Scheduling algorithms for heterogeneous batch processors with incompatible job-families. In: Journal Of Inteligent Manufacturing, 15 (6). pp. 787-803.
81.pdf - Published Version
Restricted to Registered users only
Download (495Kb) | Request a copy
We consider the problem of scheduling heterogeneous batch processors (i.e., batch processors with different capacity) with incompatible job-families and non-identical job sizes to maximize the utilization of the batch processors. We analyzed the computational complexity of this problem and showed that it is NP-hard and proposed eight variants of a fast greedy heuristic. A series of computational experiments were carried out to compare the performance of the heuristics and showed that the heuristics are capable of consistently obtaining near (estimated) optimal solutions with very low-computational burden for large-scale problems. We also carried out a study to find the effect of family processing time changes on the performance of the heuristics. This sensitivity analysis indicated that the processing time set of job-families influences the performance of the heuristic algorithms.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Kluwer Academic Publishers.|
|Keywords:||heterogeneous batch processors;incompatible job-families;non-identical job-sizes;heuristics;scheduling.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||19 Dec 2008 15:22|
|Last Modified:||19 Sep 2010 04:56|
Actions (login required)