Multicriteria Flow Shop Scheduling Problem - Enterprise Information Systems Design, Implementation and Management: Organizational Applications - page 226

references However, to obtain the exact set of PE solutions

for these problems efficiently is not a plausible
accomplishment since the single criterion prob-
lems are NP-hard in itself.
Therefore, it is necessary to distinguish
between two different questions: the first one
is to efficiently solving real problems, whose
complexity is ever increasing; the second one is
focusing on the rigorous mathematical approaches
to find an analytically satisfactory answer to each
problem structure.
About the first question, we think that recent
published results give support to the hypothesis
which states that more hybridized approaches, i.e.
hyperheuristics, perform better than traditional
metaheuristics. MOH combine different heuristic
techniques that are selected according to their
suitability, at each iteration. It is not realistic to
hope for general meta-optimization methods that
solve MOCO problems efficiently. Hyperheuristic
approaches constitute a fruitful line of research.
With respect to the second question, the ex-
haustive theoretical study of the structure and
properties of each problem may be one of the
most challenging goals of MOCO.
Due to the complexity of evaluating the quality
of different algorithms, we include in this paper a
revision of different metrics. In this sense, we want
to emphasize the importance of the useful practice
of reporting a Net set of PE solution obtained for
the benchmark problems of Taillard (1993) by the
algorithms proposed in the corresponding paper.
Moreover, we suggest reporting the following
metrics: Q 1 , Q 2 , C , Dist 1 R and Dist 2 R to evaluate
the different attributes of the proposed methods
(see section 3.4.)

Agrawal, S., Dashora, Y., Tiwari, M. K., &
Son, Y. J. (2008). Interactive Particle Swarm: A
Pareto-Adaptive Metaheuristic to Multiobjective
Optimization. IEEE Transactions on Systems,
Man and Cybernetics - Part A, 38 (2), 258-277.

Aickelin, U. (1999). Genetic Algorithms for
Multiple-Choice Problems . Unpublished doctoral
dissertation, University of Wales, Swansea.

Akers, S. B. (1956). A graphical approach to
production scheduling problems. Operations
Research , 4 , 244-245. doi:10.1287/opre.4.2.244

Andrés, C. (2001) Programación de la Produc-
ción en Talleres de Flujo Híbridos con Tiempos de
Cambio de Partida Dependientes de la Secuencia:
Modelos, Métodos y Algoritmos de Resolución:
Aplicación a Empresas del Sector Cerámico .
Unpublished doctoral dissertation, Universidad
Politécnica de Valencia, Valencia.

Arroyo, J., & Armentano, V. (2005). Genetic
local search for multi-objective flowshop
scheduling problems. European Journal of Op-
erational Research , 167 , 717-738. doi:10.1016/j.
ejor.2004.07.017

Bagchi, T. P. (1999). Multiobjective Scheduling by
Genetic Algorithms . Dordrecht, The Netherlands:
Kluwer Academic Publishers.

Baker, K. R. (1975). A comparative study of flow
shop algorithms. Operations Research , 23 , 62-73.
doi:10.1287/opre.23.1.62

Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G.,
& Weglarz, J. (2007). Handbook on Scheduling .
Berlin: Springer.

AcknoWLedgMent Brucker, P. (1988). An efficient algorithm for the

job-shop problem with two jobs. Computing , 40 ,
353-359. doi:10.1007/BF02276919 This research was in part supported by the Research

Projects ECO2008-05895-C02-02, Ministerio de
Ciencia e Innovación, Spain.

Brucker, P. (2004). Scheduling Algorithms . Berlin:
Springer.