Abstract
We consider the problem of scheduling n jobs with release times on an unbounded batch machine to minimize the maximum lateness. An unbounded batch machine is a machine that can process up to b (b ≥ n) jobs simultaneously. The jobs that are processed together form a batch, and all jobs in a batch start and complete at the same time. The processing time of a batch is the time required for processing the longest job in the batch. We present a linear time approximation scheme for this problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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. In: The Proceeding of the 40th Annual Symposium on Foundations of Computer Science, New York, pp. 32–43 (October 1999)
Brucker, P., Gladky, A., Hoogeveen, H., Kovalyvov, M.Y., Potts, C.N., Tautenhahn, T., van de Velde, S.L.: Scheduling a batching machine. Journal of Scheduling 1, 31–54 (1998)
Cheng, T.C.E., Liu, Z., Yu, W.: Scheduling jobs with release dates and deadlines on a batch processing machine. IIE Transactions 33, 685–690 (2001)
Deng, X., Feng, H., Zhang, P., Zhao, H.: A polynomial time approximation scheme for minimizing total completion time of unbounded batch scheduling. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 26–35. Springer, Heidelberg (2001)
Deng, X., Zhang, Y.: Minimizing mean response time in batch processing system. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol. 1627, pp. 231–240. Springer, Heidelberg (1999)
Hall, L.A., Shmoys, D.B.: Approximation schemes for constrained scheduling problems. In: Proceedings of the 30th annual IEEE Symposium on Foundations of Computer Science, pp. 134–139. IEEE Computer Society Press, Los Alamitos (1989)
Kise, H., Ibaraki, T., Mine, H.: Performance analysis of six approximation algorithms for the one-machine maximum lateness scheduling problem with ready times. Journal of the Operations Research Society of Japan 22, 205–224 (1979)
Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B.: Sequencing and scheduling: algorithms and complexity. In: Graves, S.C., Kan, A.H.G.R., Zipkin, P.H. (eds.) Handbooks in Operations Research and Management Science. Logistics of Production and Inventory, vol. 4, pp. 445–522. North-Holland, Amsterdam (1993)
Lee, C Y., Uzsoy, R., Martin, L.A.: Vega, Efficient algorithms for scheduling semiconductor burn-in operations. Operations Research 40, 764–775 (1992)
Liu, Z., Yuan, J., Cheng, T.C.E.: On scheduling an unbounded batch machine. Operations Research Letters 31, 42–48 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bai, S., Zhang, F., Li, S., Liu, Q. (2007). Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness. In: Preparata, F.P., Fang, Q. (eds) Frontiers in Algorithmics. FAW 2007. Lecture Notes in Computer Science, vol 4613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73814-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-73814-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73813-8
Online ISBN: 978-3-540-73814-5
eBook Packages: Computer ScienceComputer Science (R0)