Two dimensional load balancing

Kangbok Lee; Joseph Y.T. Leung; Michael L. Pinedo

doi:10.1016/j.orl.2014.09.006

Two dimensional load balancing

Kangbok Lee, Joseph Y.T. Leung, Michael L. Pinedo

Computer Science

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

1 Scopus citations

Abstract

We consider a bi-criteria parallel machine scheduling problem in which the first objective is the minimization of the makespan of the schedule and the second objective is the minimization of the maximum machine cost. Since the problem is strongly NP-hard, we propose a fast heuristic and derive its worst-case performance bound.

Original language	English (US)
Pages (from-to)	539-544
Number of pages	6
Journal	Operations Research Letters
Volume	42
Issue number	8
DOIs	https://doi.org/10.1016/j.orl.2014.09.006
State	Published - Dec 2014

All Science Journal Classification (ASJC) codes

Software
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

Keywords

Heuristics
Makespan
Maximum machine cost
NP-hard
Parallel machines
Two dimensional load balancing

Access to Document

10.1016/j.orl.2014.09.006

Cite this

@article{d457c42821554d569479cbc30c28e3d5,

title = "Two dimensional load balancing",

abstract = "We consider a bi-criteria parallel machine scheduling problem in which the first objective is the minimization of the makespan of the schedule and the second objective is the minimization of the maximum machine cost. Since the problem is strongly NP-hard, we propose a fast heuristic and derive its worst-case performance bound.",

keywords = "Heuristics, Makespan, Maximum machine cost, NP-hard, Parallel machines, Two dimensional load balancing",

author = "Kangbok Lee and Leung, {Joseph Y.T.} and Pinedo, {Michael L.}",

note = "Publisher Copyright: {\textcopyright} 2014 Published by Elsevier B.V.",

year = "2014",

month = dec,

doi = "10.1016/j.orl.2014.09.006",

language = "English (US)",

volume = "42",

pages = "539--544",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "8",

}

TY - JOUR

T1 - Two dimensional load balancing

AU - Lee, Kangbok

AU - Leung, Joseph Y.T.

AU - Pinedo, Michael L.

PY - 2014/12

Y1 - 2014/12

N2 - We consider a bi-criteria parallel machine scheduling problem in which the first objective is the minimization of the makespan of the schedule and the second objective is the minimization of the maximum machine cost. Since the problem is strongly NP-hard, we propose a fast heuristic and derive its worst-case performance bound.

AB - We consider a bi-criteria parallel machine scheduling problem in which the first objective is the minimization of the makespan of the schedule and the second objective is the minimization of the maximum machine cost. Since the problem is strongly NP-hard, we propose a fast heuristic and derive its worst-case performance bound.

KW - Heuristics

KW - Makespan

KW - Maximum machine cost

KW - NP-hard

KW - Parallel machines

KW - Two dimensional load balancing

UR - http://www.scopus.com/inward/record.url?scp=84908153453&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908153453&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2014.09.006

DO - 10.1016/j.orl.2014.09.006

M3 - Article

AN - SCOPUS:84908153453

SN - 0167-6377

VL - 42

SP - 539

EP - 544

JO - Operations Research Letters

JF - Operations Research Letters

IS - 8

ER -

Two dimensional load balancing

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this