On the single machine total tardiness problem

Z. J. Tian; Chi To Ng; Edwin Tai Chiu Cheng

doi:10.1016/j.ejor.2004.03.017

On the single machine total tardiness problem

Z. J. Tian, Chi To Ng, Edwin Tai Chiu Cheng

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

10 Citations (Scopus)

Abstract

In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates.

Original language	English
Pages (from-to)	843-846
Number of pages	4
Journal	European Journal of Operational Research
Volume	165
Issue number	3
DOIs	https://doi.org/10.1016/j.ejor.2004.03.017
Publication status	Published - 16 Sept 2005

Keywords

Scheduling
Single machine
Total tardiness

ASJC Scopus subject areas

Information Systems and Management
Management Science and Operations Research
Statistics, Probability and Uncertainty
Applied Mathematics
Modelling and Simulation
Transportation

More information

10.1016/j.ejor.2004.03.017

Cite this

@article{6e4cf7a0de7042cfa5d7cb2ee6017dd8,

title = "On the single machine total tardiness problem",

abstract = "In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates.",

keywords = "Scheduling, Single machine, Total tardiness",

author = "Tian, {Z. J.} and Ng, {Chi To} and Cheng, {Edwin Tai Chiu}",

year = "2005",

month = sep,

day = "16",

doi = "10.1016/j.ejor.2004.03.017",

language = "English",

volume = "165",

pages = "843--846",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - On the single machine total tardiness problem

AU - Tian, Z. J.

AU - Ng, Chi To

AU - Cheng, Edwin Tai Chiu

PY - 2005/9/16

Y1 - 2005/9/16

N2 - In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates.

AB - In this paper we study the single machine total tardiness problem. We first identify some optimality properties based on which a special case with a given number of distinct due dates is proved polynomially solvable. The results are then extended to the case with release dates.

KW - Scheduling

KW - Single machine

KW - Total tardiness

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

U2 - 10.1016/j.ejor.2004.03.017

DO - 10.1016/j.ejor.2004.03.017

M3 - Journal article

SN - 0377-2217

VL - 165

SP - 843

EP - 846

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

On the single machine total tardiness problem

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this