An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem

DOI10.1023/B:HEUR.0000045320.79875.e3zbMath1062.90057MaRDI QIDQ1771205

Claudio José Elias Arroyo, Vinicius Amaral Armentano

Publication date: 7 April 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:heur.0000045320.79875.e3

zbMATH Keywords

metaheuristics; tabu search; flowshop scheduling; multi-objective combinatorial optimization

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C29: Multi-objective and goal programming

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem, Scheduling at coal handling facilities using simulated annealing, A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria, Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation, Bi-objective parallel machine scheduling with additional resources during setups, A multi-objective model for environmental investment decision making, A bi-objective turning restriction design problem in urban road networks, Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study