New upper and lower bounds for online scheduling with machine cost (Q429648): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: György Dósa / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2010.02.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988286942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line scheduling revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized online scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for the Online Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Online Algorithms for Scheduling with Machine Cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive online algorithms for scheduling with machine cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with machine cost and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with machine cost and rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with general machine cost functions / rank
 
Normal rank

Latest revision as of 09:37, 5 July 2024

scientific article
Language Label Description Also known as
English
New upper and lower bounds for online scheduling with machine cost
scientific article

    Statements

    Identifiers