A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
We consider the fuzzy open shop scheduling problem, where task durations are assumed to be ill-known and modelled as triangular fuzzy numbers. We propose a neighbourhood structure for local search procedures, based on reversing critical arcs in the associated disjunctive graph. We provide a thorough theoretical study of the structure and, in particular, prove that feasibility and asymptotic convergence hold. We further illustrate its good behaviour with experimental results obtained bydoi:10.1109/fuzzy.2010.5584235 dblp:conf/fuzzIEEE/RodriguezPVP10 fatcat:4uq2nf4xgvaevbow7keuvywzfi