On a single-machine optimal constant due-date assignment and sequencing problem

Edwin Tai Chiu Cheng

doi:10.1016/0893-9659(88)90096-1

On a single-machine optimal constant due-date assignment and sequencing problem

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

Abstract

This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the job sequence.

Original language	English
Pages (from-to)	295-298
Number of pages	4
Journal	Applied Mathematics Letters
Volume	1
Issue number	3
DOIs	https://doi.org/10.1016/0893-9659(88)90096-1
Publication status	Published - 1 Jan 1988
Externally published	Yes

ASJC Scopus subject areas

Applied Mathematics

More information

10.1016/0893-9659(88)90096-1

Cite this

@article{8bbddbcaad224ce29c1c37101638a453,

title = "On a single-machine optimal constant due-date assignment and sequencing problem",

abstract = "This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the job sequence.",

author = "Cheng, {Edwin Tai Chiu}",

year = "1988",

month = jan,

day = "1",

doi = "10.1016/0893-9659(88)90096-1",

language = "English",

volume = "1",

pages = "295--298",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd",

number = "3",

}

TY - JOUR

T1 - On a single-machine optimal constant due-date assignment and sequencing problem

AU - Cheng, Edwin Tai Chiu

PY - 1988/1/1

Y1 - 1988/1/1

N2 - This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the job sequence.

AB - This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the job sequence.

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

U2 - 10.1016/0893-9659(88)90096-1

DO - 10.1016/0893-9659(88)90096-1

M3 - Journal article

SN - 0893-9659

VL - 1

SP - 295

EP - 298

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 3

ER -

On a single-machine optimal constant due-date assignment and sequencing problem

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this