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

Min Ji; Edwin Tai Chiu Cheng

doi:10.1016/j.ipl.2008.04.021

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

Min Ji
, Edwin Tai Chiu Cheng

Research output: Journal article publication › Journal article › Academic research › peer-review

30 Citations (Scopus)

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.

Original language	English
Pages (from-to)	171-174
Number of pages	4
Journal	Information Processing Letters
Volume	108
Issue number	4
DOIs	https://doi.org/10.1016/j.ipl.2008.04.021
Publication status	Published - 31 Oct 2008

Keywords

Eligibility
Grade of service
Makespan
Scheduling

ASJC Scopus subject areas

Computational Theory and Mathematics

More information

10.1016/j.ipl.2008.04.021

http://hdl.handle.net/10397/476

Cite this

@article{7d586ca4dcab437e9865b3dca0f8ca9f,

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

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.",

keywords = "Eligibility, Grade of service, Makespan, Scheduling",

author = "Min Ji and Cheng, \{Edwin Tai Chiu\}",

year = "2008",

month = oct,

day = "31",

doi = "10.1016/j.ipl.2008.04.021",

language = "English",

volume = "108",

pages = "171--174",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

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

AU - Ji, Min

AU - Cheng, Edwin Tai Chiu

PY - 2008/10/31

Y1 - 2008/10/31

N2 - 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.

AB - 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.

KW - Eligibility

KW - Grade of service

KW - Makespan

KW - Scheduling

UR - https://www.scopus.com/pages/publications/52049106371

U2 - 10.1016/j.ipl.2008.04.021

DO - 10.1016/j.ipl.2008.04.021

M3 - Journal article

SN - 0020-0190

VL - 108

SP - 171

EP - 174

JO - Information Processing Letters

JF - Information Processing Letters

IS - 4

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this