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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q807380
Property / author
 
Property / author: Eldon A. Gunn / rank
Normal rank
 

Revision as of 03:54, 21 February 2024

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
    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