An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571)
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 approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling |
scientific article; zbMATH DE number 6654251
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling |
scientific article; zbMATH DE number 6654251 |
Statements
An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (English)
0 references
17 November 2016
0 references
production planning and scheduling
0 references
integer linear programming
0 references
network flow models
0 references
0 references
0 references
0 references
0.7922762632369995
0 references
0.7888548970222473
0 references
0.7734906673431396
0 references
0.7560597658157349
0 references
0.7513978481292725
0 references
