A cyclical scheduling heuristic for lot sizing with capacity constraints (Q3330960): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/00207548408942499 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1988383428 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalized upper bounding techniques / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Efficient Algorithm for Multi-Item Scheduling / rank | |||
Normal rank | |||
Latest revision as of 13:18, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cyclical scheduling heuristic for lot sizing with capacity constraints |
scientific article |
Statements
A cyclical scheduling heuristic for lot sizing with capacity constraints (English)
0 references
1984
0 references
lot sizing with capacity constraints
0 references
heuristic procedure
0 references
cyclical scheduling
0 references
near optimal solutions
0 references
