Parallel tabu search algorithm with uncertain data for the flexible job shop problem

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

Abstract

In many real production systems the parameters of individual operations are not deterministic. Typically, they can be modeled by fuzzy numbers or distributions of random variables. In this paper we consider the flexible job shop problem with machine setups and uncertain times of operation execution. Not only we present parallel algorithm on GPU with fuzzy parameters but also we investigate its resistance to random disturbance of the input data.

Cite

CITATION STYLE

APA

Bożejko, W., Uchroński, M., & Wodecki, M. (2016). Parallel tabu search algorithm with uncertain data 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. 9693, pp. 419–428). Springer Verlag. https://doi.org/10.1007/978-3-319-39384-1_36

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