SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (Q3393531): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: George Ioannou / rank
Normal rank
 
Property / author
 
Property / author: George Ioannou / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/01969720902830322 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049349069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open-shop scheduling problems with dominated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach / 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 genetic algorithm for flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the resource-constrained project scheduling problem by a variable neighbourhood search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems / 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: A genetic algorithm for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical and new heuristics for the open-shop problem: A computational evaluation / 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: An effective heuristic for the CLSP with set-up times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative improvement approach for the nonpreemptive open 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: Competitive genetic algorithms for the open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling Finite Linear CSP into SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:31, 1 July 2024

scientific article
Language Label Description Also known as
English
SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM
scientific article

    Statements

    SOLVING THE OPEN SHOP SCHEDULING PROBLEM VIA A HYBRID GENETIC-VARIABLE NEIGHBORHOOD SEARCH ALGORITHM (English)
    0 references
    0 references
    0 references
    0 references
    26 August 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    metaheuristics
    0 references
    open shop
    0 references
    production management
    0 references
    scheduling
    0 references
    0 references