A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (Q2329724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2019.104767 / 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/j.cor.2019.104767 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2967278017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast heuristics for minimizing the makespan in non-permutation flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved NEH-based heuristic for the permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved NEH heuristic to minimize makespan in permutation flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop 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: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New hard benchmark for flowshop scheduling problems minimising makespan / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127366159 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2019.104767 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:06, 18 December 2024

scientific article
Language Label Description Also known as
English
A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective
scientific article

    Statements

    A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective (English)
    0 references
    0 references
    18 October 2019
    0 references
    scheduling
    0 references
    flowshop
    0 references
    heuristics
    0 references
    flow shop
    0 references
    tie-breaking
    0 references
    NEH
    0 references
    iterated greedy
    0 references

    Identifiers