Maximizing the weighted number of on-time jobs in single machine scheduling with time windows

The problem of maximizing the weighted number of on-time jobs on a single machine with time windows (STW) is shown to be strongly NP-hard. An efficient heuristic is presented for STW. Computational experiments indicate that the performance of the heuristic is quite good.