Optimal total-work-content-power due-date determination and sequencing

Edwin Tai Chiu Cheng

doi:10.1016/0898-1221(87)90184-2

Optimal total-work-content-power due-date determination and sequencing

Edwin Tai Chiu Cheng

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

9 Citations (Scopus)

Abstract

This paper considers sequencing of n jobs on a single machine. The total-work-content-power (TWK-P) due-date assignment method is used to assign due-dates to jobs. The objective is to determine the optimal due-date multiple factor so as to minimize a cost function based on the due-date multiple and job earliness, and tardiness values. A linear programming (LP) formulation of the problem is proposed and the optimal solution is determined via considering the LP dual problem.

Original language	English
Pages (from-to)	579-582
Number of pages	4
Journal	Computers and Mathematics with Applications
Volume	14
Issue number	8
DOIs	https://doi.org/10.1016/0898-1221(87)90184-2
Publication status	Published - 1 Jan 1987
Externally published	Yes

ASJC Scopus subject areas

Modelling and Simulation
Computational Theory and Mathematics
Computational Mathematics

More information

10.1016/0898-1221(87)90184-2

Cite this

@article{f9ed38210e4a4263bc296f5576f446a8,

title = "Optimal total-work-content-power due-date determination and sequencing",

abstract = "This paper considers sequencing of n jobs on a single machine. The total-work-content-power (TWK-P) due-date assignment method is used to assign due-dates to jobs. The objective is to determine the optimal due-date multiple factor so as to minimize a cost function based on the due-date multiple and job earliness, and tardiness values. A linear programming (LP) formulation of the problem is proposed and the optimal solution is determined via considering the LP dual problem.",

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

year = "1987",

month = jan,

day = "1",

doi = "10.1016/0898-1221(87)90184-2",

language = "English",

volume = "14",

pages = "579--582",

journal = "Computers and Mathematics with Applications",

issn = "0898-1221",

publisher = "Elsevier Ltd",

number = "8",

}

TY - JOUR

T1 - Optimal total-work-content-power due-date determination and sequencing

AU - Cheng, Edwin Tai Chiu

PY - 1987/1/1

Y1 - 1987/1/1

N2 - This paper considers sequencing of n jobs on a single machine. The total-work-content-power (TWK-P) due-date assignment method is used to assign due-dates to jobs. The objective is to determine the optimal due-date multiple factor so as to minimize a cost function based on the due-date multiple and job earliness, and tardiness values. A linear programming (LP) formulation of the problem is proposed and the optimal solution is determined via considering the LP dual problem.

AB - This paper considers sequencing of n jobs on a single machine. The total-work-content-power (TWK-P) due-date assignment method is used to assign due-dates to jobs. The objective is to determine the optimal due-date multiple factor so as to minimize a cost function based on the due-date multiple and job earliness, and tardiness values. A linear programming (LP) formulation of the problem is proposed and the optimal solution is determined via considering the LP dual problem.

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

U2 - 10.1016/0898-1221(87)90184-2

DO - 10.1016/0898-1221(87)90184-2

M3 - Journal article

SN - 0898-1221

VL - 14

SP - 579

EP - 582

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

IS - 8

ER -

Optimal total-work-content-power due-date determination and sequencing

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this