Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (Q398881): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / 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-012-0305-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975498203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / 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: On a routing 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: A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total weighted tardiness in a generalized job shop / 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 genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling shops to minimize the weighted number of late jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global constraint for total weighted completion time for unary resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A large step random walk for minimizing total weighted tardiness in a job shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach for optimizing regular criteria in the job-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for job shop scheduling with tardiness objectives. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An advanced tabu search algorithm for the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very fast TS/SA algorithm for the job shop scheduling problem / 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: An efficient configuration generation mechanism to solve job shop scheduling problems by the simulated annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective / rank
 
Normal rank

Latest revision as of 22:35, 8 July 2024

scientific article
Language Label Description Also known as
English
Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
scientific article

    Statements

    Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation (English)
    0 references
    0 references
    0 references
    0 references
    18 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    job shop scheduling
    0 references
    local search
    0 references
    move evaluation
    0 references
    cost estimation
    0 references
    min-sum objective
    0 references
    0 references
    0 references
    0 references
    0 references