Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed


Azizoglu M. , Koksalan M. , Koksalan S.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, vol.54, no.6, pp.661-664, 2003 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 54 Issue: 6
  • Publication Date: 2003
  • Doi Number: 10.1057/palgrave.jors.2601478
  • Title of Journal : JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Page Numbers: pp.661-664

Abstract

We address the bicriteria problem of minimizing the number of tardy jobs and maximum earliness on a single machine where machine idle time is allowed. We show that the problem of minimizing the number of tardy jobs while maximum earliness is kept at its minimum value of zero is polynomially solvable. We present polynomial time algorithms for the maximum earliness problem subject to no tardy jobs and the maximum earliness problem for a given set of tardy jobs. Finally, we discuss the use of the latter algorithm in generating all efficient schedules.