On optimal common due-date determination

Edwin Tai Chiu Cheng

doi:10.1093/imaman/1.1.39

On optimal common due-date determination

Edwin Tai Chiu Cheng

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

6 Citations (Scopus)

Abstract

Given a set of n independent jobs to be processed on a single machine, the problem is to determine the optimal constant flow allowance for the CON due-date assignment method and the optimal job sequence to minimize an average missed due-date cost. A linear programming formulation of the problem is proposed and the optimal due-date is obtained by solving the LP dual problem. It is shown that the optimal job sequence can be determined analytically only under a special circumstance. Finally, a numerical example is given to demonstrate how the results can be applied to find the optimal solutions.

Original language	English
Pages (from-to)	39-43
Number of pages	5
Journal	IMA Journal of Management Mathematics
Volume	1
Issue number	1
DOIs	https://doi.org/10.1093/imaman/1.1.39
Publication status	Published - 1 Dec 1986
Externally published	Yes

ASJC Scopus subject areas

Management Information Systems
Modelling and Simulation
Economics, Econometrics and Finance(all)
Strategy and Management
Management Science and Operations Research
Applied Mathematics

More information

10.1093/imaman/1.1.39

Cite this

@article{800299af713246da8f65d960e9e59e04,

title = "On optimal common due-date determination",

abstract = "Given a set of n independent jobs to be processed on a single machine, the problem is to determine the optimal constant flow allowance for the CON due-date assignment method and the optimal job sequence to minimize an average missed due-date cost. A linear programming formulation of the problem is proposed and the optimal due-date is obtained by solving the LP dual problem. It is shown that the optimal job sequence can be determined analytically only under a special circumstance. Finally, a numerical example is given to demonstrate how the results can be applied to find the optimal solutions.",

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

year = "1986",

month = dec,

day = "1",

doi = "10.1093/imaman/1.1.39",

language = "English",

volume = "1",

pages = "39--43",

journal = "IMA Journal of Management Mathematics",

issn = "1471-678X",

publisher = "Oxford University Press",

number = "1",

}

TY - JOUR

T1 - On optimal common due-date determination

AU - Cheng, Edwin Tai Chiu

PY - 1986/12/1

Y1 - 1986/12/1

N2 - Given a set of n independent jobs to be processed on a single machine, the problem is to determine the optimal constant flow allowance for the CON due-date assignment method and the optimal job sequence to minimize an average missed due-date cost. A linear programming formulation of the problem is proposed and the optimal due-date is obtained by solving the LP dual problem. It is shown that the optimal job sequence can be determined analytically only under a special circumstance. Finally, a numerical example is given to demonstrate how the results can be applied to find the optimal solutions.

AB - Given a set of n independent jobs to be processed on a single machine, the problem is to determine the optimal constant flow allowance for the CON due-date assignment method and the optimal job sequence to minimize an average missed due-date cost. A linear programming formulation of the problem is proposed and the optimal due-date is obtained by solving the LP dual problem. It is shown that the optimal job sequence can be determined analytically only under a special circumstance. Finally, a numerical example is given to demonstrate how the results can be applied to find the optimal solutions.

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

U2 - 10.1093/imaman/1.1.39

DO - 10.1093/imaman/1.1.39

M3 - Journal article

VL - 1

SP - 39

EP - 43

JO - IMA Journal of Management Mathematics

JF - IMA Journal of Management Mathematics

SN - 1471-678X

IS - 1

ER -

On optimal common due-date determination

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this