Semi-on-line problems on two identical machines with combined partial information (Q1870021): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimal on-line parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal on-line scheduling for maximizing the minimum machine completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line scheduling on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi on-line algorithms for the partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal algorithms for parallel machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-online scheduling with decreasing job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-on-line scheduling with ordinal data on two uniform machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on on-line scheduling with partial information / rank
 
Normal rank

Latest revision as of 15:42, 5 June 2024

scientific article
Language Label Description Also known as
English
Semi-on-line problems on two identical machines with combined partial information
scientific article

    Statements