Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (Q342073)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
scientific article

    Statements

    Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness (English)
    0 references
    0 references
    17 November 2016
    0 references
    scheduling
    0 references
    flowshop
    0 references
    heuristics
    0 references
    neh
    0 references
    pfsp
    0 references
    maximum tardiness
    0 references
    makespan
    0 references
    bounded insertion
    0 references
    non-population algorithm
    0 references

    Identifiers