An effective heuristic algorithm for the partial shop scheduling problem (Q1652579): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CPU Benchmarks / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: irace / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Beam-ACO / 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.1016/j.cor.2018.01.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793088185 / 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: An ant colony optimization algorithm for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / 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: Benchmarks for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the open shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) / 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: Job-shop scheduling with processing alternatives. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Multi-Criterion Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of Flow-Shop, Job-Shop, and Combined Scheduling Problems using MOEAs with Fixed and Variable Length Chromosomes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-stage assembly flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop 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: METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the group shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty years of scheduling: a survey of milestones / 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 simple and effective iterated greedy algorithm for the permutation flowshop scheduling 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 of mixed shop scheduling problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shop scheduling problems under precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic algorithm for the partial shop scheduling problem / rank
 
Normal rank

Latest revision as of 03:16, 16 July 2024

scientific article
Language Label Description Also known as
English
An effective heuristic algorithm for the partial shop scheduling problem
scientific article

    Statements

    An effective heuristic algorithm for the partial shop scheduling problem (English)
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    partial shop scheduling
    0 references
    mixed shop scheduling
    0 references
    group shop scheduling
    0 references
    open shop scheduling
    0 references
    heuristic
    0 references
    iterated tabu search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references