Unrelated parallel machine scheduling using local search (Q1341398): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Chris N. Potts / rank
Normal rank
 
Property / author
 
Property / author: Chris N. Potts / 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/0895-7177(94)90205-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968762474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality-Based Algorithms for Scheduling Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Tasks on Unrelated Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a linear programming heuristic for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of a scheduling algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the Efficiency of Tabu Search for Machine Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / 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: Applying tabu search to 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: New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling / 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 Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing: A tool for operational research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785827 / 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: The tabu search metaheuristic: How we used it / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms: Foundations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of an annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved annealing scheme for the QAP / 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: Genetic local search in combinatorial optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:07, 23 May 2024

scientific article
Language Label Description Also known as
English
Unrelated parallel machine scheduling using local search
scientific article

    Statements

    Unrelated parallel machine scheduling using local search (English)
    0 references
    0 references
    0 references
    0 references
    11 January 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    local search
    0 references
    simulated annealing
    0 references
    taboo search
    0 references
    approximate solutions
    0 references
    genetic algorithms
    0 references
    unrelated parallel machines
    0 references
    maximum completion time
    0 references
    hybrid method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references