Parallel meta2heuristics for the flexible job shop problem

6Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we consider a double-level metaheuristic optimization algorithm. The algorithm proposed here includes two major modules: the machine selection module which is executed sequentially, and the operation scheduling module executed in parallel. On each level a metaheuristic algorithm is used, so we call this method meta2heuristics. We carry out computational experiment using Graphics Processing Units (GPU). It was possible to obtain new the best known solutions for the benchmark instances from the literature. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Bozejko, W., Uchroński, M., & Wodecki, M. (2010). Parallel meta2heuristics for the flexible job shop problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6114 LNAI, pp. 395–402). https://doi.org/10.1007/978-3-642-13232-2_48

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free