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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel machines scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for parallel machines scheduling with multiple availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine scheduling with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-machine flowshop scheduling with availability constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for two parallel machines with an availability constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies / rank
 
Normal rank

Latest revision as of 14:19, 31 July 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
    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