Normal view MARC view

Single machine tardiness sequencing heuristics

Author: Van Wassenhove, Luk N. ; Potts, Christopher N.INSEAD Area: Technology and Operations ManagementIn: IIE Transactions, vol. 23, no. 4, December 1991 Language: EnglishDescription: p. 346-354.Type of document: INSEAD ArticleNote: Please ask the Library for this articleAbstract: This paper presents a collection of heuristics for the single machine total (weighted) tardiness problem. The methods considered range from simple, quick and dirty heuristics to more sophisticated algorithms exploiting problem structure. These heuristics are compared to interchange and simulated annealing methods on a large set of test problems. For the total tardiness problem a heuristic based on decomposition performs very well, whereas for the total weighted tardiness problem simulated annealing appears to be a viable approach. Our computational results also indicate that straightforward interchange methods perform remarkably well
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Call number Status Date due
INSEAD Article Doriot Library
Available

Please ask the Library for this article

This paper presents a collection of heuristics for the single machine total (weighted) tardiness problem. The methods considered range from simple, quick and dirty heuristics to more sophisticated algorithms exploiting problem structure. These heuristics are compared to interchange and simulated annealing methods on a large set of test problems. For the total tardiness problem a heuristic based on decomposition performs very well, whereas for the total weighted tardiness problem simulated annealing appears to be a viable approach. Our computational results also indicate that straightforward interchange methods perform remarkably well

Digitized

There are no comments for this item.

Log in to your account to post a comment.
Koha 3.18 - INSEAD Library Catalogue
Library Home | Contact Us | What's Koha?