Skip to main content
Article thumbnail
Location of Repository

Scheduling on a Constant Number of Machines

By F. Afratil, E. Bampis, C. Kenyon and I. Milk

Abstract

Abstract. We consider the problem of scheduling independent jobs on a constant number of machines. We illustrate two important approaches for obtaining polynomial time approximation schemes for two different variants of the problem, more precisely the multiprocessor-job and the unrelated-machines models, and two different optimization criteria: the makespan and the sum of weigthed completion times.

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.186.4277
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.brown.edu/resear... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.