Using tabu search to solve the common due date early/tardy machine scheduling problem

Using tabu search to solve the common due date early/tardy machine scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor19972300
Country: United Kingdom
Volume: 24
Issue: 3
Start Page Number: 199
End Page Number: 208
Publication Date: Mar 1997
Journal: Computers and Operations Research
Authors:
Keywords: heuristics
Abstract:

This article uses tabu search to solve the restricted, common-due-date, early/tardy machine scheduling problem generalized earliness and tardiness penalties. Different forms of the tabu search are tested, including one based on a sequence of jobs solution space and another based on an early/tardy solution space. Results show that a search which uses an early/tardy solution space with a neighbourhood scheme which eliminates infeasible area of the solution space is the most efficient and effective solution method.

Reviews

Required fields are marked *. Your email address will not be published.