An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Competitiveness of On-Line Assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A POSTERIOR COMPETITIVENESS FOR LIST SCHEDULING ALGORITHM ON MACHINES WITH ELIGIBILITY CONSTRAINTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal online algorithms for scheduling on two identical machines under a grade of service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online and semi-online scheduling of two machines under a grade of service provision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling on parallel machines with two goS levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for online scheduling with eligibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of two job types on a set of multipurpose machines with unit processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unit length jobs on parallel machines with lookahead information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online parallel machines scheduling with two hierarchies / rank
 
Normal rank

Latest revision as of 00:19, 6 July 2024

scientific article
Language Label Description Also known as
English
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
scientific article

    Statements

    Identifiers