IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v169y2006i3p761-766.html
   My bibliography  Save this article

The minmax regret permutation flow-shop problem with two jobs

Author

Listed:
  • Averbakh, Igor

Abstract

No abstract is available for this item.

Suggested Citation

  • Averbakh, Igor, 2006. "The minmax regret permutation flow-shop problem with two jobs," European Journal of Operational Research, Elsevier, vol. 169(3), pages 761-766, March.
    • Handle: RePEc:eee:ejores:v:169:y:2006:i:3:p:761-766
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00143-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. ,, 2000. "Problems And Solutions," Econometric Theory, Cambridge University Press, vol. 16(2), pages 287-299, April.
    2. Richard L. Daniels & Panagiotis Kouvelis, 1995. "Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production," Management Science, INFORMS, vol. 41(2), pages 363-376, February.
    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. Levorato, Mario & Figueiredo, Rosa & Frota, Yuri, 2022. "Exact solutions for the two-machine robust flow shop with budgeted uncertainty," European Journal of Operational Research, Elsevier, vol. 300(1), pages 46-57.
    2. Michał Ćwik & Jerzy Józefczyk, 2018. "Heuristic algorithms for the minmax regret flow-shop problem with interval processing times," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(1), pages 215-238, March.
    3. Kasperski, Adam & Kurpisz, Adam & Zieliński, Paweł, 2012. "Approximating a two-machine flow shop scheduling under discrete scenario uncertainty," European Journal of Operational Research, Elsevier, vol. 217(1), pages 36-43.
    4. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.

    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. Adam Kasperski & Paweł Zieliński, 2019. "Risk-averse single machine scheduling: complexity and approximation," Journal of Scheduling, Springer, vol. 22(5), pages 567-580, October.
    2. Lin, Jun & Ng, Tsan Sheng, 2011. "Robust multi-market newsvendor models with interval demand data," European Journal of Operational Research, Elsevier, vol. 212(2), pages 361-373, July.
    3. Aissi, Hassene & Bazgan, Cristina & Vanderpooten, Daniel, 2009. "Min-max and min-max regret versions of combinatorial optimization problems: A survey," European Journal of Operational Research, Elsevier, vol. 197(2), pages 427-438, September.
    4. Stevanovic Dalibor, 2016. "Common time variation of parameters in reduced-form macroeconomic models," Studies in Nonlinear Dynamics & Econometrics, De Gruyter, vol. 20(2), pages 159-183, April.
    5. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    6. A. Fadlelmawla & M. Al-Otaibi, 2005. "Analysis of the Water Resources Status in Kuwait," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 19(5), pages 555-570, October.
    7. Stefan Mišković, 2017. "A VNS-LP algorithm for the robust dynamic maximal covering location problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1011-1033, October.
    8. Duan, Jinyun & Li, Chenwei & Xu, Yue & Wu, Chia-Huei, 2017. "Transformational leadership and employee voice behavior: a Pygmalion mechanism," LSE Research Online Documents on Economics 68035, London School of Economics and Political Science, LSE Library.
    9. Mammassis, Constantinos S. & Kostopoulos, Konstantinos C., 2019. "CEO goal orientations, environmental dynamism and organizational ambidexterity: An investigation in SMEs," European Management Journal, Elsevier, vol. 37(5), pages 577-588.
    10. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    11. Jugend, Daniel & da Silva, Sérgio Luis & Salgado, Manoel Henrique & Miguel, Paulo Augusto Cauchick, 2016. "Product portfolio management and performance: Evidence from a survey of innovative Brazilian companies," Journal of Business Research, Elsevier, vol. 69(11), pages 5095-5100.
    12. Ian Maitland & Mitsuhiro Umezu, 2006. "An Evaluation of Japan's Stakeholder Capitalism," Journal of Private Enterprise, The Association of Private Enterprise Education, vol. 22(Spring 20), pages 131-164.
    13. Craig Loschmann & Özge Bilgili & Melissa Siegel, 2019. "Considering the benefits of hosting refugees: evidence of refugee camps influencing local labour market activity and economic welfare in Rwanda," IZA Journal of Migration and Development, Springer;Forschungsinstitut zur Zukunft der Arbeit GmbH (IZA), vol. 9(1), pages 1-23, December.
    14. Dimitris Bertsimas & Agni Orfanoudaki, 2021. "Algorithmic Insurance," Papers 2106.00839, arXiv.org, revised Dec 2022.
    15. Walter Murray & Tomás Tinoco De Rubira & Adam Wigington, 2015. "A robust and informative method for solving large-scale power flow problems," Computational Optimization and Applications, Springer, vol. 62(2), pages 431-475, November.
    16. Rafael Epstein & Andres Neely & Andres Weintraub & Fernando Valenzuela & Sergio Hurtado & Guillermo Gonzalez & Alex Beiza & Mauricio Naveas & Florencio Infante & Fernando Alarcon & Gustavo Angulo & Cr, 2012. "A Strategic Empty Container Logistics Optimization in a Major Shipping Company," Interfaces, INFORMS, vol. 42(1), pages 5-16, February.
    17. Hilfer, R., 2006. "Macroscopic capillarity without a constitutive capillary pressure function," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 209-225.
    18. Abdel-Latif Abla & Schmitz Hubert, 2010. "Growth Alliances: Insights from Egypt," Business and Politics, De Gruyter, vol. 12(4), pages 1-29, December.
    19. Antonio G. Martín & Manuel Díaz-Madroñero & Josefa Mula, 2020. "Master production schedule using robust optimization approaches in an automobile second-tier supplier," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 143-166, March.
    20. Abdelmoety, Ziad Hassan & Aboul-Dahab, Sameh & Agag, Gomaa, 2022. "A cross cultural investigation of retailers commitment to CSR and customer citizenship behaviour: The role of ethical standard and value relevance," Journal of Retailing and Consumer Services, Elsevier, vol. 64(C).

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:169:y:2006:i:3:p:761-766. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.