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

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

0.00 Avg rating0 Votes
Article ID: iaor20083744
Country: Netherlands
Volume: 175
Issue: 1
Start Page Number: 318
End Page Number: 337
Publication Date: Nov 2006
Journal: European Journal of Operational Research
Authors: , ,
Keywords: heuristics: tabu search, programming: multiple criteria
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.

Reviews

Required fields are marked *. Your email address will not be published.