Study on Parallel Machine Scheduling Problem with Buffer

  • Authors:

  • Shisheng Li;Yinghua Zhou;Guangzhong Sun;Guoliang Chen

  • Affiliations:

  • -;-;-;-

  • Venue:
  • IMSCCS '07 Proceedings of the Second International Multi-Symposiums on Computer and Computational Sciences
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In [1] and [2] the authors investigate a semi on-line ver- sion of a classical parallel machine scheduling problem. In the semi on-line version, there is a buffer of length k which is available to maintain k jobs. The jobs arrive one by one and can be temporarily assigned to the buffer if the buffer is not full. The goal is to assign all jobs to m identical machines such that the makespan is minimized. For two machines, [1] presented a lower bound 43 of the worst-case ratio and [2] presented an optimal algorithm with a buffer of length 1. In this paper, we investigate the problem with m 2 machines. First, we design a new algorithm for Pm//Cmax with a buffer of length m2 and analyze it. Sec- ond, we present some lower bounds of the worst-case ratio.