A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times

被引:37
|
作者
Choobineh, F. Fred [1 ]
Mohebbi, Esmail [1 ]
Khoo, Hansen [1 ]
机构
[1] Univ Nebraska, Dept Ind & Management Syst Engn, Lincoln, NE 68588 USA
关键词
scheduling; sequence-dependent setup; multi-objective; tabu search;
D O I
10.1016/j.ejor.2005.04.038
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
An m-objective tabu search algorithm for sequencing of n jobs on a single machine with sequence-dependent setup times is proposed. The algorithm produces a solution set that is reflective of the objectives' weights and close to the best observed values of the objectives. We also formulate a mixed integer linear program to obtain the optimal solution of a three-objective problem. Numerical examples are used to study the behavior of the proposed m-objective tabu search algorithm and compare its solutions with those of the mixed integer linear program. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:318 / 337
页数:20
相关论文
共 50 条