A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (Q1761140): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.2011.10.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083933508 / 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: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: The flow shop problem with no-idle constraints: a review and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / 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: On no-wait and no-idle flow shops with makespan criterion / 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: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / 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
Property / cites work
 
Property / cites work: Scheduling flow shops using differential evolution algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some local search algorithms for no-wait flow-shop problem with makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved NEH heuristic to minimize makespan in permutation flow shops / rank
 
Normal rank

Latest revision as of 21:45, 5 July 2024

scientific article
Language Label Description Also known as
English
A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion
scientific article

    Statements

    A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    no-idle flow shop
    0 references
    scheduling
    0 references
    differential evolution
    0 references
    speed-up
    0 references
    insert neighborhood
    0 references
    local search
    0 references
    0 references