Problem difficulty for tabu search in job-shop scheduling (Q814423): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics / 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: The disjunctive graph machine representation of the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new adaptive multi-start technique for combinatorial global optimizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386971 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems are sometimes hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transitions and the search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic job-shop scheduling: Past, present and future / 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: Determining computational complexity from characteristic ‘phase transitions’ / 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: Q4488090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / 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 by Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank

Latest revision as of 10:59, 24 June 2024

scientific article
Language Label Description Also known as
English
Problem difficulty for tabu search in job-shop scheduling
scientific article

    Statements

    Problem difficulty for tabu search in job-shop scheduling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 February 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Problem difficulty
    0 references
    Job-shop scheduling
    0 references
    Local search
    0 references
    Tabu search
    0 references