Skip to main content
SpringerLink
Log in

The stochastic generalised assignment problem with Bernoulli demands

  • Published:
Top Aims and scope Submit manuscript

Abstract

This paper deals with the Stochastic Generalised Assignment problem. It presents several models for the special case when demands are independent and Bernoulli distributed. Each model designs an assignment structure before the demands are known. Two policies are considered to handle infeasibilities in particular instances of the demands vector. Model performances are compared under both policies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Cattrysse, D.G. and L.N. Van Wassenhove (1992). A survey of algorithms for the generalized assignment problem.European Journal of Operational Research 60, 260–272.

    Article  Google Scholar 

  • Charnes, A., W.W. Cooper and G.H. Symonds (1958). Cost horizons and certainty equivalents: An approach to stochastic programming of heating oil.Management Science 4, 235–263.

    Article  Google Scholar 

  • Dentcheva, D., A. Prékopa and A. Ruzczyński (1998). On stochastic integer programming under probabilistic constraints.Rutcor Research Report RR, 29–98.

  • Díaz, J.A. and E. Fernández (2000). A tabu search heuristic for the generalized assignment problem.European Journal of Operational Research, to appear.

  • Ermoliev, Y. and R.J-B Wets (1988).Numerical Techniques for Stochastic Optimization. Series in Comp. Math. 10. Springer-Verlag, Berlin.

    Google Scholar 

  • Haneveld, W.K. Klein and M.H. van der Vlerk (1999). Stochastic integer programming: general models and algorithms.Annals of Operations Research 85, 39–57.

    Article  Google Scholar 

  • Henrion, R. (1998). Qualitative stability of convex programs with probabilistic constraints. Weierstrass Institute Berlin.

  • Martello, S. and P. Toth (1990)Knapsack Problems: Algorithms and Computer Implementations. John Willey & Sons. Chichester.

    Google Scholar 

  • Mine, H., M. Fukushima, K. Ishikawa and I. Sawa (1983).An Algorithm for the Assignment Problem with Stochastic Side Constraints. Memoirs of the Faculty of Engineering, Kyoto University45, 26–35.

    Google Scholar 

  • Prékopa, A. (1995).Stochastic programming, volume 324 ofMathematics and its Applications. Kluwer Academic Publishers Group, Dordrecht.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament d'Estadística i Investigació Operativa, Universitat Politècnica de Catalunya (UPC), Pau Gargallo, 5, 08028, Barcelona, (Spain)

    Maria Albareda-Sambola & Elena Fernández

Authors
  1. Maria Albareda-Sambola
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elena Fernández
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research has been partially supported by grant TIC 2000-1750-C06-03 from the CICYT. The first author is supported by grant AP97-43739460 from Ministerio de Educación y Cultura (MEC), España.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Albareda-Sambola, M., Fernández, E. The stochastic generalised assignment problem with Bernoulli demands. Top 8, 165–190 (2000). https://doi.org/10.1007/BF02628554

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02628554

Key words

AMS subject classification

Search

Navigation