The considered problem is the scheduling of a set of N jobs on M identical parallel machines in order to minimize the total tardiness without any preemption or splitting. Each job has its own processing time, release date and due date. All the machines are considered identical (with same speed) and available during all the scheduling period. This problem is NP-hard. An exact resolution, an Ant ...

For five single machine total tardiness problems a fully polynomial-time approximation scheme (FPTAS) based on a graphical algorithm is presented. The FPTAS has the best running time among the known approximation schemes for these problems.

This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed integer programming model capable of solving small sized problems is described. Several heuristic algorithm...

0377-2217/$ see front matter 2009 Elsevier B.V. A doi:10.1016/j.ejor.2009.04.007 * Tel.: +1 305 348 3309; fax: +1 305 348 4126. E-mail address: [email protected] We review the latest theoretical developments for the single-machine total tardiness 1== T scheduling problem and propose extensions to some of them. We also review (and in some cases extend) exact algorithms, fully polynomial time appr...