Approximation Algorithms in Batch Processing

  • Xiaotie Deng
  • Chung Keung Poon
  • Yuzhong Zhang
Conference paper

DOI: 10.1007/3-540-46632-0_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1741)
Cite this paper as:
Deng X., Poon C.K., Zhang Y. (1999) Approximation Algorithms in Batch Processing. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg

Abstract

We study the scheduling of a set of jobs, each characterised by a release (arrival) time and a processing time, for a batch processing machine capable of running (at most) a fixed number of jobs at a time. When the job release times and processing times are known a-priori and the inputs are integers, we obtained an algorithm for finding a schedule with the minimum makespan. The running time is pseudo-polynomial when the number of distinct job release times is constant. We also ob- tained a fully polynomial time approximation scheme when the number of distinct job release times is constant, and a polynomial time approxi- mation scheme when that number is arbitrary. When nothing is known about a job until it arrives, i.e., the on-line setting, we proved a lower bound of \( (\sqrt 5 + 1)/2 \) on the competitive ratio of any approximation al- gorithm. This bound is tight when the machine capacity is unbounded.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Xiaotie Deng
    • 1
  • Chung Keung Poon
    • 1
  • Yuzhong Zhang
    • 2
  1. 1.Department of Computer ScienceCity University of Hong KongHong KongChina
  2. 2.Institute of Operations ResearchQufu Normal UniversityQufuChina

Personalised recommendations