A general lower bound for the makespan problem

S. T. Webster

doi:10.1016/0377-2217(94)00333-5

A general lower bound for the makespan problem

S. T. Webster

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

13 Scopus citations

Abstract

The problem of scheduling jobs on identical parallel processors to minimize makespan is NP-hard. We introduce a general lower bound which includes as special cases bounds that either dominate, or are equivalent to, lower bounds previously proposed in the literature. The general lower bound unifies earlier results and can be used to identify new bounds, improve previously proposed bounds, and extend bounds for the problem with identical processor ready times to the problem with variable processor ready times.

Original language	English (US)
Pages (from-to)	516-524
Number of pages	9
Journal	European Journal of Operational Research
Volume	89
Issue number	3
DOIs	https://doi.org/10.1016/0377-2217(94)00333-5
State	Published - Mar 22 1996
Externally published	Yes

Keywords

Deterministic
Parallel shop
Scheduling theory

ASJC Scopus subject areas

General Computer Science
Modeling and Simulation
Management Science and Operations Research
Information Systems and Management

Access to Document

10.1016/0377-2217(94)00333-5

Cite this

@article{022c3fd49cc142398b49200cd0eae649,

title = "A general lower bound for the makespan problem",

abstract = "The problem of scheduling jobs on identical parallel processors to minimize makespan is NP-hard. We introduce a general lower bound which includes as special cases bounds that either dominate, or are equivalent to, lower bounds previously proposed in the literature. The general lower bound unifies earlier results and can be used to identify new bounds, improve previously proposed bounds, and extend bounds for the problem with identical processor ready times to the problem with variable processor ready times.",

keywords = "Deterministic, Parallel shop, Scheduling theory",

author = "Webster, {S. T.}",

year = "1996",

month = mar,

day = "22",

doi = "10.1016/0377-2217(94)00333-5",

language = "English (US)",

volume = "89",

pages = "516--524",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - A general lower bound for the makespan problem

AU - Webster, S. T.

PY - 1996/3/22

Y1 - 1996/3/22

N2 - The problem of scheduling jobs on identical parallel processors to minimize makespan is NP-hard. We introduce a general lower bound which includes as special cases bounds that either dominate, or are equivalent to, lower bounds previously proposed in the literature. The general lower bound unifies earlier results and can be used to identify new bounds, improve previously proposed bounds, and extend bounds for the problem with identical processor ready times to the problem with variable processor ready times.

AB - The problem of scheduling jobs on identical parallel processors to minimize makespan is NP-hard. We introduce a general lower bound which includes as special cases bounds that either dominate, or are equivalent to, lower bounds previously proposed in the literature. The general lower bound unifies earlier results and can be used to identify new bounds, improve previously proposed bounds, and extend bounds for the problem with identical processor ready times to the problem with variable processor ready times.

KW - Deterministic

KW - Parallel shop

KW - Scheduling theory

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

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

U2 - 10.1016/0377-2217(94)00333-5

DO - 10.1016/0377-2217(94)00333-5

M3 - Article

AN - SCOPUS:0030108301

SN - 0377-2217

VL - 89

SP - 516

EP - 524

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

A general lower bound for the makespan problem

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this