Blocks for the flow shop scheduling problem with uncertain parameters

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

Abstract

We consider a fuzzy variant of the permutational flow shop scheduling problem in which uncertain values of operations durations are represented by fuzzy numbers. Since even deterministic problem is strongly NP-hard, we propose a tabu search based metaheuristics with the new fuzzy blocks properties for neighborhood searching acceleration.

Cite

CITATION STYLE

APA

Bożejko, W., Gniewkowski, Ł., & Wodecki, M. (2017). Blocks for the flow shop scheduling problem with uncertain parameters. In Advances in Intelligent Systems and Computing (Vol. 577, pp. 703–711). Springer Verlag. https://doi.org/10.1007/978-3-319-60699-6_68

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