title   
  

A simple, fast, and effective heuristic for the single-machine total weighted tardiness problem

Şen, Halil (2010) A simple, fast, and effective heuristic for the single-machine total weighted tardiness problem. [Thesis]

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
530Kb

Official URL: http://192.168.1.20/record=b1302918 (Table of Contents)

Abstract

We consider the non-preemptive single-machine total weighted tardiness (TWT) problem with general weights, processing times, and due dates. We first develop a family of preemptive lower bounds for this problem and explore their structural properties. Then, we show that the solution corresponding to the least tight lower-bound among those investigated features some desirable properties that can be exploited to build excellent feasible solutions to the original non-preemptive problem in short computational times. We present results on standard benchmark instances from the literature.

Item Type:Thesis
Uncontrolled Keywords:Single-machine scheduling. -- Weighted tardiness. -- Mathematical programming. -- Transportation problem. -- Heuristics. -- Nested schedule. -- Scheduling. -- Total weighted tardiness. -- Tek-makinalı çizelgeleme. -- Ağırlıklandırılmış gecikme. -- Matematiksel programlama. -- Ulaşım problemi. -- Sezgisel. -- Yuvalanmış çizelge. -- Çizelgeleme. -- Ulaştırma problemi. -- Toplam ağırlıklı gecikme.
Subjects:T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering
ID Code:17796
Deposited By:IC-Cataloging
Deposited On:12 Dec 2011 14:43
Last Modified:05 Jun 2012 16:30

Repository Staff Only: item control page