An almost exact solution to the min completion time variance in a single machine (Q2239979)
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 7421383
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An almost exact solution to the min completion time variance in a single machine |
scientific article; zbMATH DE number 7421383 |
Statements
An almost exact solution to the min completion time variance in a single machine (English)
0 references
5 November 2021
0 references
scheduling
0 references
single machine
0 references
completion time variance
0 references
optimal sequence characterization
0 references
lower bound
0 references
0 references
0 references
0 references
0 references
0.8336088061332703
0 references
0.83332359790802
0 references
0.8264347314834595
0 references
0.8241779804229736
0 references
0.814851701259613
0 references
