Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints (Q5879664)

From MaRDI portal
Revision as of 14:19, 31 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7658673
Language Label Description Also known as
English
Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints
scientific article; zbMATH DE number 7658673

    Statements

    Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2023
    0 references
    parallel machines
    0 references
    availability constraints
    0 references
    makespan
    0 references
    scheduling
    0 references
    semi-resumable jobs
    0 references
    non-resumable jobs
    0 references

    Identifiers