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]

[thumbnail of HalilSen_381561.pdf] PDF
HalilSen_381561.pdf

Download (543kB)

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
Divisions: Faculty of Engineering and Natural Sciences > Academic programs > Manufacturing Systems Eng.
Faculty of Engineering and Natural Sciences
Depositing User: IC-Cataloging
Date Deposited: 12 Dec 2011 14:43
Last Modified: 26 Apr 2022 09:55
URI: https://research.sabanciuniv.edu/id/eprint/17796

Actions (login required)

View Item
View Item