The scheduling algorithm is put in place to keep the processor busy, to ensure that the most important jobs get done first, and to prevent long job backups.

This paper considers the problem of scheduling n jobs, each having a processing time, a due date and a weight, on a single machine to minimize the weighted number of late jobs. An O (n log n) ...

We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a generalization of the well known iterative ...