On scheduling with the non-idling constraint (Q5925167): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On single-machine scheduling without intermediate delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scheduling with the non-idling constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling for two-processor systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with no idle time and release dates to~minimize a regular criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach to early/tardy scheduling with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling under Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homogeneously non-idling schedules of unit-time jobs on identical parallel machines / rank
 
Normal rank

Latest revision as of 08:40, 12 July 2024

scientific article; zbMATH DE number 6605542
Language Label Description Also known as
English
On scheduling with the non-idling constraint
scientific article; zbMATH DE number 6605542

    Statements

    On scheduling with the non-idling constraint (English)
    0 references
    22 July 2016
    0 references
    0 references
    scheduling
    0 references
    complexity
    0 references
    algorithm
    0 references
    non-idling constraint
    0 references
    0 references