Level scheduling to minimize schedule length on lots of unit-time jobs (Q803029): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Revision as of 16:56, 21 June 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