Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1208474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems |
scientific article; zbMATH DE number 1208474 |
Statements
Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (English)
0 references
7 October 1998
0 references
job shop
0 references
flow shop
0 references
resource-constrained scheduling
0 references
makespan
0 references
mean flow time
0 references
weighted number of tardy tasks
0 references
polynomial time algorithms
0 references
multiprocessor tasks
0 references
0.8490053415298462
0 references
0.8343319892883301
0 references
0.8327332139015198
0 references
0.8267121315002441
0 references
