COMPUTERS & INDUSTRIAL ENGINEERING, cilt.45, sa.2, ss.257-268, 2003 (SCI-Expanded)
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