Single machine scheduling with total tardiness criterion and convex controllable processing times

Kailiang Xu, Zuren Feng and Liangjun Ke ()

Annals of Operations Research, 2011, vol. 186, issue 1, 383-391

Abstract: We consider a single machine scheduling problem with total tardiness criteria and controllable job-processing times specified by a convex resource consumption function. The objective is to have the total tardiness limited into a given range, and minimize the total resource consumption. A polynomial time algorithm of O(n 2 ) is presented for the special case where jobs have a common due date. Copyright Springer Science+Business Media, LLC 2011

Keywords: Single machine; Total tardiness criteria; Convex resource consumption function (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-010-0827-6 (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:186:y:2011:i:1:p:383-391:10.1007/s10479-010-0827-6

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

DOI: 10.1007/s10479-010-0827-6

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