A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2023.106247 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4366085030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for scheduling open shops with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four decades of research on the open-shop scheduling problem to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beam-ACO--hybridizing ant colony optimization with beam search: an application to open shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive heuristic algorithms for the open shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \(\&\) bound algorithm for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Method for Solving Traveling-Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4730766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Solving Production-Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound for the open-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture for the university timetabling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Formulation for the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid genetic algorithm for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the proportionate multiprocessor open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-level particle swarm optimisation algorithm for open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Overview of Scheduling Problems Arising in Satellite Communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive genetic algorithms for the open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on greedy algorithms for the maximum weighted independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new particle swarm optimization for the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New complexity results for shop scheduling problems with agreement graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling problems with conflict graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine open shop problem with agreement graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large-scale medical examination scheduling technology based on intelligent optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:11, 1 August 2024

scientific article; zbMATH DE number 7706750
Language Label Description Also known as
English
A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
scientific article; zbMATH DE number 7706750

    Statements

    A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (English)
    0 references
    0 references
    0 references
    4 July 2023
    0 references
    scheduling
    0 references
    open shop
    0 references
    conflict graphs
    0 references
    makespan
    0 references
    MILP
    0 references
    lower bounds
    0 references
    genetic algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers