Parallel machine scheduling under a grade of service provision

Hark Chin Hwang; Soo Y. Chang; Kangbok Lee

doi:10.1016/S0305-0548(03)00164-3

Parallel machine scheduling under a grade of service provision

Hark Chin Hwang
, Soo Y. Chang
, Kangbok Lee

Research output: Contribution to journal › Article › peer-review

102 Citations (Scopus)

Abstract

We consider the problem of scheduling parallel machines that process service requests from various customers who are entitled to many different grade of service (GoS) levels. We propose and analyze one simple way to ensure such differentiated service. In particular, we investigate how the longest processing time first algorithm (LPT) would perform in the worst case and show that a slight modification of LPT could significantly improve its worst-case performance.

Original language	English
Pages (from-to)	2055-2061
Number of pages	7
Journal	Computers and Operations Research
Volume	31
Issue number	12
DOIs	https://doi.org/10.1016/S0305-0548(03)00164-3
Publication status	Published - Oct 2004

Bibliographical note

Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.

Keywords

Eligibility
Grade of service
Longest processing time first
Parallel machine scheduling

Access to Document

10.1016/S0305-0548(03)00164-3

Cite this

@article{b1ec68b2e9184070a5cab8595581c27a,

title = "Parallel machine scheduling under a grade of service provision",

abstract = "We consider the problem of scheduling parallel machines that process service requests from various customers who are entitled to many different grade of service (GoS) levels. We propose and analyze one simple way to ensure such differentiated service. In particular, we investigate how the longest processing time first algorithm (LPT) would perform in the worst case and show that a slight modification of LPT could significantly improve its worst-case performance.",

keywords = "Eligibility, Grade of service, Longest processing time first, Parallel machine scheduling",

author = "Hwang, \{Hark Chin\} and Chang, \{Soo Y.\} and Kangbok Lee",

year = "2004",

month = oct,

doi = "10.1016/S0305-0548(03)00164-3",

language = "English",

volume = "31",

pages = "2055--2061",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "12",

}

TY - JOUR

T1 - Parallel machine scheduling under a grade of service provision

AU - Hwang, Hark Chin

AU - Chang, Soo Y.

AU - Lee, Kangbok

PY - 2004/10

Y1 - 2004/10

N2 - We consider the problem of scheduling parallel machines that process service requests from various customers who are entitled to many different grade of service (GoS) levels. We propose and analyze one simple way to ensure such differentiated service. In particular, we investigate how the longest processing time first algorithm (LPT) would perform in the worst case and show that a slight modification of LPT could significantly improve its worst-case performance.

AB - We consider the problem of scheduling parallel machines that process service requests from various customers who are entitled to many different grade of service (GoS) levels. We propose and analyze one simple way to ensure such differentiated service. In particular, we investigate how the longest processing time first algorithm (LPT) would perform in the worst case and show that a slight modification of LPT could significantly improve its worst-case performance.

KW - Eligibility

KW - Grade of service

KW - Longest processing time first

KW - Parallel machine scheduling

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

U2 - 10.1016/S0305-0548(03)00164-3

DO - 10.1016/S0305-0548(03)00164-3

M3 - Article

AN - SCOPUS:2642535092

SN - 0305-0548

VL - 31

SP - 2055

EP - 2061

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 12

ER -

Parallel machine scheduling under a grade of service provision

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this