Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / 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.2005.07.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064734264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problem difficulty for tabu search in job-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The job shop scheduling problem: Conventional and new solution techniques / 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: Applying tabu search to the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Insertion techniques for the heuristic solution of the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter Search and Path Relinking: Advances and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job-shop scheduling: Computational study of local search and large-step optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4891488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reactive Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A search space analysis of the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of Local Search Algorithms for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facts, Conjectures, and Improvements for Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4460278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search method guided by shifting bottleneck for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic job-shop scheduling: Past, present and future / rank
 
Normal rank

Latest revision as of 13:10, 24 June 2024

scientific article
Language Label Description Also known as
English
Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem
scientific article

    Statements

    Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    16 May 2006
    0 references
    Tabu search
    0 references
    Metaheuristics
    0 references
    Job-shop scheduling
    0 references
    Empirical analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers