Stochastic batch-sizing problems:Models and algorithms

Lulli, Guglielmo and Sen, Suvrajeet (2003) Stochastic batch-sizing problems:Models and algorithms. Operations Research/ Computer Science Interfaces Series, 22. pp. 85-103. ISSN 1387-666X

Full text not available from this repository.

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.

Item Type:
Journal Article
Journal or Publication Title:
Operations Research/ Computer Science Interfaces Series
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/1800/1803
Subjects:
ID Code:
128788
Deposited By:
Deposited On:
05 Nov 2018 13:30
Refereed?:
Yes
Published?:
Published
Last Modified:
01 Jan 2020 11:38