A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yun-Qing Rao / rank
Normal rank
 
Property / author
 
Property / author: Yun-Qing Rao / rank
 
Normal rank
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.1016/j.cor.2006.02.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071315752 / 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: The Shifting Bottleneck Procedure for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolution based learning in a job shop scheduling environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two simulated annealing-based heuristics for the job shop scheduling problem / 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: A Fast Taboo Search Algorithm for the Job Shop Problem / 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: Deterministic job-shop scheduling: Past, present and future / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / 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: Q4354785 / 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: 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: Q5692629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search and finite convergence / 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: A Computational Study of 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: Benchmarks for basic scheduling problems / 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

Latest revision as of 10:43, 27 June 2024

scientific article
Language Label Description Also known as
English
A very fast TS/SA algorithm for the job shop scheduling problem
scientific article

    Statements

    A very fast TS/SA algorithm for the job shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Job shop scheduling problem
    0 references
    tabu search
    0 references
    simulated annealing
    0 references
    makespan
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references