A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1056670
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Jozef Grabowski / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: New block properties for the permutation flow shop problem with application in tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified simulated annealing algorithms for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem / 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: On the heuristic solution of the permutation flow shop problem by path algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-machine scheduling with release and due dates to minimize maximum lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block approach for single-machine scheduling with release dates and due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank

Latest revision as of 14:14, 7 June 2024

scientific article
Language Label Description Also known as
English
A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
scientific article

    Statements

    A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (English)
    0 references
    0 references
    0 references
    12 November 2004
    0 references
    Flow-shop scheduling
    0 references
    Makespan
    0 references
    Heuristics
    0 references
    Tabu search
    0 references

    Identifiers