Single machine scheduling with maximum earliness and number tardy

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.

[1]  Tu Fengsheng,et al.  Single machine scheduling to minimize weighted earliness subject to maximum tardiness , 1997 .

[2]  George L. Vairaktarakis,et al.  Complexity of Single Machine Hierarchical Scheduling: A Survey , 1993 .

[3]  J. A. Hoogeveen,et al.  Single-machine bicriteria scheduling , 1992 .

[4]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[5]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[6]  Gur Mosheiov,et al.  Single machine scheduling to minimize the number of early and tardy jobs , 1996, Comput. Oper. Res..

[7]  M. Azizoglu,et al.  Minimizing flowtime and maximum earliness on a single machine , 1998 .

[8]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[9]  Suresh Chand,et al.  Single machine scheduling to minimize weighted earliness subject to no tardy jobs , 1988 .

[10]  Gur Mosheiov,et al.  Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems , 1993 .

[11]  S Kafandaris,et al.  Essays in Decision Making: A Volume in Honour of Stanley Zionts , 2011, J. Oper. Res. Soc..

[12]  Murat Köksalan,et al.  Note: Bicriteria scheduling for minimizing flow time and maximum tardiness , 1996 .

[13]  M. Köksalan.  A heuristic approach to bicriteria scheduling , 1999 .

[14]  Ludo Gelders,et al.  Solving a bicriterion scheduling problem , 1980 .