A heuristic for the single machine tardiness problem

S. S. Panwalkar; M. L. Smith; C. P. Koulamas

doi:10.1016/0377-2217(93)90241-E

A heuristic for the single machine tardiness problem

S. S. Panwalkar, M. L. Smith, C. P. Koulamas

Industrial Engineering

Research output: Contribution to journal › Article › peer-review

72 Scopus citations

Abstract

A heuristic (P-S-K) is presented in this paper for minimizing the mean tardiness for the single machine sequencing problem. This heuristic is compared with other available construction heuristics from the literature like the Wilkerson-Irwin (W-I), Holsenback-Russel (H-R), and API heuristics. It is shown that P-S-K yields better results than the other methods on a wide range of problems. Furthermore, as due dates become tight, P-S-K is substantially better than the other methods with respect to computational time.

Original language	English
Pages (from-to)	304-310
Number of pages	7
Journal	European Journal of Operational Research
Volume	70
Issue number	3
DOIs	https://doi.org/10.1016/0377-2217(93)90241-E
State	Published - Nov 12 1993

Keywords

Scheduling
Single machine
Tardiness

Access to Document

10.1016/0377-2217(93)90241-E

Cite this

@article{dc6e148f9ab342288154f485d17d1107,

title = "A heuristic for the single machine tardiness problem",

abstract = "A heuristic (P-S-K) is presented in this paper for minimizing the mean tardiness for the single machine sequencing problem. This heuristic is compared with other available construction heuristics from the literature like the Wilkerson-Irwin (W-I), Holsenback-Russel (H-R), and API heuristics. It is shown that P-S-K yields better results than the other methods on a wide range of problems. Furthermore, as due dates become tight, P-S-K is substantially better than the other methods with respect to computational time.",

keywords = "Scheduling, Single machine, Tardiness",

author = "Panwalkar, {S. S.} and Smith, {M. L.} and Koulamas, {C. P.}",

year = "1993",

month = nov,

day = "12",

doi = "10.1016/0377-2217(93)90241-E",

language = "English",

volume = "70",

pages = "304--310",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier BV",

number = "3",

}

TY - JOUR

T1 - A heuristic for the single machine tardiness problem

AU - Panwalkar, S. S.

AU - Smith, M. L.

AU - Koulamas, C. P.

PY - 1993/11/12

Y1 - 1993/11/12

N2 - A heuristic (P-S-K) is presented in this paper for minimizing the mean tardiness for the single machine sequencing problem. This heuristic is compared with other available construction heuristics from the literature like the Wilkerson-Irwin (W-I), Holsenback-Russel (H-R), and API heuristics. It is shown that P-S-K yields better results than the other methods on a wide range of problems. Furthermore, as due dates become tight, P-S-K is substantially better than the other methods with respect to computational time.

AB - A heuristic (P-S-K) is presented in this paper for minimizing the mean tardiness for the single machine sequencing problem. This heuristic is compared with other available construction heuristics from the literature like the Wilkerson-Irwin (W-I), Holsenback-Russel (H-R), and API heuristics. It is shown that P-S-K yields better results than the other methods on a wide range of problems. Furthermore, as due dates become tight, P-S-K is substantially better than the other methods with respect to computational time.

KW - Scheduling

KW - Single machine

KW - Tardiness

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

U2 - 10.1016/0377-2217(93)90241-E

DO - 10.1016/0377-2217(93)90241-E

M3 - Article

AN - SCOPUS:0027906584

SN - 0377-2217

VL - 70

SP - 304

EP - 310

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

A heuristic for the single machine tardiness problem

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this