An advanced tabu search algorithm for the job shop problem (Q2464439): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JOBSHOP / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-005-6364-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2087138863 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Study of 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: The job shop scheduling problem: Conventional and new solution techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of shifting bottleneck procedures for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation techniques for the disjunctive scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation and problem decomposition: A preprocessing procedure for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3824095 / 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: New and ``stronger'' job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996) / 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: A tabu search method guided by shifting bottleneck for the job shop scheduling problem / 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: Q2711197 / 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 14:31, 27 June 2024

scientific article
Language Label Description Also known as
English
An advanced tabu search algorithm for the job shop problem
scientific article

    Statements

    An advanced tabu search algorithm for the job shop problem (English)
    0 references
    0 references
    0 references
    20 December 2007
    0 references
    0 references
    job shop scheduling
    0 references
    makespan
    0 references
    tabu search
    0 references
    path relinking
    0 references
    0 references
    0 references
    0 references