A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines (Q3602828): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-93980-1_4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2179080494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768123 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling of Equal-Length Jobs on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Hard Deadlines on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Scheduling with Hard Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online, Non-preemptive Scheduling of Equal-Length Jobs on Two Identical Machines / rank
 
Normal rank

Latest revision as of 02:17, 29 June 2024

scientific article
Language Label Description Also known as
English
A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines
scientific article

    Statements