A GRASP based on DE to solve single machine scheduling problem with SDST (Q434179): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6053922 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling single machine
Property / zbMATH Keywords: scheduling single machine / rank
 
Normal rank
Property / zbMATH Keywords
 
greedy randomized adaptive search procedure
Property / zbMATH Keywords: greedy randomized adaptive search procedure / rank
 
Normal rank
Property / zbMATH Keywords
 
differential evolution
Property / zbMATH Keywords: differential evolution / rank
 
Normal rank
Property / zbMATH Keywords
 
sequence-dependent setup times
Property / zbMATH Keywords: sequence-dependent setup times / rank
 
Normal rank
Property / zbMATH Keywords
 
total tardiness
Property / zbMATH Keywords: total tardiness / 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/s10589-010-9333-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043154904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Savings Index Heuristic Algorithm for Flowshop Scheduling with Sequence Dependent Set-up Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP for a difficult single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the total tardiness single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for single machine total tardiness scheduling with sequence dependent setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling under machine breakdown in a continuous process industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in a sequence dependent setup environment with genetic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 10:21, 5 July 2024

scientific article
Language Label Description Also known as
English
A GRASP based on DE to solve single machine scheduling problem with SDST
scientific article

    Statements

    A GRASP based on DE to solve single machine scheduling problem with SDST (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    scheduling single machine
    0 references
    greedy randomized adaptive search procedure
    0 references
    differential evolution
    0 references
    sequence-dependent setup times
    0 references
    total tardiness
    0 references

    Identifiers