Related references
Note: Only part of the references are listed.An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
L Wang et al.
COMPUTERS & OPERATIONS RESEARCH (2006)
Scheduling flow shops using differential evolution algorithm
G Onwubolu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
Some aspects of scatter search in the flow-shop problem
E Nowicki et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2006)
Classification of adaptive memetic algorithms: a comparative study
YS Ong et al.
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS (2006)
A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
DP Ronconi
ANNALS OF OPERATIONS RESEARCH (2005)
Optimal multiobjective planning of large-scale passive harmonic filters using hybrid differential evolution method considering parameter and loading uncertainty
YP Chang et al.
IEEE TRANSACTIONS ON POWER DELIVERY (2005)
Meta-Lamarckian learning in memetic algorithms
YS Ong et al.
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION (2004)
A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
J Grabowski et al.
COMPUTERS & OPERATIONS RESEARCH (2004)
Flow-shop problems with intermediate buffers
P Brucker et al.
OR SPECTRUM (2003)
Differential evolution training algorithm for feed-forward neural networks
J Ilonen et al.
NEURAL PROCESSING LETTERS (2003)
Share Paper
