01355naa a2200169 a 450000100080000000500110000800800410001910000160006024501250007626000090020152008420021065000270105265300220107965300150110170000180111677300510113410020422019-04-02       1994    bl uuuu     u00u1 u    #d1 aCHEN, C.-L.  aScheduling a single machine to minimize two criteriabmaximum tardiness and number of tardy jobs.h[electronic resource]  c1994  aIn this paper we consider a single machine scheduling problem with two criteria; minimizing both maximum tardiness and the number of tardy jobs. We present both heuristic and branch-and-bound algorithms to find the schedule which minimizes the number of taedy jobs among all schedules having minimal maximum tardiness. Computational results show thatproblems with up to 40 jobs can be solved in less than one minute of computer time, and soultion difficulty tends to increase as the range of due dates increases relative to the total processing time. We extend our results to ge nerate all nondominated schedules for the two criteria. Computational experiments indicate that all non-dominated solutions to problems with 40 jobs can be generated. However, solution difficculty for these problems is highly dependent on problem parameters.  aPrograma de Computador  aMaximum tardiness  aTardy jobs1 aBULFIN, R. L.  tIIE Transactionsgv. 26, n. 5, 1994. p. 76-84.