On-line scheduling on parallel machines to minimize the makespan (Q328085): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6641270 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
lower bound | |||
| Property / zbMATH Keywords: lower bound / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
on-line algorithm | |||
| Property / zbMATH Keywords: on-line algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
scheduling | |||
| Property / zbMATH Keywords: scheduling / rank | |||
Normal rank | |||
Revision as of 04:28, 28 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On-line scheduling on parallel machines to minimize the makespan |
scientific article |
Statements
On-line scheduling on parallel machines to minimize the makespan (English)
0 references
20 October 2016
0 references
lower bound
0 references
on-line algorithm
0 references
scheduling
0 references
