Home > Research > Publications & Outputs > Stochastic batch-sizing problems

Research

Keywords

View graph of relations

Stochastic batch-sizing problems: Models and algorithms

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Stochastic batch-sizing problems: Models and algorithms. / Lulli, Guglielmo; Sen, Suvrajeet.
In: Operations Research/ Computer Science Interfaces Series, Vol. 22, 01.12.2003, p. 85-103.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Lulli, G & Sen, S 2003, 'Stochastic batch-sizing problems: Models and algorithms', Operations Research/ Computer Science Interfaces Series, vol. 22, pp. 85-103.

APA

Lulli, G., & Sen, S. (2003). Stochastic batch-sizing problems: Models and algorithms. Operations Research/ Computer Science Interfaces Series, 22, 85-103.

Vancouver

Lulli G, Sen S. Stochastic batch-sizing problems: Models and algorithms. Operations Research/ Computer Science Interfaces Series. 2003 Dec 1;22:85-103.

Author

Lulli, Guglielmo ; Sen, Suvrajeet. / Stochastic batch-sizing problems : Models and algorithms. In: Operations Research/ Computer Science Interfaces Series. 2003 ; Vol. 22. pp. 85-103.

Bibtex

@article{a4dc302029c9484fb0191560ed04c14a,
title = "Stochastic batch-sizing problems: Models and algorithms",
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.",
keywords = "Branchand-price algorithm, Probabilistic constraints, Stochastic batch-sizing problem",
author = "Guglielmo Lulli and Suvrajeet Sen",
year = "2003",
month = dec,
day = "1",
language = "English",
volume = "22",
pages = "85--103",
journal = "Operations Research/ Computer Science Interfaces Series",
issn = "1387-666X",
publisher = "Springer Science + Business Media",

}

RIS

TY - JOUR

T1 - Stochastic batch-sizing problems

T2 - Models and algorithms

AU - Lulli, Guglielmo

AU - Sen, Suvrajeet

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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.

AB - 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.

KW - Branchand-price algorithm

KW - Probabilistic constraints

KW - Stochastic batch-sizing problem

M3 - Journal article

AN - SCOPUS:84888770964

VL - 22

SP - 85

EP - 103

JO - Operations Research/ Computer Science Interfaces Series

JF - Operations Research/ Computer Science Interfaces Series

SN - 1387-666X

ER -