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 this page instead for the normal view: An exact quadratic programming approach based on convex reformulation for seru scheduling problems |
scientific article; zbMATH DE number 7754097
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
