Determination of optimal total-work-content due-dates for a single machine sequencing problem

Edwin Tai Chiu Cheng

doi:10.1080/03052158808941205

Determination of optimal total-work-content due-dates for a single machine sequencing problem

Edwin Tai Chiu Cheng

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

3 Citations (Scopus)

Abstract

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

Original language	English
Pages (from-to)	121-125
Number of pages	5
Journal	Engineering Optimization
Volume	14
Issue number	2
DOIs	https://doi.org/10.1080/03052158808941205
Publication status	Published - 1 Nov 1988
Externally published	Yes

Keywords

due-dates
linear programming
Manufacturing
scheduling

ASJC Scopus subject areas

Computer Science Applications
Control and Optimization
Management Science and Operations Research
Industrial and Manufacturing Engineering
Applied Mathematics

More information

10.1080/03052158808941205

Cite this

@article{b3af3dba81b246d8910a75731f2aa5d2,

title = "Determination of optimal total-work-content due-dates for a single machine sequencing problem",

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

keywords = "due-dates, linear programming, Manufacturing, scheduling",

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

year = "1988",

month = nov,

day = "1",

doi = "10.1080/03052158808941205",

language = "English",

volume = "14",

pages = "121--125",

journal = "Engineering Optimization",

issn = "0305-215X",

publisher = "Taylor and Francis Ltd.",

number = "2",

}

TY - JOUR

T1 - Determination of optimal total-work-content due-dates for a single machine sequencing problem

AU - Cheng, Edwin Tai Chiu

PY - 1988/11/1

Y1 - 1988/11/1

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

KW - due-dates

KW - linear programming

KW - Manufacturing

KW - scheduling

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

U2 - 10.1080/03052158808941205

DO - 10.1080/03052158808941205

M3 - Journal article

SN - 0305-215X

VL - 14

SP - 121

EP - 125

JO - Engineering Optimization

JF - Engineering Optimization

IS - 2

ER -

Determination of optimal total-work-content due-dates for a single machine sequencing problem

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this