Maximizing total tardiness on a single machine in $$O(n^2)$$ O ( n 2 ) time via a reduction to half-product minimization

Sergey Kovalev ()

Annals of Operations Research, 2015, vol. 235, issue 1, 815-819

Abstract: Gafarov et al. (Ann Oper Res 196(1):247–261, 2012 ) have recently presented an $$O(n^2)$$ O ( n 2 ) time dynamic programming algorithm for a single machine scheduling problem to maximize the total job tardiness. We reduce this problem in $$O(n\log n)$$ O ( n log n ) time to a problem of unconstrained minimization of a function of 0–1 variables, called half-product, for which a simple $$O(n^2)$$ O ( n 2 ) time dynamic programming algorithm is known in the literature. Copyright Springer Science+Business Media New York 2015

Keywords: Scheduling; Single machine; Total tardiness; Maximization; Dynamic programming (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-015-2023-1 (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:spr:annopr:v:235:y:2015:i:1:p:815-819:10.1007/s10479-015-2023-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-2023-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().