A note on due-date assignment and single-machine scheduling with deteriorating jobs

Kuo W-H and Dar-Li Yang
Additional contact information
Kuo W-H: National Formosa University

Journal of the Operational Research Society, 2008, vol. 59, issue 6, 857-859

Abstract: Abstract In this note, we study a single-machine scheduling problem with deteriorating jobs whose processing times are an increasing function of their start times. The objective is to determine the optimal due-date and schedule simultaneously to minimize the total of due-date, earliness and tardiness penalties. We give a concise analysis of the problem and provide a polynomial time algorithm to solve the problem. Moreover, the algorithm can be easily applied to the ‘mirror’ scheduling problem in which the actual processing time of a job is a decreasing function of its starting time.

Keywords: scheduling; deteriorating jobs; due-date; earliness; tardiness (search for similar items in EconPapers)
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2602396 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:59:y:2008:i:6:d:10.1057_palgrave.jors.2602396

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

DOI: 10.1057/palgrave.jors.2602396

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 ().