Approximate solutions to the disaggregation problem under uncertainty

• This paper studies the disaggregation problem within a hierarchical production planning framework for the case when demands are random variables with known probability density functions. Three different heuristic allocation rules have been proposed in order to provide approximate solutions to the problem. The numerical study shows that it is possible to obtain fairly good results by using heuristic rules instead of the optimizing routine. The additional decision rule for choosing one plan among the set of plans suggested by the heuristic, seems to play an important role as far as the first two heuristics are concerned. The third heuristic is less sensitive' with respect to the additional decision rule and also performs slightly better than the other two heuristics

Subject headings

TEKNIK OCH TEKNOLOGIER  -- Maskinteknik -- Produktionsteknik, arbetsvetenskap och ergonomi (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Mechanical Engineering -- Production Engineering, Human Work Science and Ergonomics (hsv//eng)

Keyword

Industriell logistik

Industrial Logistics

Publication and Content Type

ref (subject category)

art (subject category)