One machine scheduling to minimize the maximum earliness with minimum number of tardy jobs


Guner E., Erol S. , Tani K.

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, vol.55, no.2, pp.213-219, 1998 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 55 Issue: 2
  • Publication Date: 1998
  • Doi Number: 10.1016/s0925-5273(98)00062-0
  • Title of Journal : INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
  • Page Numbers: pp.213-219

Abstract

In this study we consider the problem of sequencing n jobs on one machine under the dual objective of minimizing the maximum earliness (E-max) with minimum number of tardy jobs (n(T)). A procedure is first proposed to schedule for minimizing the maximum earliness when the set of non-tardy jobs is specified. A branch and bound algorithm is presented to obtain the optimal schedule that minimizes the maximum earliness with minimum number of tardy jobs by connecting Moore's algorithm. (C) 1998 Elsevier Science B.V. All rights reserved.