IDEAS home Printed from https://ideas.repec.org/p/zbw/cauman/606.html
   My bibliography  Save this paper

Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography

Author

Listed:
  • Nikulin, Yury

Abstract

This work is an up-to-date-extension of a previous annotated bibliography (2004) which covered 40 references only. It focuses on what has been published during the last ten years in the area of combinatorial optimization and scheduling theory concerning robustness and other similar techniques dealing with worst case optimization under uncertainty and non-accuracy of problem data.

Suggested Citation

  • Nikulin, Yury, 2006. "Robustness in combinatorial optimization and scheduling theory: An extended annotated bibliography," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 606, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    • Handle: RePEc:zbw:cauman:606
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/147663/1/manuskript_606.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Levin, Andrew T. & Williams, John C., 2003. "Robust monetary policy with competing reference models," Journal of Monetary Economics, Elsevier, vol. 50(5), pages 945-975, July.
    2. Igor Averbakh, 2005. "The Minmax Relative Regret Median Problem on Networks," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 451-461, November.
    3. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(1), pages 193-194, February.
    4. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(2), pages 541-545, April.
    5. Kimms, A, 1998. "Stability Measures for Rolling Schedules with Applications to Capacity Expansion Planning, Master Production Scheduling, and Lot Sizing," Omega, Elsevier, vol. 26(3), pages 355-366, June.
    6. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(1), pages 151-159, February.
    7. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(4), pages 1007-1017, August.
    8. Laurent El Ghaoui & Maksim Oks & Francois Oustry, 2003. "Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach," Operations Research, INFORMS, vol. 51(4), pages 543-556, August.
    9. Averbakh, Igor & Berman, Oded, 2000. "Algorithms for the robust 1-center problem on a tree," European Journal of Operational Research, Elsevier, vol. 123(2), pages 292-302, June.
    10. Rainer Burkard & Helidon Dollani, 2002. "A Note on the Robust 1-Center Problem on Trees," Annals of Operations Research, Springer, vol. 110(1), pages 69-82, February.
    11. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    12. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(6), pages 1461-1465, December.
    13. Yu, Chian-Son & Li, Han-Lin, 2000. "A robust optimization model for stochastic logistic problems," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 385-397, March.
    14. Van de Vonder, Stijn & Demeulemeester, Erik & Herroelen, Willy & Leus, Roel, 2005. "The use of buffers in project management: The trade-off between stability and makespan," International Journal of Production Economics, Elsevier, vol. 97(2), pages 227-240, August.
    15. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    16. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(5), pages 687-698, October.
    17. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    18. Averbakh, Igor & Lebedev, Vasilij, 2005. "On the complexity of minmax regret linear programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 227-231, January.
    19. Montemanni, R. & Gambardella, L. M., 2005. "A branch and bound algorithm for the robust spanning tree problem with interval data," European Journal of Operational Research, Elsevier, vol. 161(3), pages 771-779, March.
    20. Dimitris Bertsimas & Aurélie Thiele, 2006. "A Robust Optimization Approach to Inventory Theory," Operations Research, INFORMS, vol. 54(1), pages 150-168, February.
    21. Gang Yu, 1996. "On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications," Operations Research, INFORMS, vol. 44(2), pages 407-415, April.
    22. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(3), pages 381-386, June.
    23. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(4), pages 525-537, August.
    24. ,, 1998. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 14(2), pages 285-292, April.
    25. Giannoni, Marc P., 2002. "Does Model Uncertainty Justify Caution? Robust Optimal Monetary Policy In A Forward-Looking Model," Macroeconomic Dynamics, Cambridge University Press, vol. 6(1), pages 111-144, February.
    26. Yu, Gang, 1997. "Robust economic order quantity models," European Journal of Operational Research, Elsevier, vol. 100(3), pages 482-493, August.
    27. Emilio Carrizosa & Stefan Nickel, 2003. "Robust facility location," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 58(2), pages 331-349, November.
    28. Scholl, Armin, 2000. "Robuste Planung und Optimierung: Grundlagen, Konzepte und Methoden; experimentelle Untersuchungen," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 9373, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    29. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(5), pages 1273-1289, October.
    30. Lutgens, F. & Sturm, J.F., 2002. "Robust One Period Option Modelling," Discussion Paper 2002-114, Tilburg University, Center for Economic Research.
    31. ,, 2002. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 18(3), pages 819-821, June.
    32. John M. Mulvey & Robert J. Vanderbei & Stavros A. Zenios, 1995. "Robust Optimization of Large-Scale Systems," Operations Research, INFORMS, vol. 43(2), pages 264-281, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Andrzej P. Wierzbicki & Marek Makowski & Janusz Granat, 2015. "Robustness Testing of Model Based Multiple Criteria Decisions: Fundamentals and Applications," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 14(05), pages 1035-1062.
    2. Amadeo Ascó, 2016. "An Analysis of Robustness Approaches for the Airport Baggage Sorting Station Assignment Problem," Journal of Optimization, Hindawi, vol. 2016, pages 1-19, September.
    3. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2012. "Flight gate scheduling with respect to a reference schedule," Annals of Operations Research, Springer, vol. 194(1), pages 177-187, April.
    4. Portoleau, Tom & Artigues, Christian & Guillaume, Romain, 2024. "Robust decision trees for the multi-mode project scheduling problem with a resource investment objective and uncertain activity duration," European Journal of Operational Research, Elsevier, vol. 312(2), pages 525-540.
    5. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2008. "Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem," Transportation Science, INFORMS, vol. 42(3), pages 292-301, August.
    6. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2017. "Flight gate assignment and recovery strategies with stochastic arrival and departure times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 65-93, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nikulin, Yury V., 2004. "Robustness in combinatorial optimization and scheduling theory: An annotated bibliography," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 583, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Youwei Zhang, 2014. "Solvability of a Third-Order Singular Generalized Left Focal Problem in Banach Spaces," International Journal of Analysis, Hindawi, vol. 2014, pages 1-18, May.
    3. Zhao, Longbin & Huang, Chengming, 2020. "Exponential fitting collocation methods for a class of Volterra integral equations," Applied Mathematics and Computation, Elsevier, vol. 376(C).
    4. Franco, J.M. & Rández, L., 2016. "Explicit exponentially fitted two-step hybrid methods of high order for second-order oscillatory IVPs," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 493-505.
    5. Eliseo Bustamante & Fernando-Juan García-Diego & Salvador Calvet & Antonio G. Torres & Antonio Hospitaler, 2015. "Measurement and Numerical Simulation of Air Velocity in a Tunnel-Ventilated Broiler House," Sustainability, MDPI, vol. 7(2), pages 1-20, February.
    6. Patriksson, Michael, 2008. "On the applicability and solution of bilevel optimization models in transportation science: A study on the existence, stability and computation of optimal solutions to stochastic mathematical programs," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 843-860, December.
    7. Soleimanian, Azam & Salmani Jajaei, Ghasemali, 2013. "Robust nonlinear optimization with conic representable uncertainty set," European Journal of Operational Research, Elsevier, vol. 228(2), pages 337-344.
    8. Ryoichi Nishimura & Shunsuke Hayashi & Masao Fukushima, 2013. "SDP reformulation for robust optimization problems based on nonconvex QP duality," Computational Optimization and Applications, Springer, vol. 55(1), pages 21-47, May.
    9. Odellia Boni & Aharon Ben-Tal, 2008. "Adjustable robust counterpart of conic quadratic problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 68(2), pages 211-233, October.
    10. Giorgio Fabbri & Fausto Gozzi & Andrzej Swiech, 2017. "Stochastic Optimal Control in Infinite Dimensions - Dynamic Programming and HJB Equations," Post-Print hal-01505767, HAL.
    11. C. Gutiérrez & B. Jiménez & V. Novo, 2011. "A generic approach to approximate efficiency and applications to vector optimization with set-valued maps," Journal of Global Optimization, Springer, vol. 49(2), pages 313-342, February.
    12. Dan A. Iancu & Mayank Sharma & Maxim Sviridenko, 2013. "Supermodularity and Affine Policies in Dynamic Robust Optimization," Operations Research, INFORMS, vol. 61(4), pages 941-956, August.
    13. Khondaker Mizanur Rahman & Marc Bremer, 2016. "Effective Corporate Governance and Financial Reporting in Japan," Asian Academy of Management Journal of Accounting and Finance (AAMJAF), Penerbit Universiti Sains Malaysia, vol. 12(Suppl. 1), pages 1-93–122.
    14. Elwyn Berlekamp & Richard M. Low, 2018. "Entrepreneurial Chess," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(2), pages 379-415, May.
    15. Luo, Fengqiao & Mehrotra, Sanjay, 2019. "Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models," European Journal of Operational Research, Elsevier, vol. 278(1), pages 20-35.
    16. Garud N. Iyengar, 2005. "Robust Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 30(2), pages 257-280, May.
    17. Areesh Mittal & Can Gokalp & Grani A. Hanasusanto, 2020. "Robust Quadratic Programming with Mixed-Integer Uncertainty," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 201-218, April.
    18. Ehsan Pourhadi & Reza Saadati & Sotiris K. Ntouyas, 2019. "Application of Fixed-Point Theory for a Nonlinear Fractional Three-Point Boundary-Value Problem," Mathematics, MDPI, vol. 7(6), pages 1-11, June.
    19. Kürşad Derinkuyu & Mustafa Pınar, 2006. "On the S-procedure and Some Variants," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 55-77, August.
    20. Moulay Rchid Sidi Ammi & Delfim F. M. Torres, 2013. "Existence of Three Positive Solutions to Some p -Laplacian Boundary Value Problems," Discrete Dynamics in Nature and Society, Hindawi, vol. 2013, pages 1-12, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:zbw:cauman:606. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/ibkiede.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.