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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070138302 / rank
 
Normal rank
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: Optimal scheduling for two-processor systems / 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: 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
Property / cites work
 
Property / cites work: A polynomial algorithm for the homogeneously non-idling scheduling problem of unit-time independent jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach to early/tardy scheduling with release dates / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:11, 9 July 2024

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

    Statements

    Identifiers