Single machine scheduling with maximum earliness and number tardy

Azizoglu M., Kondakci S., Koksalan M.

COMPUTERS & INDUSTRIAL ENGINEERING, vol.45, no.2, pp.257-268, 2003 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 45 Issue: 2
  • Publication Date: 2003
  • Doi Number: 10.1016/s0360-8352(03)00034-2
  • Journal Name: COMPUTERS & INDUSTRIAL ENGINEERING
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.257-268
  • Keywords: scheduling, bicriteria, single machine, JOBS, MINIMIZE
  • Middle East Technical University Affiliated: Yes

Abstract

In this paper, we study the bicriteria scheduling problem of minimizing the maximum earliness and the number of tardy jobs on a single machine. We assume idle time insertion is not allowed. We first examine the problem of minimizing maximum earliness while keeping the number of tardy jobs to its minimum value. We then propose a general procedure for generating all efficient schedules for bicriteria problems. We also develop a general procedure to find the efficient schedule that minimizes a composite function of the two criteria by evaluating only a small fraction of the efficient solutions. We adapt the general procedures for the bicriteria problem of minimizing maximum earliness and the number of tardy jobs. (C) 2003 Elsevier Science Ltd. All rights reserved.