A new heuristic for the total tardiness problem with parallel machines

Titelaufnahme

Zugriffsbeschränkung

Links

Dateien

Klassifikation

Abstract

Scheduling jobs against due dates is one of the most important and best examined objectives in scheduling theory and practice. In this paper the parallel machine version of the well-known total tardiness problem is considered. The objective is to minimize the total tardiness of the jobs, while for all jobs an individual due date is given. The single machine version has been proven to be NP-hard, hence it is unlikely to find polynomially bounded optimization algorithms. Consequently, we concentrate on developing an efficient heuristic. Our extensive computational results confirm that our new heuristic is capable to deliver near optimal results.

Statistik