Title of article
Using tabu search to solve the common due date early/tardy machine scheduling problem
Author/Authors
R. J. W. James، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 1997
Pages
10
From page
199
To page
208
Abstract
This article uses tabu search to solve the restricted, common-due-date, early/tardy machine scheduling problem generalised 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 areas of the solution space is the most efficient and effective solution method.
Journal title
Computers and Operations Research
Serial Year
1997
Journal title
Computers and Operations Research
Record number
926816
Link To Document