Hostname: page-component-8448b6f56d-mp689 Total loading time: 0 Render date: 2024-04-16T19:17:42.685Z Has data issue: false hasContentIssue false
  • English
  • Français

MINIMIZING MAKESPAN IN A MULTICLASS FLUID NETWORK WITH PARAMETER UNCERTAINTY

Published online by Cambridge University Press:  30 April 2009

Burak Büke ,
John J. Hasenbein  and
David P. Morton
Burak Büke
Affiliation:
Graduate Program in Operations Research & Industrial Engineering, Department of Mechanical Engineering, The University of  Texas at Austin, Austin, TX 78712-0292 E-mail: bukeb@mail.utexas.edu; jhas@mail.utexas.edu; morton@mail.utexas.edu
John J. Hasenbein
Affiliation:
Graduate Program in Operations Research & Industrial Engineering, Department of Mechanical Engineering, The University of  Texas at Austin, Austin, TX 78712-0292 E-mail: bukeb@mail.utexas.edu; jhas@mail.utexas.edu; morton@mail.utexas.edu
David P. Morton
Affiliation:
Graduate Program in Operations Research & Industrial Engineering, Department of Mechanical Engineering, The University of  Texas at Austin, Austin, TX 78712-0292 E-mail: bukeb@mail.utexas.edu; jhas@mail.utexas.edu; morton@mail.utexas.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

We introduce and investigate a new type of decision problem related to multiclass fluid networks. Optimization problems arising from fluid networks with known parameters have been studied extensively in the queueing, scheduling, and optimization literature. In this article, we explore the makespan problem in fluid networks, with the assumption that the parameters are known only through a probability distribution. Thus, the decision maker does not have complete knowledge of the parameters in advance. This problem can be formulated as a stochastic nonlinear program. We provide necessary and sufficient feasibility conditions for this class of problems. We also derive a number of other structural results that can be used in developing effective computational procedures for solving stochastic fluid makespan problems.

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 23 , Issue 3 , July 2009 , pp. 457 - 480
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1.Anderson, E.J. & Nash, P. (1987). Linear programming in infinite dimensional spaces. New York: Wiley-Interscience.Google Scholar
2.Anick, D., Mitra, D. & Sondhi, M.M. (1982). Stochastic theory of a data-handling system with multiple sources. Bell System Technical Journal 61(8): 1871–1894.CrossRefGoogle Scholar
3.Atlason, J., Epelman, M. & Henderson, S. (2008). Optimizing call center staffing using simulation and analytic center cutting plane methods. Management Science 54: 295–309.CrossRefGoogle Scholar
4.Avram, F., Bertsimas, D. & Ricard, M. (1995). Fluid models of sequencing problems in open queueing networks; an optimal control approach. In Kelly, F.P. & Williams, R.J. (eds.), Stochastic networks, IMA Volumes in Mathematics and its Applications, Vol. 71. New York: Springer-Verlag, pp. 199–237.CrossRefGoogle Scholar
5.Bäuerle, N. (2001). Convex stochastic fluid programs with average cost. Journal of Mathematical Analysis and Applications 259(1): 137–156.CrossRefGoogle Scholar
6.Bäuerle, N. (2001). Discounted stochastic fluid programs. Mathematics of Operations Research 26(2): 401–420.CrossRefGoogle Scholar
7.Billings, R. (2003). A heuristic method for scheduling and dispatching of factory production using multiclass fluid networks. Ph.D. dissertation, University of Texas at Austin.Google Scholar
8.Birge, J. & Wets, R. (1986). Designing approximation schemes for stochastic optimization problems, in particular, for stochastic programs with recourse. Mathematical Programming Study 27: 54–102.CrossRefGoogle Scholar
9.Büke, B. (2007). Optimal draining of fluid networks with parameter uncertainty. Ph.D. dissertation, University of Texas at Austin.Google Scholar
10.Chen, H. & Yao, D. (2001). Fundamentals of queueing networks. New York: Springer.CrossRefGoogle Scholar
11.Dai, J.G. (1999). Stability of fluid and stochastic processing networks. MaPhySto Miscellanea Publication No. 9. Centre for Mathematical Physics and Stochastics.Google Scholar
12.Dai, J.G. & Weiss, G. (2002). A fluid heuristic for minimizing makespan in job shops. Operations Research 50(4): 692–707.CrossRefGoogle Scholar
13.Dupačová, J. (1976). Minimax stochastic programs with nonconvex nonseparable penalty functions. In Prékopa, A. (ed.), Progress in operations research. Eger, Hungary: Mathematica Societatis János Bolyai, pp. 303–316.Google Scholar
14.Edirisinghe, N. & You, G.-M. (1996). Second-order scenario approximation and refinement in optimization under uncertainty. Annals of Operations Research 64: 143–178.CrossRefGoogle Scholar
15.Frauendorfer, K. (1988). Solving SLP recourse problems with arbitrary multivariate distributions: The dependent case. Mathematics of Operations Research 13: 377–394.CrossRefGoogle Scholar
16.Frauendorfer, K. & Kall, P. (1988). A solution method for SLP recourse problems with arbitrary multivariate distributions: The independent case. Problems of Control and Information Theory 17: 177–205.Google Scholar
17.Gassmann, H. & Ziemba, W. (1986). A tight upper bound for the expectation of a convex function of a multivariate random variable. Mathematical Programming Study 27: 39–53.CrossRefGoogle Scholar
18.Gürkan, G. (2000). Simulation optimization of buffer allocations in production lines with unreliable machines. Annals of Operations Research 93: 177–216.CrossRefGoogle Scholar
19.Gürkan, G., Karaesmen, F. & Özdemir, Ö.(submitted). Optimal threshold levels in stochastic fluid models via simulation based optimization. Discrete Event Dynamical Systems.Google Scholar
20.Harrison, J.M. & Zeevi, A. (2005). A method for staffing large call centers using stochastic fluid models. Manufacturing & Service Operations Management 7: 20–36.CrossRefGoogle Scholar
21.Huang, C., Ziemba, W. & Ben-Tal, A. (1977). Bounds on the expectation of a convex function of a random variable: With applications to stochastic programming. Operations Research 25: 315–325.CrossRefGoogle Scholar
22.Iyengar, G. & Zeevi, A. (2008). Parameter uncertainty implications on asymptotic analysis and design of stochastic systems. Preprint.Google Scholar
23.Kall, P., Ruszczyński, A. & Frauendorfer, K. (1988). Approximation techniques in stochastic programming. In Ermoliev, Y. & Wets, R.J.-B. (eds.), Numerical techniques for stochastic optimization. Berlin: Springer-Verlag, pp. 33–64.CrossRefGoogle Scholar
24.Kelley, J.E. (1960). The cutting plane method for solving convex programs. SIAM Journal of Industrial and Applied Mathematics 8: 703–712.CrossRefGoogle Scholar
25.Kulkarni, V.G. (1997). Fluid models for single buffer systems. In Dshalalow, J.H. (ed.), Frontiers in queueing: Models and applications in science and engineering. New York: CRC Press, pp. 321–338.Google Scholar
26.Madansky, A. (1959). Bounds on the expectation of a convex function of a multivariate random variable. Annals of Mathematical Statistics 30: 743–746.CrossRefGoogle Scholar
27.Meyn, S.P. (2007). Control techniques for complex networks. Cambridge: Cambridge University Press.CrossRefGoogle Scholar
28.Pullan, M.C. (1993). An algorithm for a class of continuous linear programs. SIAM Journal of Control and Optimization 31: 1558–1577.CrossRefGoogle Scholar
29.Pullan, M.C. (1995). Forms of optimal solutions for separated continuous linear programs. SIAM Journal of Control and Optimization 33: 1952–1977.CrossRefGoogle Scholar
30.Sethi, S.P., Yan, H., Zhang, H. & Zhang, Q. (2002). Optimal and hierarchical controls in dynamic stochastic manufacturing systems: A survey. Manufacturing & Service Operations Management 4(2): 133–170.CrossRefGoogle Scholar
31.Shapiro, A. (2003). Monte Carlo sampling methods. In Ruszczyński, A. & Shapiro, A. (eds.), Stochastic programming, handbooks in operations research and management science. Amsterdam: Elsevier.Google Scholar
32.Sun, G., Cassandras, C. & Panayiotou, C. (2004). Perturbation analysis of multiclass stochastic fluid models. Discrete Event Dynamical Systems 14: 267–307.CrossRefGoogle Scholar
33.van Slyke, R. & Wets, R. (1969). L-Shaped linear programs with applications to optimal control and stochastic programming. SIAM Journal on Applied Mathematics 17: 638–663.CrossRefGoogle Scholar
34.Weiss, G. (1995). On optimal draining of fluid reentrant lines. In Kelly, F.P. & Williams, R.J. (eds.), Stochastic networks, IMA Volumes in Mathematics and its Applications, Vol. 71, New York: Springer-Verlag, pp. 93–105.CrossRefGoogle Scholar
35.Weiss, G.(to appear). A simplex based algorithm to solve separated continuous linear programs. Mathematical Programming A.Google Scholar
36.Whitt, W. (2006). Staffing a call center with uncertain arrival rate and absenteeism. Production and Operations Management 15(1): 88–102.CrossRefGoogle Scholar