An alternative proof of optimality for the common due-date assignment problem

Edwin Tai Chiu Cheng

doi:10.1016/0377-2217(88)90334-7

An alternative proof of optimality for the common due-date assignment problem

Edwin Tai Chiu Cheng

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

14 Citations (Scopus)

Abstract

For the n-job, one-machine scheduling problem with common due-dates, it is a well-known result that for any given job sequence there exists a job whose completion time is equal to the optimal value of the common due-date. In this note we offer an alternative proof of this optimal result using Kuhn-Tucker's optimality conditions for constrained convex programming problems.

Original language	English
Pages (from-to)	250-253
Number of pages	4
Journal	European Journal of Operational Research
Volume	37
Issue number	2
DOIs	https://doi.org/10.1016/0377-2217(88)90334-7
Publication status	Published - 1 Jan 1988
Externally published	Yes

Keywords

convex programming
Scheduling

ASJC Scopus subject areas

Modelling and Simulation
Management Science and Operations Research
Information Systems and Management

More information

10.1016/0377-2217(88)90334-7

Cite this

@article{b1fc2aab4785413390508c6974dfba31,

title = "An alternative proof of optimality for the common due-date assignment problem",

abstract = "For the n-job, one-machine scheduling problem with common due-dates, it is a well-known result that for any given job sequence there exists a job whose completion time is equal to the optimal value of the common due-date. In this note we offer an alternative proof of this optimal result using Kuhn-Tucker's optimality conditions for constrained convex programming problems.",

keywords = "convex programming, Scheduling",

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

year = "1988",

month = jan,

day = "1",

doi = "10.1016/0377-2217(88)90334-7",

language = "English",

volume = "37",

pages = "250--253",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - An alternative proof of optimality for the common due-date assignment problem

AU - Cheng, Edwin Tai Chiu

PY - 1988/1/1

Y1 - 1988/1/1

N2 - For the n-job, one-machine scheduling problem with common due-dates, it is a well-known result that for any given job sequence there exists a job whose completion time is equal to the optimal value of the common due-date. In this note we offer an alternative proof of this optimal result using Kuhn-Tucker's optimality conditions for constrained convex programming problems.

AB - For the n-job, one-machine scheduling problem with common due-dates, it is a well-known result that for any given job sequence there exists a job whose completion time is equal to the optimal value of the common due-date. In this note we offer an alternative proof of this optimal result using Kuhn-Tucker's optimality conditions for constrained convex programming problems.

KW - convex programming

KW - Scheduling

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

U2 - 10.1016/0377-2217(88)90334-7

DO - 10.1016/0377-2217(88)90334-7

M3 - Journal article

SN - 0377-2217

VL - 37

SP - 250

EP - 253

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 2

ER -

An alternative proof of optimality for the common due-date assignment problem

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this