How much can lookahead help in online single machine scheduling (Q963335): 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.2007.10.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2163453902 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4223058 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Online Scheduling with Hard Deadlines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On-line scheduling on a single machine: Maximizing the number of early jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A look-ahead heuristic for scheduling jobs with release dates on a single machine / rank | |||
Normal rank | |||
Latest revision as of 17:31, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How much can lookahead help in online single machine scheduling |
scientific article |
Statements
How much can lookahead help in online single machine scheduling (English)
0 references
19 April 2010
0 references
online strategies
0 references
scheduling
0 references
lookahead
0 references
