Solving multi-objective production scheduling problems with Tabu Search

Solving multi-objective production scheduling problems with Tabu Search

0.00 Avg rating0 Votes
Article ID: iaor2009239
Country: Poland
Volume: 29
Issue: 3
Start Page Number: 819
End Page Number: 828
Publication Date: Jan 2000
Journal: Control and Cybernetics
Authors: , ,
Keywords: decision theory: multiple criteria, optimization, heuristics: tabu search
Abstract:

Most of multiple criteria scheduling problems are NP-hard, so that exact procedures can only solve small problems and with two criteria. The complexity and the diversity of multiple criteria scheduling problems resulted in many alternative approaches to solve them. Exact and approximate procedures proposed in the literature are mainly dedicated to the problem to be solved, and their performance depends on the problem data, on the criteria optimized, and are generally difficult to implement. The authors propose in this paper a Tabu Search approach to multiple criteria scheduling problems. The proposed procedure is a general flexible method, able to solve hard multiple criteria scheduling problems, easy to implement, and providing a set of potential efficient schedules.

Reviews

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