An improved solution procedure for the n/1//formula presented {γi(ci)) →Σci, scheduling problem

Edwin Tai Chiu Cheng

doi:10.1057/jors.1991.83

An improved solution procedure for the n/1//formula presented {γ_i(c_i)) →Σc_i, scheduling problem

Edwin Tai Chiu Cheng

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

5 Citations (Scopus)

Abstract

Given a set of n jobs to be processed on a single machine, the problem is to find an optimal job sequence that hierarchically minimizes a bi-criterion objective function. The primary criterion is the maximum value of a general non-decreasing penalty function of job completion time, while the secondary criterion is total job flow time. An extension of Emmons’s result is presented on the basis of which an improved solution procedue is developed to reduce the computational effort to find the optimal solution.

Original language	English
Pages (from-to)	413-417
Number of pages	5
Journal	Journal of the Operational Research Society
Volume	42
Issue number	5
DOIs	https://doi.org/10.1057/jors.1991.83
Publication status	Published - 1 Jan 1991
Externally published	Yes

Keywords

Bi-criterion
Scheduling
Sequencing

ASJC Scopus subject areas

Management Information Systems
Strategy and Management
Management Science and Operations Research
Marketing

More information

10.1057/jors.1991.83

Cite this

@article{d247bcdbe5cb42ba81970ef6c9cb4007,

title = "An improved solution procedure for the n/1//formula presented {γi(ci)) →Σci, scheduling problem",

abstract = "Given a set of n jobs to be processed on a single machine, the problem is to find an optimal job sequence that hierarchically minimizes a bi-criterion objective function. The primary criterion is the maximum value of a general non-decreasing penalty function of job completion time, while the secondary criterion is total job flow time. An extension of Emmons{\textquoteright}s result is presented on the basis of which an improved solution procedue is developed to reduce the computational effort to find the optimal solution.",

keywords = "Bi-criterion, Scheduling, Sequencing",

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

year = "1991",

month = jan,

day = "1",

doi = "10.1057/jors.1991.83",

language = "English",

volume = "42",

pages = "413--417",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Taylor and Francis Ltd.",

number = "5",

}

TY - JOUR

T1 - An improved solution procedure for the n/1//formula presented {γi(ci)) →Σci, scheduling problem

AU - Cheng, Edwin Tai Chiu

PY - 1991/1/1

Y1 - 1991/1/1

N2 - Given a set of n jobs to be processed on a single machine, the problem is to find an optimal job sequence that hierarchically minimizes a bi-criterion objective function. The primary criterion is the maximum value of a general non-decreasing penalty function of job completion time, while the secondary criterion is total job flow time. An extension of Emmons’s result is presented on the basis of which an improved solution procedue is developed to reduce the computational effort to find the optimal solution.

AB - Given a set of n jobs to be processed on a single machine, the problem is to find an optimal job sequence that hierarchically minimizes a bi-criterion objective function. The primary criterion is the maximum value of a general non-decreasing penalty function of job completion time, while the secondary criterion is total job flow time. An extension of Emmons’s result is presented on the basis of which an improved solution procedue is developed to reduce the computational effort to find the optimal solution.

KW - Bi-criterion

KW - Scheduling

KW - Sequencing

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

U2 - 10.1057/jors.1991.83

DO - 10.1057/jors.1991.83

M3 - Journal article

SN - 0160-5682

VL - 42

SP - 413

EP - 417

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 5

ER -