A note on the equivalence of the Wilkerson-Irwin and modified due-data rules for the mean tardiness sequencing problem

Edwin Tai Chiu Cheng

doi:10.1016/0360-8352(92)90033-G

A note on the equivalence of the Wilkerson-Irwin and modified due-data rules for the mean tardiness sequencing problem

Edwin Tai Chiu Cheng

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

6 Citations (Scopus)

Abstract

We consider the problem of sequencing a set of simultaneously available jobs on a single-machine to minimize mean tardiness. Both the Wilkerson-Irwin (WI) and modified due-date (MDD) rules are effective heuristics for solving this problem. We show that the WI and MDD rules are in fact equivalent since both of them are based on the same local optimality condition for a pair of adjacent jobs. This provides some motivation to use the MDD and WI heuristics for the mean tardiness problem.

Original language	English
Pages (from-to)	63-66
Number of pages	4
Journal	Computers and Industrial Engineering
Volume	22
Issue number	1
DOIs	https://doi.org/10.1016/0360-8352(92)90033-G
Publication status	Published - 1 Jan 1992
Externally published	Yes

ASJC Scopus subject areas

General Computer Science
General Engineering

More information

10.1016/0360-8352(92)90033-G

Cite this

@article{1da7b93a31e7490b90a7bd3f51b7666b,

title = "A note on the equivalence of the Wilkerson-Irwin and modified due-data rules for the mean tardiness sequencing problem",

abstract = "We consider the problem of sequencing a set of simultaneously available jobs on a single-machine to minimize mean tardiness. Both the Wilkerson-Irwin (WI) and modified due-date (MDD) rules are effective heuristics for solving this problem. We show that the WI and MDD rules are in fact equivalent since both of them are based on the same local optimality condition for a pair of adjacent jobs. This provides some motivation to use the MDD and WI heuristics for the mean tardiness problem.",

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

year = "1992",

month = jan,

day = "1",

doi = "10.1016/0360-8352(92)90033-G",

language = "English",

volume = "22",

pages = "63--66",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd",

number = "1",

}

TY - JOUR

T1 - A note on the equivalence of the Wilkerson-Irwin and modified due-data rules for the mean tardiness sequencing problem

AU - Cheng, Edwin Tai Chiu

PY - 1992/1/1

Y1 - 1992/1/1

N2 - We consider the problem of sequencing a set of simultaneously available jobs on a single-machine to minimize mean tardiness. Both the Wilkerson-Irwin (WI) and modified due-date (MDD) rules are effective heuristics for solving this problem. We show that the WI and MDD rules are in fact equivalent since both of them are based on the same local optimality condition for a pair of adjacent jobs. This provides some motivation to use the MDD and WI heuristics for the mean tardiness problem.

AB - We consider the problem of sequencing a set of simultaneously available jobs on a single-machine to minimize mean tardiness. Both the Wilkerson-Irwin (WI) and modified due-date (MDD) rules are effective heuristics for solving this problem. We show that the WI and MDD rules are in fact equivalent since both of them are based on the same local optimality condition for a pair of adjacent jobs. This provides some motivation to use the MDD and WI heuristics for the mean tardiness problem.

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

U2 - 10.1016/0360-8352(92)90033-G

DO - 10.1016/0360-8352(92)90033-G

M3 - Journal article

SN - 0360-8352

VL - 22

SP - 63

EP - 66

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

IS - 1

ER -

A note on the equivalence of the Wilkerson-Irwin and modified due-data rules for the mean tardiness sequencing problem

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this