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{∑w_j∑t_j} scheduling problem

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › 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. © 1992.

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

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Access Output

10.1016/0893-9659(92)90070-PLicence: Elsevier user license

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{4f8352008c0a4bb6acd2016e1d6d757e,

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. {\textcopyright} 1992.",

author = "Chung-Lun Li",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].",

year = "1992",

month = sep,

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

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 1992/9

Y1 - 1992/9

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. © 1992.

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. © 1992.

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-44049114500&origin=recordpage

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

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

M3 - RGC 21 - Publication in refereed journal

SN - 0893-9659

VL - 5

SP - 79

EP - 80

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 5

ER -