Job shop scheduling by simulated annealing
Operations Research
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A fast taboo search algorithm for the job shop problem
Management Science
Scheduling under Fuzziness
Complex Scheduling (GOR-Publications)
Complex Scheduling (GOR-Publications)
Sensitivity Analysis for the Job Shop Problem with Uncertain Durations and Flexible Due Dates
IWINAC '07 Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Choosing robust solutions in discrete optimization problems with fuzzy costs
Fuzzy Sets and Systems
A multi-objective genetic local search algorithm and itsapplication to flowshop scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Finding multiple possible critical paths using fuzzy PERT
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Semantics of Schedules for the Fuzzy Job-Shop Problem
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Jobshop scheduling with imprecise durations: a fuzzy approach
IEEE Transactions on Fuzzy Systems
Expected value of fuzzy variable and fuzzy expected value models
IEEE Transactions on Fuzzy Systems
Particle swarm optimisation for open shop problems with fuzzy durations
IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I
Combining neighbourhoods in fuzzy job shop problems
CAEPIA'11 Proceedings of the 14th international conference on Advances in artificial intelligence: spanish association for artificial intelligence
Hi-index | 0.00 |
In the sequel, we propose a new neighbourhood structure for local search for the fuzzy job shop scheduling problem. This is a variant of the well-known job shop problem, with uncertainty in task durations modelled using fuzzy numbers and where the goal is to minimise the expected makespan of the resulting schedule. The new neighbourhood structure is based in changing the relative order of subsequences of tasks within critical blocks. We study its theoretical properties and provide a makespan estimate which allows to select only feasible neighbours while covering a greater portion of the search space than a previous neighbourhood from the literature. Despite its larger search domain, experimental results show that this new structure notably reduces the computational load of local search with respect to the previous neighbourhood while maintaining or even improving solution quality.