A simple heuristic for the multi-item single level capacitated lotsizing problem (Q1079109): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-6377(86)90027-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075040992 / rank | |||
Normal rank | |||
Revision as of 19:39, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple heuristic for the multi-item single level capacitated lotsizing problem |
scientific article |
Statements
A simple heuristic for the multi-item single level capacitated lotsizing problem (English)
0 references
1986
0 references
A heuristic algorithm for the solution of the finite horizon multi-item inventory problem is proposed in this paper. Demands are known deterministically and are to be satisfied without backlogging while the order quantities in each period are constrained by a single capacity constraint. The algorithm is claimed to perform better than other existing algorithms with respect to both the computation time and the solution obtained.
0 references
single level capacitated lotsizing
0 references
production smoothing
0 references
heuristic algorithm
0 references
finite horizon multi-item inventory
0 references
