Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Azizoglu, M. and Webster, S. (2001) Scheduling a batch processing machine with incompatible job families. Computers and Industrial Engineering, 39, 325–335.
Azizoglu, M. and Webster, S. (2000) Scheduling a batch processing machine with non-identical job-sizes. International Journal of Production Research, 38(10),2173–2184.
Chambers, R. J., Carraway, R. L., Lowe, T. J. and Morin, T. L. (1991) Dominance and decomposition heuristics for single machine scheduling. Operations Research, 39 , 639–647.
Chandru, Y., Lee, C.-Y. and Uzsoy, R. (1993) Minimizing total completion time on a batch-processing machine. International Journal of Production Research, 31(9), 2097–2121.
Dobson, G. and Nambimadom, R. S. (1994) The batch loading and scheduling problem. Working Paper No. QM 92–03, Simon School of Business Administration, University of Rochestor, Rochestor, N.Y., U.S.A.
Dobson, G. and Nambimadom, R. S. (2001) The batch loading and scheduling problem. Operations Research, 49(1),52–65.
Devpura, A., Fowler, J. W., Carlyle, M. W. and Perez, I. (2000) Minimizing total weighted tardiness on single batch process machine with incompatible job families. http://www.uni-duisburg.de/FB5/B WL/WI/or2000/ sektion10/fowler.pdf.
Fanti, M. P., Maione, B., Piscitelli, G. and Turchiano, B. (1996) Heuristic scheduling of jobs on a multi-product batch-processing machine. International Journal of Production Research, 34(8), 2163–2186.
Hung, Yi-Feng. (1998) Scheduling of mask shop E-beam writers. IEEE Transactions on Semiconductor Manufacturing, 11(1), 165–172.
Kempf. K. G., Uzsoy, R. and Wang C. S. (1998) Scheduling a single batch processing machine with secondary resource constraints. Journal of Manufacturing Systems, 17(1),37–51.
Kim, H.-U., Kim, Y.-D. and Kim, J.-G. (2000) Batching and scheduling at a batch processing workstation in a semiconductor fabrication facility producing multiple product types with distinct due dates. Proceedings of the International Conference on Modeling and Analysis of Semiconductor Manufacturing, pp. 151–156.
Mathirajan, M., Sivakumar, A. I. (2003) Scheduling batch processors in semiconductor manufacturing—A review. Proceedings of Singapore MIT Alliance (SMA)—2003 Symposium, National University of Singapore, Singapore, https://dspace.mit.edu/handle/ 1721.1/3755.
Mehta, S.V. and Uzsoy, R. (1998) Minimizing total tardiness on a batch-processing machine with incompatible job families. IIE Transactions, 30, 165–178.
Neuts, M. F. (1967) A general class of bulk queues with Poisson input. Annals of Mathematical Statistics, 38 , 759–770.
Rardin, R. L. and Uzsoy, R. (2001). Experimental evaluation of heuristic optimization algorithms: A tutorial. Journal of Heuristics, 7(3), 261–304.
Shekar, G. L. (1998) Planning and scheduling systems for steel casting production—A new paradigm, Ph.D. Dissertation, Department of Management Studies, Indian Institute of Science, Bangalore, India.
Uzsoy, R. (1995) Scheduling batch processing machine with incompatible job-families. International Journal of Production Research, 33(10), 2685–2708.
Uzsoy, R., Lee, C.-Y. and Martin-Vega, L. A. (1992) Scheduling semiconductor test operations: minimizing maximum lateness and number of tardy jobs on a single machine. Naval Research Logistics, 39, 369–388.
Vepsalainen, A. and Morton, T. E. (1987) Priority rules and lead-time estimation for job-shop scheduling with weighted tardiness costs. Management Science, 33(8), 1035–1047.
Zee, D. J., Van Harten, A. and Schuur, P. C. (1997) Dynamic job assignment heuristics for multi-server batch operations—a cost based approach. International Journal of Production Research, 35(11), 3063–3093.
Zee, D. J. van der, Van Harten, A. and Schuur, P. C. (2001) Online scheduling of multi-server batch operations, IIE Transactions, 33, 569–586.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mathirajan, M., Sivakumar, A.I. & Chandru, V. Scheduling algorithms for heterogeneous batch processors with incompatible job-families. Journal of Intelligent Manufacturing 15, 787–803 (2004). https://doi.org/10.1023/B:JIMS.0000042664.94495.26
Issue Date:
DOI: https://doi.org/10.1023/B:JIMS.0000042664.94495.26