Affordable Access

Publisher Website

An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan

Authors
Journal
Information Processing Letters
0020-0190
Publisher
Elsevier
Publication Date
Volume
108
Issue
4
Identifiers
DOI: 10.1016/j.ipl.2008.04.021
Keywords
  • Scheduling
  • Eligibility
  • Grade Of Service
  • Makespan

Abstract

Abstract We consider the m parallel-machine scheduling problem that process service requests from various customers who are entitled to different levels of grade of service (GoS). The objective is to minimize the makespan. We give a fully polynomial-time approximation scheme for the case where m is fixed.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

A comment on parallel-machine scheduling under a g...

on Information Processing Letters Jan 01, 2009

Parallel machine scheduling under a grade of servi...

on Computers & Operations Researc... Jan 01, 2004

Optimal semi-online scheduling algorithms on two p...

on International Journal of Produ... Jan 01, 2012

Online scheduling on unbounded parallel-batch mach...

on Information Processing Letters Jan 01, 2009
More articles like this..