A better lower bound for on-line scheduling (Q1327292): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q127323639, #quickstatements; #temporary_batch_1722288576454 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)00026-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993134505 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3031924 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4335203 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3339651 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3858002 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q127323639 / rank | |||
Normal rank | |||
Latest revision as of 22:34, 29 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A better lower bound for on-line scheduling |
scientific article |
Statements
A better lower bound for on-line scheduling (English)
0 references
15 June 1994
0 references
\(m\)-machine scheduling problem
0 references
