A Computational Study of Lower Bounding Schemes for Total Weighted Tardiness Job SHops

Roland Braune, Günther Zäpfel, Michael Affenzeller

Research output: Chapter in Book/Report/Conference proceedingsConference contribution

2 Citations (Scopus)

Abstract

In this paper, we perform a computational study of lower bounding schemes for job shop scheduling problems under special consideration of total weighted tardiness costs. Due to the characteristics of this objective function, lower bounds are much more difficult to derive than for the classical makespan. On the other hand, the practical relevance of tardiness related costs makes it even more important to have corresponding bounds available, especially for rating the results of approximate optimization approaches. Apart from the quality of the bounds, i.e. the tightness with respective to an existing optimal solution or upper bound, a further important focus of our investigations is the required computation time, since this is a determining criterion for the applicability. Computational results are reported based on selected benchmark problems.

Original languageEnglish
Title of host publication2009 2nd International Symposium on Logistics and Industrial Informatics, LINDI 2009
PublisherIEEE Computer Society Press
Pages102-107
ISBN (Print)9781424439584
DOIs
Publication statusPublished - 2009
EventIEEE 2nd International Symposium on Logistics and Industrial Informatics (LINDI 2009) - Linz, Austria
Duration: 10 Sep 200912 Sep 2009
http://www.fh-ooe.at/lindi2009/

Publication series

Name2009 2nd International Symposium on Logistics and Industrial Informatics, LINDI 2009

Conference

ConferenceIEEE 2nd International Symposium on Logistics and Industrial Informatics (LINDI 2009)
Country/TerritoryAustria
CityLinz
Period10.09.200912.09.2009
Internet address

Fingerprint

Dive into the research topics of 'A Computational Study of Lower Bounding Schemes for Total Weighted Tardiness Job SHops'. Together they form a unique fingerprint.

Cite this