Optimal assignment of slack due-dates and sequencing in a single-machine shop

Edwin Tai Chiu Cheng

doi:10.1016/0893-9659(89)90081-5

Optimal assignment of slack due-dates and sequencing in a single-machine shop

Edwin Tai Chiu Cheng

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

18 Citations (Scopus)

Abstract

This paper considers the problem of optimal assignment of slack due-dates to n jobs and sequencing them on a single-machine to minimize a penalty function depending on the values of the assigned slack allowance and maximum job tardiness. It is shown that the earliest due-date order yields an optimal sequence and the optimal slack allowance is a simple function of the cost per unit slack allowance.

Original language	English
Pages (from-to)	333-335
Number of pages	3
Journal	Applied Mathematics Letters
Volume	2
Issue number	4
DOIs	https://doi.org/10.1016/0893-9659(89)90081-5
Publication status	Published - 1 Jan 1989

ASJC Scopus subject areas

Applied Mathematics

More information

10.1016/0893-9659(89)90081-5

Cite this

@article{0a6aca025aab457aa2bde9e2b497565b,

title = "Optimal assignment of slack due-dates and sequencing in a single-machine shop",

abstract = "This paper considers the problem of optimal assignment of slack due-dates to n jobs and sequencing them on a single-machine to minimize a penalty function depending on the values of the assigned slack allowance and maximum job tardiness. It is shown that the earliest due-date order yields an optimal sequence and the optimal slack allowance is a simple function of the cost per unit slack allowance.",

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

year = "1989",

month = jan,

day = "1",

doi = "10.1016/0893-9659(89)90081-5",

language = "English",

volume = "2",

pages = "333--335",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Ltd",

number = "4",

}

TY - JOUR

T1 - Optimal assignment of slack due-dates and sequencing in a single-machine shop

AU - Cheng, Edwin Tai Chiu

PY - 1989/1/1

Y1 - 1989/1/1

N2 - This paper considers the problem of optimal assignment of slack due-dates to n jobs and sequencing them on a single-machine to minimize a penalty function depending on the values of the assigned slack allowance and maximum job tardiness. It is shown that the earliest due-date order yields an optimal sequence and the optimal slack allowance is a simple function of the cost per unit slack allowance.

AB - This paper considers the problem of optimal assignment of slack due-dates to n jobs and sequencing them on a single-machine to minimize a penalty function depending on the values of the assigned slack allowance and maximum job tardiness. It is shown that the earliest due-date order yields an optimal sequence and the optimal slack allowance is a simple function of the cost per unit slack allowance.

UR - https://www.scopus.com/pages/publications/38249026087

U2 - 10.1016/0893-9659(89)90081-5

DO - 10.1016/0893-9659(89)90081-5

M3 - Journal article

SN - 0893-9659

VL - 2

SP - 333

EP - 335

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 4

ER -

Optimal assignment of slack due-dates and sequencing in a single-machine shop

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this