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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Bai, S., Zhang, F., Li, S., & Liu, Q. (2007). Scheduling an unbounded batch machine to minimize maximum lateness. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4613 LNCS, pp. 172–177). Springer Verlag. https://doi.org/10.1007/978-3-540-73814-5_16
Mendeley helps you to discover research relevant for your work.