Home > Research > Publications & Outputs > Stochastic batch-sizing problems
View graph of relations

Stochastic batch-sizing problems: Models and algorithms

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
<mark>Journal publication date</mark>1/12/2003
<mark>Journal</mark>Operations Research/ Computer Science Interfaces Series
Volume22
Number of pages19
Pages (from-to)85-103
Publication StatusPublished
<mark>Original language</mark>English

Abstract

In this paper we study the stochastic batch sizing problems. We provide a unifying treatment of the problem, in which we formulate a multi-stage recourse problem as well as a probabilistically constrained problem. The solution approach that we adopt for these problems may be classified as a branch and price (B&P) method. Through our computational experiments turns out that the proposed B&P methodology is quite effective for the recourse constrained model. We also demonstrate how tradeoffs between cost and reliability can be investigated for the stochastic batch-sizing problem.