A tabu search approach for the flow shop scheduling problem (Q1296693): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / 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 user's guide to tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Heuristic Algorithm for the Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic for the n-job, M-machine flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision support system for the resource constrained project scheduling 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: On general routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / 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: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(97)00136-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975130490 / rank
 
Normal rank

Latest revision as of 10:59, 30 July 2024

scientific article
Language Label Description Also known as
English
A tabu search approach for the flow shop scheduling problem
scientific article

    Statements

    A tabu search approach for the flow shop scheduling problem (English)
    0 references
    0 references
    2 August 1999
    0 references
    flow shop scheduling
    0 references
    heuristics
    0 references
    tabu search
    0 references

    Identifiers