Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
482353 | European Journal of Operational Research | 2006 | 20 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
F. Fred Choobineh, Esmail Mohebbi, Hansen Khoo,