Due-date assignment and single machine scheduling with deteriorating jobs

Edwin Tai Chiu Cheng; L. Kang; Chi To Ng

doi:10.1057/palgrave.jors.2601681

Due-date assignment and single machine scheduling with deteriorating jobs

Edwin Tai Chiu Cheng, L. Kang, Chi To Ng

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

79 Citations (Scopus)

Abstract

We study a scheduling problem with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n log n) time algorithm to solve this problem.

Original language	English
Pages (from-to)	198-203
Number of pages	6
Journal	Journal of the Operational Research Society
Volume	55
Issue number	2
DOIs	https://doi.org/10.1057/palgrave.jors.2601681
Publication status	Published - 1 Feb 2004

Keywords

Deteriorating jobs
Due-date
Single machine scheduling

ASJC Scopus subject areas

Management Information Systems
Strategy and Management
Management Science and Operations Research
Marketing

More information

10.1057/palgrave.jors.2601681

http://hdl.handle.net/10397/1157

Cite this

@article{f8e06634e8854024b68a099d49dfcb9c,

title = "Due-date assignment and single machine scheduling with deteriorating jobs",

abstract = "We study a scheduling problem with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n log n) time algorithm to solve this problem.",

keywords = "Deteriorating jobs, Due-date, Single machine scheduling",

author = "Cheng, {Edwin Tai Chiu} and L. Kang and Ng, {Chi To}",

year = "2004",

month = feb,

day = "1",

doi = "10.1057/palgrave.jors.2601681",

language = "English",

volume = "55",

pages = "198--203",

journal = "Journal of the Operational Research Society",

issn = "0160-5682",

publisher = "Taylor and Francis Ltd.",

number = "2",

}

TY - JOUR

T1 - Due-date assignment and single machine scheduling with deteriorating jobs

AU - Cheng, Edwin Tai Chiu

AU - Kang, L.

AU - Ng, Chi To

PY - 2004/2/1

Y1 - 2004/2/1

N2 - We study a scheduling problem with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n log n) time algorithm to solve this problem.

AB - We study a scheduling problem with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n log n) time algorithm to solve this problem.

KW - Deteriorating jobs

KW - Due-date

KW - Single machine scheduling

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

U2 - 10.1057/palgrave.jors.2601681

DO - 10.1057/palgrave.jors.2601681

M3 - Journal article

SN - 0160-5682

VL - 55

SP - 198

EP - 203

JO - Journal of the Operational Research Society

JF - Journal of the Operational Research Society

IS - 2

ER -

Due-date assignment and single machine scheduling with deteriorating jobs

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this