A new heuristic for the total tardiness problem with parallel machines

Biskup D, Herrmann J (2007) Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld.
Bielefeld: Universität Bielefeld.

Download
OA
Working Paper | Published | English
Author
;
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.
Publishing Year
PUB-ID

Cite this

Biskup D, Herrmann J. A new heuristic for the total tardiness problem with parallel machines. Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld. Bielefeld: Universität Bielefeld; 2007.
Biskup, D., & Herrmann, J. (2007). A new heuristic for the total tardiness problem with parallel machines (Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld). Bielefeld: Universität Bielefeld.
Biskup, D., and Herrmann, J. (2007). A new heuristic for the total tardiness problem with parallel machines. Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld, Bielefeld: Universität Bielefeld.
Biskup, D., & Herrmann, J., 2007. A new heuristic for the total tardiness problem with parallel machines, Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld, Bielefeld: Universität Bielefeld.
D. Biskup and J. Herrmann, A new heuristic for the total tardiness problem with parallel machines, Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld, Bielefeld: Universität Bielefeld, 2007.
Biskup, D., Herrmann, J.: A new heuristic for the total tardiness problem with parallel machines. Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld. Universität Bielefeld, Bielefeld (2007).
Biskup, Dirk, and Herrmann, Jan. A new heuristic for the total tardiness problem with parallel machines. Bielefeld: Universität Bielefeld, 2007. Discussion paper / Fakultät für Wirtschaftswissenschaften, Universität Bielefeld.
Main File(s)
File Name
Access Level
OA Open Access

This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar