Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs

Mitre Dourado (), Rosiane Rodrigues () and Jayme Szwarcfiter ()

Annals of Operations Research, 2009, vol. 169, issue 1, 91 pages

Abstract: Consider a set of n unit time jobs, each one having a release date, a due date, both nonnegative integers, and a weight, a positive real number. Given a set of m parallel machines, we describe an algorithm for finding schedules with minimum weighted number of tardy jobs. The complexity of the proposed algorithm is $O(n^{2}\frac{(1+\log m)}{m})$ . The best previous algorithm for this problem has complexity O(mn 3 ) and employs network flow techniques. Our method is based on a characterization for schedules of this type and employs graph theoretic tools. Copyright Springer Science+Business Media, LLC 2009

Keywords: Algorithms; Graph theory; Parallel machines; Scheduling theory; Tardy jobs; Unit time jobs (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-008-0479-y (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:169:y:2009:i:1:p:81-91:10.1007/s10479-008-0479-y

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

DOI: 10.1007/s10479-008-0479-y

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