Combining Neighbourhoods in Fuzzy Job Shop Problems

  title={Combining Neighbourhoods in Fuzzy Job Shop Problems},
  author={Jorge Puente and Camino R. Vela and In{\'e}s Gonz{\'a}lez Rodr{\'i}guez},
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… 
1 Citations

The Fuzzy Optimization Algorithm to Solve Customer’s Highest Satisfaction Under Fuzzy Time

The scheduling model under uncertain situation based on fuzzy mathematics is established and a novel hybrid algorithm is obtained through improving the mutation operation of genetic algorithm on the basis of simulated annealing algorithm.



Fast Local Search for Fuzzy Job Shop Scheduling

Experimental results show that this new structure for local search for the fuzzy job shop scheduling problem notably reduces the computational load of local search with respect to the previous neighbourhood while maintaining or even improving solution quality.

Improved Local Search for Job Shop Scheduling with uncertain Durations

Theoretical results show that the proposed neighbourhood contains all the improving solutions from the original neighbourhood and provide a sufficient condition for optimality, and a makespan lower bound is proposed which can be used to discard neighbours.

A New Local Search for the Job Shop Problem with Uncertain Durations

A theoretical analysis of the proposed structure for local search, based on a new definition of critical path for fuzzy durations, shows that it improves a previous one from the literature and shows that feasibility and connectivity hold, these being two highly desirable properties.

Semantics of Schedules for the Fuzzy Job-Shop Problem

The aim is to provide a semantics for this type of problems and use this semantics in a methodology to analyze, evaluate, and, therefore, compare solutions to find solutions.

Heuristic local search for fuzzy open shop scheduling

A thorough theoretical study of the neighbourhood structure for local search procedures, based on reversing critical arcs in the associated disjunctive graph, is provided and it is proved that feasibility and asymptotic convergence hold.

A Very Fast Tabu Search Algorithm for Job Shop Problem

This paper deals with the classic job-shop scheduling problem with makespan criterion with some new properties of the problem associated with blocks, and proposes a new, very fast local search procedure based on a tabu search approach.

Accessing feasible space in a generalized job shop scheduling problem with the fuzzy processing times: a fuzzy-neural approach

The computational results show that the proposed neural approach is able to find good solutions in reasonable time and can be adaptively adjusted with weights of connections based on sequence resource and uncertain processing time constraints of the GJSSP during its processing.

Jobshop scheduling with imprecise durations: a fuzzy approach

The determination of a unique optimal solution of the problem is discussed, a meta-heuristic is cast (simulated annealing-SA) to this particular framework for optimization and the obtained schedule remains feasible for all realizations of the operations durations.

Job Shop Scheduling by Simulated Annealing

An approximation algorithm based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems, that can find shorter makespans than two recent approximation approaches that are more tailored to the job shop scheduling problem.

Parallel Taboo Search Techniques for the Job Shop Scheduling Problem

A fast parallel algorithm is given that provides good solutions to very large problems in a very short computation time and identifies a type of problem for which taboo search provides an optimal solution in a polynomial mean time in practice.