TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION

We consider the offline scheduling problem to minimize the makespan on m parallel and identical machines with certain features. Each job and machine are labeled with the grade of service (GoS) levels, and each job can only be executed on the machine whose GoS level is no more than that of the job. I...

Full description

Saved in:
Bibliographic Details
Published inAsia-Pacific journal of operational research Vol. 29; no. 5; p. E1
Main Authors Li, Weidong, Li, Jianping, Zhang, Tongquan
Format Journal Article
LanguageEnglish
Published Singapore World Scientific Publishing Co. Pte., Ltd 01.10.2012
Subjects
Approximation
Operations research
Scheduling
Studies
Online AccessGet full text

Cover

More Information
Summary:We consider the offline scheduling problem to minimize the makespan on m parallel and identical machines with certain features. Each job and machine are labeled with the grade of service (GoS) levels, and each job can only be executed on the machine whose GoS level is no more than that of the job. In this paper, we present an efficient polynomial-time approximation scheme (EPTAS) with running time 0(n log n) for the special case where the GoS level is either 1 or 2. This partially solves an open problem posed in (Ou et al, 2008). We also present a simpler full polynomial-time approximation scheme (FPTAS) with running time 0(n) for the case where the number of machines is fixed. [PUBLICATION ABSTRACT]
ISSN:0217-5959
0217-5959