SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
DOI10.1080/01969720902830322zbMATH Open1179.90171OpenAlexW2049349069MaRDI QIDQ3393531FDOQ3393531
Authors: G. I. Zobolas, Christos D. Tarantilis, George Ioannou 
Publication date: 26 August 2009
Published in: Cybernetics and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01969720902830322
Recommendations
- A hybrid genetic algorithm for the open shop scheduling problem
- A hybrid evolutionary algorithm for the job shop scheduling problem
- A genetic algorithm for scheduling open shops with sequence-dependent setup times
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Variable neighborhood search: Principles and applications
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Open Shop Scheduling to Minimize Finish Time
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Benchmarks for basic scheduling problems
- Open-shop scheduling problems with dominated machines
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Constructive heuristic algorithms for the open shop problem
- A genetic algorithm for the job shop problem
- A genetic algorithm for flow shop scheduling problems
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- An effective heuristic for the CLSP with set-up times
- Compiling Finite Linear CSP into SAT
- Classical and new heuristics for the open-shop problem: A computational evaluation
- A branch \(\&\) bound algorithm for the open-shop problem
- Competitive genetic algorithms for the open-shop scheduling problem
- A hybrid genetic algorithm for the open shop scheduling problem
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A tabu search algorithm for the open shop scheduling problem
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- A new lower bound for the open-shop problem
Cited In (10)
- Retraction note to: ``OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- A hybrid evolutionary algorithm for the job shop scheduling problem
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
- The seeds of the NEH algorithm: an overview using bibliometric analysis
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
This page was built for publication: SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393531)
