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

DOI10.1016/j.cor.2023.106247OpenAlexW4366085030MaRDI QIDQ6164629

Nour El Houda Tellache, Laoucine Kerbache

Publication date: 4 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106247

zbMATH Keywords

schedulinggenetic algorithmsmakespanopen shoplower boundsMILPconflict graphs

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic algorithm for the proportionate multiprocessor open shop
• A tabu search algorithm for the open shop scheduling problem
• Constructive heuristic algorithms for the open shop problem
• A genetic algorithm for flowshop sequencing
• 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
• Large-scale medical examination scheduling technology based on intelligent optimization
• Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling
• A note on greedy algorithms for the maximum weighted independent set problem
• A new lower bound for the open-shop problem
• On a conjecture for the university timetabling problem
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• A two-level particle swarm optimisation algorithm for open-shop scheduling problem
• New complexity results for shop scheduling problems with agreement graphs
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A genetic algorithm for scheduling open shops with sequence-dependent setup times
• Two-machine open shop problem with agreement graph
• Open shop scheduling problems with conflict graphs
• Benchmarks for basic scheduling problems
• A new particle swarm optimization for the open shop scheduling problem
• SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
• An Improved Formulation for the Job-Shop Scheduling Problem
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An Overview of Scheduling Problems Arising in Satellite Communications
• A Method for Solving Traveling-Salesman Problems
• Algorithms for Solving Production-Scheduling Problems
• Scheduling
• Variable neighborhood search: Principles and applications

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