SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
From MaRDI portal
Publication:3393531
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
Cites work
- A Computational Study of Local Search Algorithms for Job Shop Scheduling
- A branch \(\&\) bound algorithm for the open-shop problem
- A genetic algorithm for flow shop scheduling problems
- A genetic algorithm for the job shop problem
- A hybrid genetic algorithm for the open shop scheduling problem
- A new lower bound for the open-shop problem
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem
- A tabu search algorithm for the open shop scheduling problem
- An effective heuristic for the CLSP with set-up times
- An iterative improvement approach for the nonpreemptive open shop scheduling problem
- Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
- Benchmarks for basic scheduling problems
- Classical and new heuristics for the open-shop problem: A computational evaluation
- Competitive genetic algorithms for the open-shop scheduling problem
- Compiling Finite Linear CSP into SAT
- Constructive heuristic algorithms for the open shop problem
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- Open Shop Scheduling to Minimize Finish Time
- Open-shop scheduling problems with dominated machines
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Solving the resource-constrained project scheduling problem by a variable neighbourhood search.
- Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems
- Variable neighborhood search: Principles and applications
Cited in
(10)- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- Retraction note to: ``OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- The seeds of the NEH algorithm: an overview using bibliometric analysis
- A hybrid evolutionary algorithm for the job shop scheduling problem
- Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan
- METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions
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)
