Due-date assignment and single machine scheduling with deteriorating jobs

T C E Cheng (), L Kang and C T Ng ()
Additional contact information
T C E Cheng: The Hong Kong Polytechnic University, Hung Hom, Kowloon
L Kang: The Hong Kong Polytechnic University, Hung Hom, Kowloon
C T Ng: The Hong Kong Polytechnic University, Hung Hom, Kowloon

Journal of the Operational Research Society, 2004, vol. 55, issue 2, 198-203

Abstract: 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: single machine scheduling; due-date; deteriorating jobs (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601681 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:55:y:2004:i:2:d:10.1057_palgrave.jors.2601681

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601681

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().