Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / 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: A tabu search algorithm for parallel machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations and the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast neighborhood search for the single machine total weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for single-machine scheduling without machine idle time / rank
 
Normal rank

Latest revision as of 22:07, 5 July 2024

scientific article
Language Label Description Also known as
English
Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem
scientific article

    Statements

    Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    scheduling
    0 references
    tardiness
    0 references
    parallel machines
    0 references
    very large neighborhood
    0 references

    Identifiers