A branch & bound algorithm for the open-shop problem
GO-II Meeting Proceedings of the second international colloquium on Graphs and optimization
A tabu search algorithm for the open shop scheduling problem
Computers and Operations Research
An open shop scheduling problem with fuzzy allowable time and fuzzy resource constraint
Fuzzy Sets and Systems
Computers and Operations Research
A new particle swarm optimization for the open shop scheduling problem
Computers and Operations Research
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
A Genetic Algorithm for the Open Shop Problem with Uncertain Durations
IWINAC '09 Proceedings of the 3rd International Work-Conference on The Interplay Between Natural and Artificial Computation: Part I: Methods and Models in Artificial and Natural Computation. A Homage to Professor Mira's Scientific Legacy
Fast Local Search for Fuzzy Job Shop Scheduling
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in 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
Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.01 |
In this paper we confront a variation of the open shop problem where task durations are allowed to be uncertain and where uncertainty is modelled using fuzzy numbers. We propose a particle swarm optimization (PSO) approach to minimise the expected makespan using priorities to represent particle position, as well as a decoding algorithm to generate schedules in a subset of possibly active ones. Finally, the performance of the PSO is tested on several benchmark problems, modified so as to have fuzzy durations, compared with a memetic algorithm from the literature.