A heuristic procedure to minimize number of tardy jobs and total tardiness in single machine scheduling

  • Suer G
  • Czajkiewicz Z
  • 3


    Mendeley users who have this article in their library.
  • 6


    Citations of this article.


Moore has suggested an optimizing algorithm for minimizing the number of tardy jobs in single machine scheduling. This article explores the possibility of modifying the Moore's algorithm so that total tardiness is minimized while keeping the number of tardy jobs minimum. A heuristic procedure based on the Moore's original algorithm is presented and its performance is evaluated. A simple extension of the algorithm to parallel machine scheduling is also provided. © 1992.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Gursel A. Suer

  • Zbigniew Czajkiewicz

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free