×

Minimizing makespan with release times on identical parallel batching machines. (English) Zbl 1066.90033

Summary: We consider the problem of scheduling \(n\) jobs on \(m\) identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to \(B\) \((B<n)\) jobs as a batch simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The objective is to minimize the maximum completion time (makespan). We present a polynomial time approximation scheme (PTAS) for this problem.

MSC:

90B35 Deterministic scheduling theory in operations research
90C05 Linear programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Afrati, F.; Bampis, E.; Chekuri, C.; Karger, D.; Kenyon, C.; Khanna, S.; Milis, I.; Queyranne, M.; Skutella, M.; Stein, C.; Sviridenko, M., Approximation schemes for minimizing average weighted completion time with release dates, (Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, New York (1999)), 32-43
[2] Brucker, P.; Gladky, A.; Hoogeveen, H.; Kovalyvov, M. Y.; Potts, C. N.; Tautenhahn, T.; van de Velde, S. L., Scheduling a batching machine, J. Scheduling, 1, 31-54 (1998) · Zbl 0909.90172
[3] X. Deng, H.D. Feng, G.J. Li, A PTAS for semiconductor burn-in scheduling, J. Comb. Optim., to appear.; X. Deng, H.D. Feng, G.J. Li, A PTAS for semiconductor burn-in scheduling, J. Comb. Optim., to appear. · Zbl 1066.90141
[4] X. Deng, C.K. Poon, Y. Zhang, Approximation algorithms in batch processing, in: The Eighth Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, vol. 1741, Springer, Chennai, India, 1999, pp. 153-162.; X. Deng, C.K. Poon, Y. Zhang, Approximation algorithms in batch processing, in: The Eighth Annual International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, vol. 1741, Springer, Chennai, India, 1999, pp. 153-162. · Zbl 0970.68619
[5] Graham, R. L., Bounds for certain multiprocessor anomalies, Bell System Technical Journal, 45, 1563-1581 (1966) · Zbl 0168.40703
[6] Graham, R. L.; Lawler; Lenstra, J. K.; Rinnooy Kan, A. H.G., Optimization and approximation in deterministic sequencing and schedulinga survey, Ann. Discrete Math., 5, 287-326 (1979) · Zbl 0411.90044
[7] Hall, L. A.; Shmoys, D. B., Approximation schemes for constrained scheduling problems, (Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (1989)), 134-139
[8] Lee, C. Y.; Uzsoy, R., Minimizing makespan on a single batch processing machine with dynamic job arrivals, Internat. J. Prod. Res., 37, 219-236 (1999) · Zbl 0939.90537
[9] Lee, C. Y.; Uzsoy, R.; Martin Vega, L. A., Efficient algorithms for scheduling semiconductor burn-in operations, Oper. Res., 40, 764-775 (1992) · Zbl 0759.90046
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.