Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time

J N D Gupta (), A J Ruiz-torres and S Webster
Additional contact information
J N D Gupta: University of Alabama in Huntsville
A J Ruiz-torres: Polytechnic University of Puerto Rico
S Webster: Syracuse University

Journal of the Operational Research Society, 2003, vol. 54, issue 12, 1263-1274

Abstract: Abstract This paper considers the problems of scheduling jobs on parallel identical machines where an optimal schedule is defined as one that gives the smallest maximum tardiness (or the minimum number of tardy jobs) among the set of schedules with optimal total flow-time (the sum of the completion times of all jobs). We show that these problems are unary NP-Hard, develop lower bounds for these two secondary criteria problems, and describe heuristic algorithms for their solution. Results of a computational study show that the proposed heuristic algorithms are quite effective and efficient in solving these hierarchical criteria scheduling problems.

Keywords: parallel machine scheduling; hierarchical criteria; maximum tardiness; tardy jobs; flow-time; lower bounds; heuristic algorithms; empirical results (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601638 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:54:y:2003:i:12:d:10.1057_palgrave.jors.2601638

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

DOI: 10.1057/palgrave.jors.2601638

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