A note on the scheduling problem with revised delivery times and job-dependent tardiness penalties

Christos Koulamas

IISE Transactions, 2014, vol. 46, issue 6, 619-622

Abstract: This article considers the single-machine scheduling problem with revised delivery times and job-dependent tardiness penalties. It is shown that the exact dynamic programming algorithm for the simpler problem with job-independent tardiness penalties can be extended to the problem with job-dependent tardiness penalties. When the job-dependent tardiness penalties are bounded by a polynomial function of the number of jobs, the dynamic programming algorithm can be converted to a Fully Polynomial Time Approximation Scheme by implementing the “scaling the input” technique.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2013.851435 (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:taf:uiiexx:v:46:y:2014:i:6:p:619-622

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2013.851435

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().