Normal-form preemption sequences for an open problem in scheduling theory (Q1702732)
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 6845405
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Normal-form preemption sequences for an open problem in scheduling theory |
scientific article; zbMATH DE number 6845405 |
Statements
Normal-form preemption sequences for an open problem in scheduling theory (English)
0 references
28 February 2018
0 references
preemption
0 references
parallel machines
0 references
in-tree
0 references
release date
0 references
scheduling algorithm
0 references
total completion time
0 references
0 references
0 references
0 references
0.8843051
0 references
0.8768805
0 references
0.87153834
0 references
0.86998045
0 references
0.8694703
0 references
0.8637791
0 references
0 references
0 references
0.86224544
0 references
