A tight lower bound for job scheduling with cancellation (Q1044744): Difference between revisions
From MaRDI portal
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.1016/j.ipl.2005.09.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2160705700 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4223058 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing and Combinatorics / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling Broadcasts with Deadlines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On-line scheduling of jobs with fixed start and end times / rank | |||
Normal rank | |||
Latest revision as of 08:17, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight lower bound for job scheduling with cancellation |
scientific article |
Statements
A tight lower bound for job scheduling with cancellation (English)
0 references
18 December 2009
0 references
on-line algorithms
0 references
scheduling
0 references
lower bounds
0 references
