An improved lower bound for rank four scheduling (Q1785250): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Minimum Makespan Scheduling with Low Rank Processing Times / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the optimality of approximation schemes for the classical scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal rounding gives a better approximation for scheduling unrelated machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simplified NP-complete satisfiability problem / rank | |||
Normal rank | |||
Latest revision as of 17:44, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved lower bound for rank four scheduling |
scientific article |
Statements
An improved lower bound for rank four scheduling (English)
0 references
28 September 2018
0 references
complexity
0 references
APX-hardness
0 references
scheduling
0 references
0 references
