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
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
Fast Local Search for Fuzzy Job Shop Scheduling
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
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
| Hi-index | 0.00 |
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.