Paper Info
Title
Combining neighbourhoods in fuzzy job shop problems
Abstract
In the sequel, we propose a new neighbourhood structure for local search for the fuzzy job shop scheduling problem, which is a variant of the well-known job shop problem, where uncertain durations are modelled as fuzzy numbers and the objective is to minimise the expected makespan of the resulting schedule. The new neighbourhood structure is based on changing the position of a task in a critical block. We provide feasibility conditions and a makespan estimate which allows to select only feasible and promising neighbours. The experimental results illustrate the success of our proposal in reducing expected makespan within a memetic algorithm. The experiments also show that combining the new structure with an existing neighbourhood from the literature considering both neighborhoods at the same time, provides the best results.
Year
Venue
Keywords
2011
CAEPIA
critical block,expected makespan,fuzzy job shop problem,well-known job shop problem,new neighbourhood structure,fuzzy number,best result,combining neighbourhood,fuzzy job shop scheduling,makespan estimate,existing neighbourhood,new structure
Field
DocType
Volume
Memetic algorithm,Mathematical optimization,Job shop scheduling,Fuzzy logic,Job shop,Flow shop scheduling,Neighbourhood (mathematics),Local search (optimization),Fuzzy number,Mathematics
Conference
7023.0
ISSN
Citations 
PageRank 
0302-9743
0
0.34
References 
Authors
15
3
Name
Order
Citations
PageRank
Jorge Puente117113.16
Camino R. Vela234631.00
Inés González-Rodríguez311510.73