SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
From MaRDI portal
Publication:3393531
DOI10.1080/01969720902830322zbMath1179.90171OpenAlexW2049349069MaRDI QIDQ3393531
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
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ The seeds of the NEH algorithm: an overview using bibliometric analysis ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
Cites Work
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Classical and new heuristics for the open-shop problem: A computational evaluation
- A tabu search algorithm for the open shop scheduling problem
- Constructive heuristic algorithms for the open shop problem
- A genetic algorithm for the job shop problem
- A branch \(\&\) bound algorithm for the open-shop problem
- Competitive genetic algorithms for the open-shop scheduling problem
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- A hybrid genetic algorithm for the open shop scheduling problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- A new lower bound for the open-shop problem
- Benchmarks for basic scheduling problems
- Compiling Finite Linear CSP into SAT
- Open-shop scheduling problems with dominated machines
- Open Shop Scheduling to Minimize Finish Time
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A genetic algorithm for flow shop scheduling problems
- An effective heuristic for the CLSP with set-up times
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- Variable neighborhood search: Principles and applications
This page was built for publication: SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
