Abstract
We consider the control of a single batch processing machine with random processing times and incompatible job families (jobs from different families cannot be processed together in the same batch). Holding costs are incurred for each unit of time that a job waits in the system before being served, and the objective is to minimize the long-run average cost per unit time. We first determine optimal policies for the static problem where all jobs are available simultaneously. We next characterize the optimal policies for certain problems with dynamic arrivals of jobs under the restriction that the machine is not allowed to idle. Finally, we develop a simple heuristic scheduling policy to control the machine. Simulation results are provided to demonstrate the effectiveness of our heuristic over a wide range of problem instances and to compare its performance with existing heuristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Barnett and D.J. Kleitman, Some optimization problems with bulk-service queues, Studies in Applied Mathematics 58(1978)277–290.
V. Chandru, C.Y. Lee and R. Uzsoy, Minimizing total completion time on batch processing machines, International Journal of Production Research 31(1993) 2092–2121.
R.K. Deb and R.F. Serfozo, Optimal control of batch service queues, Advances in Applied Probability 5(1973)340–361.
J.W. Fowler, D.T. Phillips and G.L. Hogg, Real-time control of multiproduct bulk-service semiconductor manufacturing processes, IEEE Transactions on Semiconductor Manufacturing 5(1992) 158–163.
C.R. Glassey and W.W. Weng, Dynamic batching heuristic for simultaneous processing, IEEE Transactions on Semiconductor Manufacturing 4(1991)77–82.
H. Gurnani, R. Anupindi and R. Akella, Control of batch processing systems in semiconductor wafer fabrication facilities, IEEE Transactions on Semiconductor Manufacturing 5(1992)319–328.
O. Hernandez-Lerma, Adaptive Markov Control Processes, Springer, New York, 1989.
Y. Ikura and M. Gimple, Efficient scheduling algorithms for a single batch processing machine, Operations Research Letters 5(1986)61–65.
C.Y. Lee, R. Uzsoy and L.A. Martin-Vega, Efficient algorithms for scheduling batch processing machines, Operations Research 40(1992)764–775.
V. Makis, Optimal control of a batch service queueing system with bounded waiting time, Kybernetika 21(1985)262–271
M.F. Neuts, A general class of bulk queues with Poisson input, Annals of Mathematical Statistics 38(1967)759–770.
M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliffs, NJ, 1995.
W. Powell and P. Humblet, The bulk service queue with a general control strategy: Theoretical analysis and a new computational procedure, Operations Research 34(1986)267–275.
H.C. Tijms, Stochastic Modelling and Analysis: A Computational Approach, Wiley, New York, 1986.
R. Uzsoy, Scheduling batch processing machines with incompatible job families, Research Memorandum 94-3, School of Industrial Engineering, Purdue University, West Lafayette, IN 47907-1287, 1994.
R. Uzsoy, C.Y. Lee and L.A. Martin-Vega, A review of production planning and scheduling models in the semiconductor industry, Part I: System characteristics, performance evaluation and production planning, IIE Transactions on Scheduling and Logistics 24(1992)47–61.
R. Uzsoy, C.Y. Lee and L.A. Martin-Vega, A review of production planning and scheduling models in the semiconductor industry, Part II: Shop floor control, IIE Transactions on Scheduling and Logistics 26(1994)44–55.
W.W. Weng and R.C. Leachman, An improved methodology for real-time production decisions at batch-process work stations, IEEE Transactions on Semiconductor Manufacturing 6(1993)219–225.
R.W. Wolff, Stochastic Modeling and the Theory of Queues, Prentice-Hall, Englewood Cliffs, NJ, 1989.
Rights and permissions
About this article
Cite this article
Duenyas, I., Neale, J.J. Stochastic scheduling of a batch processing machine with incompatible job families. Annals of Operations Research 70, 191–220 (1997). https://doi.org/10.1023/A:1018922104670
Issue Date:
DOI: https://doi.org/10.1023/A:1018922104670