Skip to main content
SpringerLink
Log in

Sequencing Problems with Uncertain Parameters and the OWA Criterion

  • Conference paper
  • First Online:
Operations Research Proceedings 2013

Part of the book series: Operations Research Proceedings ((ORP))

  • 1556 Accesses

Abstract

In this paper a class of sequencing problems with uncertain parameters is discussed. The uncertainty is modeled by using a discrete scenario set. The Ordered Weighted Averaging (OWA) aggregation operator is used to choose an optimal schedule. The OWA operator generalizes traditional criteria in decision making under uncertainty, such as the maximum, average, median or Hurwicz criterion. In this paper a general framework is proposed and some positive and negative results for a sample problem are presented.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aloulou, M. A., & Della, Croce F. (2008). Complexity of single machine scheduling problems under scenario-based uncertainty. Operations Research Letters, 36(3), 338–342.

    Article  Google Scholar 

  2. Avidor, A., & Zwick, U. (2002). Approximating min k-sat. In Algorithms and computation (pp. 465–475). Berlin: Springer.

    Google Scholar 

  3. Kasperski, A. (2005). Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. Operations Research Letters, 33(4), 431–436.

    Article  Google Scholar 

  4. Kouvelis, P., & Yu, G. (1997). Robust discrete optimization and its applications, vol. 14. Berlin: Springer.

    Google Scholar 

  5. Volgenant, A., & Duin, C. W. (2010). Improved polynomial algorithms for robust bottleneck problems with interval data. Computers & Operations Research, 37(5), 909–915.

    Article  Google Scholar 

  6. Yager, R. R. (1988). On ordered weighted averaging aggregation operators in multi-criteria decision making. IEEE Transactions on Systems, Man and Cybernetics, 18, 183–190.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Industrial Engineering and Management, Wrocław University of Technology, Wrocław, Poland

    Adam Kasperski

  2. Institute of Mathematics and Computer Science, Wrocław University of Technology, Wrocław, Poland

    Paweł Zieliński

Authors
  1. Adam Kasperski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Paweł Zieliński
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Kasperski .

Editor information

Editors and Affiliations

  1. Econometric Institute, Erasmus School of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

    Dennis Huisman

  2. Erasmus School of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

    Ilse Louwerse

  3. Erasmus School of Economics, Erasmus University Rotterdam, Rotterdam, The Netherlands

    Albert P.M. Wagelmans

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kasperski, A., Zieliński, P. (2014). Sequencing Problems with Uncertain Parameters and the OWA Criterion. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_30

Download citation

Publish with us

Policies and ethics

Search

Navigation