A polynomial algorithm for a multi-item capacitated production planning problem (Q1316097): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:55, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial algorithm for a multi-item capacitated production planning problem |
scientific article |
Statements
A polynomial algorithm for a multi-item capacitated production planning problem (English)
0 references
14 March 1994
0 references
multi-item
0 references
lot sizing
0 references
computational bound
0 references
production planning
0 references
manufacturing
0 references
polynomial time algorithm
0 references
worst case computational bound
0 references
single machine static scheduling
0 references
