Uniform machine scheduling with machine available constraints (Q1568243): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Current trends in deterministic scheduling / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling with incompatible jobs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on ''parallel machine scheduling with non-simultaneous machine available time'' / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel machines scheduling with nonsimultaneous machine available time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4221466 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tighter Bounds for LPT Scheduling on Uniform Processors / rank | |||
Normal rank | |||
Latest revision as of 15:47, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Uniform machine scheduling with machine available constraints |
scientific article |
Statements
Uniform machine scheduling with machine available constraints (English)
0 references
21 June 2000
0 references
heuristic
0 references
uniform machine scheduling
0 references
LPT algorithm
0 references
worst case bound
0 references
linear compound algorithm
0 references
