A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan

Recommendations

Competitive genetic algorithms for the open-shop scheduling problem
A genetic algorithm for scheduling open shops with sequence-dependent setup times
A hybrid genetic algorithm for the open shop scheduling problem
SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
Open shop scheduling problems with conflict graphs
A genetic algorithm for flow shop scheduling problems
A genetic algorithm for the flowshop scheduling problem
A genetic algorithm to minimize the makespan in the k-stage hybrid flow shop scheduling problem

Cites work

A branch \(\&\) bound algorithm for the open-shop problem
A genetic algorithm for flowshop sequencing
A genetic algorithm for scheduling open shops with sequence-dependent setup times
A genetic algorithm for the proportionate multiprocessor open shop
A hybrid genetic algorithm for the open shop scheduling problem
A method for solving traveling-salesman problems
A new lower bound for the open-shop problem
A new particle swarm optimization for the open shop scheduling problem
A note on greedy algorithms for the maximum weighted independent set problem
A tabu search algorithm for the open shop scheduling problem
A two-level particle swarm optimisation algorithm for open-shop scheduling problem
Algorithms for Solving Production-Scheduling Problems
An Improved Formulation for the Job-Shop Scheduling Problem
An Overview of Scheduling Problems Arising in Satellite Communications
Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
Benchmarks for basic scheduling problems
Competitive genetic algorithms for the open-shop scheduling problem
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
Constructive heuristic algorithms for the open shop problem
Four decades of research on the open-shop scheduling problem to minimize the makespan
scientific article; zbMATH DE number 3150484 (Why is no real title available?)
scientific article; zbMATH DE number 4095196 (Why is no real title available?)
scientific article; zbMATH DE number 3497315 (Why is no real title available?)
scientific article; zbMATH DE number 3639144 (Why is no real title available?)
scientific article; zbMATH DE number 194544 (Why is no real title available?)
scientific article; zbMATH DE number 4115948 (Why is no real title available?)
Large-scale medical examination scheduling technology based on intelligent optimization
New complexity results for shop scheduling problems with agreement graphs
On a conjecture for the university timetabling problem
Open shop scheduling problems with conflict graphs
Open Shop Scheduling to Minimize Finish Time
Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Scheduling
SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
Two-machine open shop problem with agreement graph
Variable neighborhood search: Principles and applications

Cited in

(3)

Retraction note to: ``OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
A genetic algorithm for scheduling open shops with sequence-dependent setup times
OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises

This page was built for publication: A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164629)