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

In this study we consider the problem of sequencing n jobs on one machine under the dual objective of minimizing the maximum earliness (Emax) with minimum number of tardy jobs (nT). 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.

[1]  H. Emmons.  One machine sequencing to minimize mean flow time with minimum number tardy , 1975 .

[2]  S. Miyazaki.  ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA , 1981 .

[3]  R. Burns.  Scheduling to minimize the weighted sum of completion times with secondary criteria , 1976 .

[4]  J. George Shanthikumar,et al.  Scheduling n jobs on one machine to minimize the maximum tardiness with minimum number , 1983, Comput. Oper. Res..

[5]  John A. Buzacott,et al.  ON THE USE OF DECOMPOSITION APPROACHES IN A SINGLE MACHINE SCHDULING PROBLEM , 1982 .

[6]  L. V. Wassenhove,et al.  An algorithm for single machine sequencing with deadlines to minimize total weighted completion time , 1983 .

[7]  S. Chand,et al.  A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness , 1986 .

[8]  Robert L. Bulfin,et al.  Scheduling unit processing time jobs on a single machine with multiple criteria , 1990, Comput. Oper. Res..

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

[10]  Rakesh K. Sarin,et al.  Scheduling with multiple performance measures: the one-machine case , 1986 .

[11]  Horace W. Heck,et al.  A note on the extension of a result on scheduling with secondary criteria , 1972 .

[12]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[13]  A. Nagar,et al.  Multiple and bicriteria scheduling : A literature survey , 1995 .

[14]  Timothy D. Fry,et al.  A BI-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden , 1987, Comput. Oper. Res..

[15]  T.C.E. Cheng.  An Improved Solution Procedure for the Scheduling Problem , 1991 .

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

[17]  S. Bansal.  Single machine scheduling to minimize weighted sum of completion times with secondary criterion -- A branch and bound approach , 1980 .

[18]  Marc E. Posner,et al.  Minimizing Weighted Completion Times with Deadlines , 1985, Oper. Res..

[19]  Uttarayan Bagchi,et al.  Technical Note - An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines , 1987, Oper. Res..