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

DOI10.1023/B:HEUR.0000045320.79875.e3zbMath1062.90057OpenAlexW2015986526MaRDI 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

metaheuristicstabu searchflowshop schedulingmulti-objective combinatorial optimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (8)

Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation ⋮ A multi-objective model for environmental investment decision making ⋮ 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 ⋮ Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study ⋮ A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria ⋮ Bi-objective parallel machine scheduling with additional resources during setups ⋮ A bi-objective turning restriction design problem in urban road networks

This page was built for publication: An application of a multi-objective tabu search algorithm to a bicriteria flowshop problem