Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (Q337268): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Iterated greedy local search methods for unrelated parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrelated parallel machine scheduling using local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / 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: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for makespan minimization on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for the unrelated parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unrelated Parallel Machines Computational Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling tasks on unrelated machines: large neighborhood improvement procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic for minimising makespan on unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality-Based Algorithms for Scheduling Unrelated Parallel Machines / rank
 
Normal rank

Latest revision as of 22:50, 12 July 2024

scientific article
Language Label Description Also known as
English
Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
scientific article

    Statements

    Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    machine scheduling
    0 references
    SAT
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers