Time-flexible min completion time variance in a single machine by quadratic programming (Q6090146)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Time-flexible min completion time variance in a single machine by quadratic programming |
scientific article; zbMATH DE number 7764636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-flexible min completion time variance in a single machine by quadratic programming |
scientific article; zbMATH DE number 7764636 |
Statements
Time-flexible min completion time variance in a single machine by quadratic programming (English)
0 references
14 November 2023
0 references
scheduling
0 references
time-flexibility
0 references
completion time variance
0 references
optimal sequence characterization
0 references
lower bound
0 references
0 references
