Level scheduling to minimize schedule length on lots of unit-time jobs (Q803029): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4079074 / 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: Linear-Time Algorithms for Scheduling on Parallel Processors / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057624 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(91)90097-f / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2034035806 / rank | |||
Normal rank | |||
Latest revision as of 10:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Level scheduling to minimize schedule length on lots of unit-time jobs |
scientific article |
Statements
Level scheduling to minimize schedule length on lots of unit-time jobs (English)
0 references
1991
0 references
parallel machines
0 references
polynomial-time algorithm
0 references
level scheduling
0 references
0 references
