A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 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: 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.2005.12.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036942713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving the Job-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the job-shop scheduling problem / 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: 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: A Fast Taboo Search Algorithm for the Job Shop 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: 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: Applying tabu search to the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / 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: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495197 / 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 shop 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
Property / cites work
 
Property / cites work: An experimental analysis of local minima to improve neighbourhood search. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:32, 25 June 2024

scientific article
Language Label Description Also known as
English
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
scientific article

    Statements

    A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 June 2007
    0 references
    0 references
    job shop scheduling problem
    0 references
    makespan
    0 references
    heuristic
    0 references
    tabu search
    0 references
    0 references