Abstract
The multiple orders per job (MOJ) scheduling problem is presented for the batch-processing environment such as that exemplified by diffusion ovens. A mixed-integer programming formulation is presented for the incompatible job family case wherein only jobs that belong to the same family may be grouped together in a production batch. This optimization formulation is tested through an extensive experimental design with the objective of minimizing total weighted tardiness (maximizing on-time delivery performance). Optimal solutions are achievable for this initial set of 6-to-12 order problems, but it is noted that the optimization model takes an unreasonable amount of computation time, which suggests the need for heuristic development to support the analysis of larger, more practical MOJ batch scheduling problems. A number of simple heuristic approaches are investigated in an attempt to find near-optimal solutions in a reasonable amount of computation time. It is seen that a combination of the heuristics produces near-optimal solutions for small order problems. Further testing proves that these heuristic combinations are the best for large order problems as well.
Similar content being viewed by others
References
Ahmadi, J. H., Ahmadi, R. H., Dasu, S., & Tang, C. S. (1992). Batching and scheduling jobs on batch and discrete processors. Operations Research, 40, 750–763.
Dobson, G., & Nambimadom, R. S. (2001). The batch loading and scheduling problem. Operations Research, 49, 52–65.
Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling theory: A survey. Annals of Discrete Mathematics, 5, 287–326.
Mason, S. J., Fowler, J. W., & Carlyle, W. M. (2002). A modified shifting bottleneck heuristic for minimizing the total weighted tardiness. Journal of Scheduling, 5, 247–262.
Mason, S. J., Qu, P., Kutanoglu, E., & Fowler, J. W. (2005, in review). The single machine multiple orders per job scheduling problem. IIE Transactions.
Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on batch processing machine with incompatible job families. IIE Transactions, 30, 165–178.
Qu, P. (2004). The multiple orders per job scheduling problems. Ph.D. dissertation, University of Arkansas, Fayetteville, AR.
Uzsoy, R. (1994). Scheduling a single batch processing machine with non-identical job sizes. International Journal of Production Research, 32, 1615–1635.
Uzsoy, R. (1995). Scheduling batch processing machines with incompatible job families. International Journal of Production Research, 33, 2685–2708.
Uzsoy, R., Lee, C. Y., & Martin-Vega, L. A. (1992). 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, 47–59.
Vepsalainen, A., & Morton, T. (1987). Priority rules for job shops with weighted tardiness cost. Management Science, 33(8), 1035–1047.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Erramilli, V., Mason, S.J. Multiple orders per job batch scheduling with incompatible jobs. Ann Oper Res 159, 245–260 (2008). https://doi.org/10.1007/s10479-007-0286-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0286-x