A problem space algorithm for single machine weighted tardiness problems

Date
2003
Authors
Avcı, S.
Aktürk, M. S.
Storer, R. H.
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
IIE Transactions (Institute of Industrial Engineers)
Print ISSN
0740-817X
Electronic ISSN
1545-8830
Publisher
Taylor & Francis Inc.
Volume
35
Issue
5
Pages
479 - 486
Language
English
Journal Title
Journal ISSN
Volume Title
Series
Abstract

We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood structure of the search space. They are also a powerful exploitation (intensifying) tool since the global optimum is one of the local optimum solutions. Furthermore, the problem space search method significantly enhances the exploration (diversification) capability of the genetic algorithm. In summary, we can improve both solution quality and robustness over the other local search algorithms reported in the literature.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)