Scheduling malleable tasks with interdependent processing rates: Comments and observations

Edmund K. Burke; Moshe Dror; James B. Orlin

doi:10.1016/j.dam.2007.08.008

Scheduling malleable tasks with interdependent processing rates: Comments and observations

Edmund K. Burke, Moshe Dror, James B. Orlin

Management Information Systems

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

2 Scopus citations

Abstract

In this short paper, we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation for a number of results for cases with convex and concave processing speed functions. The contribution of this paper is a new unified view of results described in several recent papers. We briefly discuss the implications of our observations on this important family of scheduling problems.

Original language	English (US)
Pages (from-to)	620-626
Number of pages	7
Journal	Discrete Applied Mathematics
Volume	156
Issue number	5
DOIs	https://doi.org/10.1016/j.dam.2007.08.008
State	Published - Mar 1 2008

Keywords

Malleable tasks
Parallel machines

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.dam.2007.08.008

Cite this

@article{2aa5c8458ae443ae9d217057f0b447ae,

title = "Scheduling malleable tasks with interdependent processing rates: Comments and observations",

abstract = "In this short paper, we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation for a number of results for cases with convex and concave processing speed functions. The contribution of this paper is a new unified view of results described in several recent papers. We briefly discuss the implications of our observations on this important family of scheduling problems.",

keywords = "Malleable tasks, Parallel machines",

author = "Burke, \{Edmund K.\} and Moshe Dror and Orlin, \{James B.\}",

year = "2008",

month = mar,

day = "1",

doi = "10.1016/j.dam.2007.08.008",

language = "English (US)",

volume = "156",

pages = "620--626",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "5",

}

TY - JOUR

T1 - Scheduling malleable tasks with interdependent processing rates

T2 - Comments and observations

AU - Burke, Edmund K.

AU - Dror, Moshe

AU - Orlin, James B.

PY - 2008/3/1

Y1 - 2008/3/1

N2 - In this short paper, we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation for a number of results for cases with convex and concave processing speed functions. The contribution of this paper is a new unified view of results described in several recent papers. We briefly discuss the implications of our observations on this important family of scheduling problems.

AB - In this short paper, we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation for a number of results for cases with convex and concave processing speed functions. The contribution of this paper is a new unified view of results described in several recent papers. We briefly discuss the implications of our observations on this important family of scheduling problems.

KW - Malleable tasks

KW - Parallel machines

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

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

U2 - 10.1016/j.dam.2007.08.008

DO - 10.1016/j.dam.2007.08.008

M3 - Article

AN - SCOPUS:39049120654

SN - 0166-218X

VL - 156

SP - 620

EP - 626

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 5

ER -

Scheduling malleable tasks with interdependent processing rates: Comments and observations

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this