Mixed integer formulation to minimize makespan in a flow shop with batch processing machines. (English) Zbl 1099.90018
Summary: Batch processing machines are commonly used in wafer fabrication, kilns, and chambers used for environmental stress screening (ESS). This paper proposes two models to schedule batches of jobs on two machines in a flow shop. A set of jobs with known processing times and sizes has to be grouped, to form batches, in order to be processed on the batch processing machines. The jobs are nonidentical in size. The processing time of a batch is the longest processing time of all the jobs in that batch. Mixed integer formulations are proposed for the flow shop problem when the buffer capacity is unlimited or zero. Numerical examples are presented to demonstrate the application of our model.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
| 90C35 | Programming involving graphs or networks |
References:
| [1] | Pinedo, M., Scheduling: Theory Algorithms and Systems (1995), Prentice Hall: Prentice Hall Taipei, Taiwan, ROC · Zbl 1145.90393 |
| [2] | Potts, C. N.; Kovalyov, M. Y., Scheduling with batching, European Journal of Operational Research, 120, 228-249 (2000) · Zbl 0953.90028 |
| [3] | Chandru, V.; Lee, C-Y.; Uzsoy, R., Minimizing total completion time on a batch processing machine with job families, Operations Research Letters, 13, 61-65 (1993) · Zbl 0771.90054 |
| [4] | Uzsoy, R., Scheduling a single batch processing machine with non-identical job sizes, International Journal of Production Research, 32, 7, 1615-1635 (1994) · Zbl 0906.90095 |
| [5] | Hochbaum, D. S.; Landy, D., Scheduling semiconductor burn-in operations to minimize total flow time, Operations Research, 45, 6, 874-885 (1997) · Zbl 0895.90116 |
| [6] | Li, C-L.; Lee, C-Y., Scheduling with agreeable release times and due dates on a batch processing machine, European Journal of Operational Research, 96, 564-569 (1997) · Zbl 0929.90038 |
| [7] | Ghazvini, F. J.; Dupont, L., Minimizing mean flow times criteria on a single batch processing machine with non-identical jobs sizes, International Journal of Production Economics, 55, 273-280 (1998) |
| [8] | Danneberg, D.; Tautenhahn, T.; Werner, F., A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size, Mathl. Comput. Modelling, 29, 9, 101-126 (1999) · Zbl 0987.90032 |
| [9] | Sung, C. S.; Choung, Y. I., Minimizing makespan on a single burn-in overn in semiconductor manufacturing, European Journal of Operational Research, 120, 559-574 (2000) · Zbl 0971.90033 |
| [10] | S. Melouk, P. Damodaran and P. Chang, Minimizing makespan for a single machine batch processing with non-identical job sizes using simulated annealing, International Journal of Production Economics; S. Melouk, P. Damodaran and P. Chang, Minimizing makespan for a single machine batch processing with non-identical job sizes using simulated annealing, International Journal of Production Economics |
| [11] | Ikura, Y.; Gimple, M., Scheduling algorithms for a single batch processing machine, Operations Research Letters, 5, 61-65 (1986) · Zbl 0594.90045 |
| [12] | Sung, C. S.; Yoon, S. H., Minimizing maximum completion time in a two-batch processing-machine flowshop with dynamic arrivals allowed, Engineering Optimization, 28, 231-243 (1997) |
| [13] | Sung, C. S.; Kim, Y. H.; Koon, S. H., A problem reduction and decomposition approach for scheduling a flowshop of batch processing machines, European Journal of Operational Research, 121, 179-192 (2000) · Zbl 0953.90030 |
| [14] | L. Su, A hybrid two-stage flowshop with limited waiting time constraints, Computers and Industrial Engineering; L. Su, A hybrid two-stage flowshop with limited waiting time constraints, Computers and Industrial Engineering |
| [15] | Kindt, V. T.; Gupta, J. N.D.; Billaut, J., Two-machine flowshop scheduling with a secondary criterion, Computers and Operations Research, 30, 505-526 (2003) · Zbl 1026.90044 |
| [16] | Ahmadi, J. H.; Ahmadi, R. H.; Dasu, S.; Tang, C. S., Batching and scheduling jobs on batch and discrete processors, Operations Research, 39, 4, 750-763 (1992) · Zbl 0758.90042 |
| [17] | Sung, C. S.; Kim, Y. H., Minimizing due date related performance measures on two batch processing machines, European Journal of Operational Research, 147, 644-656 (2003) · Zbl 1026.90043 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
