Error bound for common due date assignment and job scheduling on parallel machines

Jeffrey E. Diamond; Edwin Tai Chiu Cheng

doi:10.1080/07408170008963920

Error bound for common due date assignment and job scheduling on parallel machines

Jeffrey E. Diamond, Edwin Tai Chiu Cheng

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

1 Citation (Scopus)

Abstract

We consider a heuristic which has been applied to assign a common due date to a set of n jobs and schedule them on a set of m parallel and identical machines so that the weighted sum of the due date, earliness and tardiness is approximately minimized. We alter the heuristic slightly and show that the revised version is asymptotically optimal as n→∞.

Original language	English
Pages (from-to)	445-448
Number of pages	4
Journal	IIE Transactions (Institute of Industrial Engineers)
Volume	32
Issue number	5
DOIs	https://doi.org/10.1080/07408170008963920
Publication status	Published - 1 Jan 2000

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

More information

10.1080/07408170008963920

Cite this

@article{ca890d8a5af444f19caf220013edcae1,

title = "Error bound for common due date assignment and job scheduling on parallel machines",

abstract = "We consider a heuristic which has been applied to assign a common due date to a set of n jobs and schedule them on a set of m parallel and identical machines so that the weighted sum of the due date, earliness and tardiness is approximately minimized. We alter the heuristic slightly and show that the revised version is asymptotically optimal as n→∞.",

author = "Diamond, {Jeffrey E.} and Cheng, {Edwin Tai Chiu}",

year = "2000",

month = jan,

day = "1",

doi = "10.1080/07408170008963920",

language = "English",

volume = "32",

pages = "445--448",

journal = "IIE Transactions (Institute of Industrial Engineers)",

issn = "0740-817X",

publisher = "Taylor and Francis Ltd.",

number = "5",

}

TY - JOUR

T1 - Error bound for common due date assignment and job scheduling on parallel machines

AU - Diamond, Jeffrey E.

AU - Cheng, Edwin Tai Chiu

PY - 2000/1/1

Y1 - 2000/1/1

N2 - We consider a heuristic which has been applied to assign a common due date to a set of n jobs and schedule them on a set of m parallel and identical machines so that the weighted sum of the due date, earliness and tardiness is approximately minimized. We alter the heuristic slightly and show that the revised version is asymptotically optimal as n→∞.

AB - We consider a heuristic which has been applied to assign a common due date to a set of n jobs and schedule them on a set of m parallel and identical machines so that the weighted sum of the due date, earliness and tardiness is approximately minimized. We alter the heuristic slightly and show that the revised version is asymptotically optimal as n→∞.

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

U2 - 10.1080/07408170008963920

DO - 10.1080/07408170008963920

M3 - Journal article

SN - 0740-817X

VL - 32

SP - 445

EP - 448

JO - IIE Transactions (Institute of Industrial Engineers)

JF - IIE Transactions (Institute of Industrial Engineers)

IS - 5

ER -

Error bound for common due date assignment and job scheduling on parallel machines

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this