Planning horizons for multi-item hierarchical production scheduling problems: A heuristic search procedure (Q1107425)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4064749
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Planning horizons for multi-item hierarchical production scheduling problems: A heuristic search procedure |
scientific article; zbMATH DE number 4064749 |
Statements
Planning horizons for multi-item hierarchical production scheduling problems: A heuristic search procedure (English)
0 references
1988
0 references
We develop a direct search procedure for finding planning horizons for a multi-item hierarchical production planning process which consists of an aggregate planning problem and a master production scheduling problem. Experimental results show that the search heuristic is quite efficient in finding planning horizons for both the aggregate planning problem and the master scheduling problem. The results also show that the master schedule planning horizons need not be longer than the aggregate planning horizons.
0 references
heuristics. direct search procedure
0 references
multi-item hierarchical production planning process
0 references
aggregate planning problem
0 references
master production scheduling problem
0 references
0 references
0 references
0 references
0.793172299861908
0 references
0.7796281576156616
0 references
0.7760933041572571
0 references
0.7739772200584412
0 references
