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

J. N.D. Gupta, A. J. Ruiz-Torres, S. Webster

Research output: Contribution to journalArticle

15 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)1263-1274
Number of pages12
JournalJournal of the Operational Research Society
Volume54
Issue number12
DOIs
StatePublished - Dec 2003
Externally publishedYes

Keywords

  • Empirical results
  • Flow-time
  • Heuristic algorithms
  • Hierarchical criteria
  • Lower bounds
  • Maximum tardiness
  • Parallel machine scheduling
  • Tardy jobs

ASJC Scopus subject areas

  • Management Information Systems
  • Strategy and Management
  • Management Science and Operations Research
  • Marketing

Fingerprint Dive into the research topics of 'Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time'. Together they form a unique fingerprint.

  • Cite this