Ant colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling problem
Item Links
URI: http://hdl.handle.net/10818/55746Visitar enlace: https://link.springer.com/arti ...
ISSN: 0956-5515
DOI: 10.1007/s10845-009-0370-y
Compartir
Statistics
View Usage StatisticsBibliographic cataloging
Show full item recordDate
2011Abstract
We consider the problem of scheduling jobs in
a hybrid flowshop with two stages. Our objective is to minimize both the makespan and the total completion time of
jobs. This problem has been little studied in the literature. To
solve the problem, we propose an ant colony optimization
procedure. Computational experiments are conducted using
random-generated instances from the literature. In comparison against other well-known heuristics from the literature,
experimental results show that our algorithm outperforms
such heuristics.
Ubication
Journal of Intelligent Manufacturing, Vol 22 Núm (5), pág 815-822;