An exact quadratic programming approach based on convex reformulation for <i>seru</i> scheduling problems (Q6078600)
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 7754097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact quadratic programming approach based on convex reformulation for <i>seru</i> scheduling problems |
scientific article; zbMATH DE number 7754097 |
Statements
An exact quadratic programming approach based on convex reformulation for <i>seru</i> scheduling problems (English)
0 references
24 October 2023
0 references
earliness and tardiness
0 references
just-in-time
0 references
nonconvex optimization
0 references
nonlinear programming
0 references
production revolution
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.785971462726593
0 references
0.7855400443077087
0 references
0.7804224491119385
0 references
0.7626201510429382
0 references
0.7389897108078003
0 references
