A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2013.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2135743864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop-scheduling problems with makespan criterion: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note: On the two-machine no-idle flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop/no-idle scheduling to minimise the mean flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop/no-idle scheduling to minimize total elapsed time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On no-wait and no-idle flow shops with makespan criterion / 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 simple and effective iterated greedy algorithm for the permutation flowshop 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: A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood 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

Latest revision as of 21:38, 12 July 2024

scientific article
Language Label Description Also known as
English
A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
scientific article

    Statements

    A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    differential evolution algorithm
    0 references
    iterated greedy algorithm
    0 references
    no-idle permutation flowshop scheduling problem
    0 references
    heuristic optimization
    0 references

    Identifiers