|
Abstract: The
job-shop scheduling problem (JSS) is NP-hard. Traditional algorithms
have their features and disadvantages. The powerful system processing
capabilities of the immune system provide rich metaphors for its
artificial counterpart. As a result, immune algorithm has emerged, and
gradually been applied to many engineering practices. Due to the
stubborn nature of the JSS, a dynamic evaluation based immune algorithm
(DEIA) is initially brought forward to solve JSS. The JSS model is set
up, and the antibody is constructed. By simulations of FT10×10
benchmark problem and comparisons with other algorithms, the proposed
DEIA proves to be efficient in solving JSS.
Key
words: Dynamic
evaluation based immune algorithm (DEIA) Job-shop scheduling FT10×10
Temporary solution group
CLC No: TP278
TP301.6
国家自然科学基金(69984004)、863计划基金(2001AA412150，
2003AA411110)和博士点基金(20040699025)资助项目.
Received 20040520, received in revised form 20040925 |