Dynamic programming approach to the n/m/parallel ∑ i=1 m{∑wj∑tj} scheduling problem

Chung Lun Li

doi:10.1016/0893-9659(92)90070-P

Dynamic programming approach to the n/m/parallel ∑ i=1 m{∑wj∑tj} scheduling problem

Chung Lun Li

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

Abstract

We present a dynamic program to solve the problem of scheduling n simultaneously available jobs on m parallel machines to minimize the weighted sum machine makespans. This dynamic program is pseudo-polynomial when m is a fixed number.

Original language	English
Pages (from-to)	79-80
Number of pages	2
Journal	Applied Mathematics Letters
Volume	5
Issue number	5
DOIs	https://doi.org/10.1016/0893-9659(92)90070-P
Publication status	Published - 1 Jan 1992
Externally published	Yes

ASJC Scopus subject areas

Applied Mathematics

More information

10.1016/0893-9659(92)90070-P

Cite this

@article{bd9b64c8ceb343819ac7f229114b5909,

title = "Dynamic programming approach to the n/m/parallel ∑ i=1 m{∑wj∑tj} scheduling problem",

abstract = "We present a dynamic program to solve the problem of scheduling n simultaneously available jobs on m parallel machines to minimize the weighted sum machine makespans. This dynamic program is pseudo-polynomial when m is a fixed number.",

author = "Li, {Chung Lun}",

year = "1992",

month = jan,

day = "1",

doi = "10.1016/0893-9659(92)90070-P",

language = "English",

volume = "5",

pages = "79--80",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd",

number = "5",

}

TY - JOUR

T1 - Dynamic programming approach to the n/m/parallel ∑ i=1 m{∑wj∑tj} scheduling problem

AU - Li, Chung Lun

PY - 1992/1/1

Y1 - 1992/1/1

N2 - We present a dynamic program to solve the problem of scheduling n simultaneously available jobs on m parallel machines to minimize the weighted sum machine makespans. This dynamic program is pseudo-polynomial when m is a fixed number.

AB - We present a dynamic program to solve the problem of scheduling n simultaneously available jobs on m parallel machines to minimize the weighted sum machine makespans. This dynamic program is pseudo-polynomial when m is a fixed number.

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

U2 - 10.1016/0893-9659(92)90070-P

DO - 10.1016/0893-9659(92)90070-P

M3 - Journal article

SN - 0893-9659

VL - 5

SP - 79

EP - 80

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 5

ER -

Dynamic programming approach to the n/m/parallel ∑ i=1 m{∑wj∑tj} scheduling problem

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this