An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling (Q342571): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cor.2016.07.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.COR.2016.07.008 / rank | |||
Normal rank | |||
Latest revision as of 14:55, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling |
scientific article |
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
