Competitive genetic algorithms for the open-shop scheduling problem
From MaRDI portal
Publication:1401639
DOI10.1007/s001860000090zbMath1023.90030OpenAlexW2054045702MaRDI QIDQ1401639
Publication date: 18 August 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860000090
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A simple and effective evolutionary algorithm for the vehicle routing problem, A new particle swarm optimization for multi-objective open shop scheduling, New efficient heuristics for scheduling open shops with makespan minimization, Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, An effective heuristic algorithm for the partial shop scheduling problem, 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, A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan, A tabu search approach for proportionate multiprocessor open shop scheduling, OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises, Four decades of research on the open-shop scheduling problem to minimize the makespan, A new particle swarm optimization for the open shop scheduling problem, The museum visitor routing problem, Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling, Solving the open shop scheduling problem, Dynamic programming approach for solving the open shop problem, Order acceptance using genetic algorithms, A contribution and new heuristics for open shop scheduling, An Optimal Constraint Programming Approach to the Open-Shop Problem, SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM, Local search with constraint propagation and conflict-based heuristics
