Normal view MARC view

Local search heuristics for single machine tardiness sequencing

Author: Crauwels, H. A. J ; Potts, C. N. ; Van Wassenhove, Luk N.INSEAD Area: Technology and Operations Management Series: Working Paper ; 94/52/TM Publisher: Fontainebleau : INSEAD, 1994.Language: EnglishDescription: 15 p.Type of document: INSEAD Working Paper Online Access: Click here Abstract: This paper presents several local search heuristics for the problem of scheduling a single machine to minimize total weighted tardiness. A genetic algorithm is developed which employs a new binary encoding scheme to represent solutions and uses a heuristic method to convert the representation into a sequence. This algorithm is compared to descent, simulated annealing and tabu search methods on a large set of test problems. The computational results indicate that tabu search performs better than the order two neighbourhood search methods. However, the genetic algorithm generally produces superior solutions and it also appears to be a robust heuristic
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Collection Call number Status Date due
INSEAD Working Paper Digital Library
PDF Available

This paper presents several local search heuristics for the problem of scheduling a single machine to minimize total weighted tardiness. A genetic algorithm is developed which employs a new binary encoding scheme to represent solutions and uses a heuristic method to convert the representation into a sequence. This algorithm is compared to descent, simulated annealing and tabu search methods on a large set of test problems. The computational results indicate that tabu search performs better than the order two neighbourhood search methods. However, the genetic algorithm generally produces superior solutions and it also appears to be a robust heuristic

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?