A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem

Edwin Tai Chiu Cheng

doi:10.1016/0305-0548(90)90020-8

A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem

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

Abstract

In many single-machine sequencing problems the optimal job sequence is shown to be in the shortest processing time (SPT) order. This note offers a constructive proof of SPT optimality for these problems via solution of the transportation problem.

Original language	English
Pages (from-to)	425-426
Number of pages	2
Journal	Computers and Operations Research
Volume	17
Issue number	4
DOIs	https://doi.org/10.1016/0305-0548(90)90020-8
Publication status	Published - 1 Jan 1990
Externally published	Yes

ASJC Scopus subject areas

General Computer Science
Modelling and Simulation
Management Science and Operations Research

More information

10.1016/0305-0548(90)90020-8

Cite this

@article{73cc5c27406c4c3d85135000aa7efa45,

title = "A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem",

abstract = "In many single-machine sequencing problems the optimal job sequence is shown to be in the shortest processing time (SPT) order. This note offers a constructive proof of SPT optimality for these problems via solution of the transportation problem.",

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

year = "1990",

month = jan,

day = "1",

doi = "10.1016/0305-0548(90)90020-8",

language = "English",

volume = "17",

pages = "425--426",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "4",

}

TY - JOUR

T1 - A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem

AU - Cheng, Edwin Tai Chiu

PY - 1990/1/1

Y1 - 1990/1/1

N2 - In many single-machine sequencing problems the optimal job sequence is shown to be in the shortest processing time (SPT) order. This note offers a constructive proof of SPT optimality for these problems via solution of the transportation problem.

AB - In many single-machine sequencing problems the optimal job sequence is shown to be in the shortest processing time (SPT) order. This note offers a constructive proof of SPT optimality for these problems via solution of the transportation problem.

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

U2 - 10.1016/0305-0548(90)90020-8

DO - 10.1016/0305-0548(90)90020-8

M3 - Journal article

SN - 0305-0548

VL - 17

SP - 425

EP - 426

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 4

ER -

A note on a proof of SPT optimality for singlemachine sequencing problems via the transportation problem

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this