Please use this persistent identifier to cite or link to this item: doi:10.24405/419
Title: New Instances for the Single Machine Total Weighted Tardiness Problem
Authors: Geiger, Martin Josef 
Language: eng
Keywords: SMTWTP
Subject (DDC): 330 Wirtschaft
Issue Date: 2010
Document Type: Working Paper
Source: Res (2010)
Journal / Series / Working Paper (HSU): Arbeitspapier / Research Paper / Helmut-Schmidt-Universität, Lehrstuhl für Betriebswirtschaftslehre, insbes. Logistik-Management 
Previous research in the single machine total weighted tardiness problem (SMTWTP) has led to the proposition of effective local search strategies. At least existing benchmark instances from the literature do not pose a challenge for state-of-the-art algorithms. --- This paper describes the proposition of two classes of novel instances for the single machine total weighted tardiness problem. In response to preceding research, they are larger, thus harder to search by local search algorithms. Besides, they are computed w.r.t. control parameters that lead to comparable difficult data sets. --- In addition to providing novel instances, we report best known results, which have been computed by a Variable Neighborhood Descent algorithm.
Organization Units (connected with the publication): BWL, insb. Logistik-Management 
Appears in Collections:1 - Open Access Publications (except Theses)

Files in This Item:
File Description SizeFormat
openHSU_419.pdf143.01 kBAdobe PDFView/Open
Show full item record

CORE Recommender

Google ScholarTM


Items in openHSU are protected by copyright, with all rights reserved, unless otherwise indicated.