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

Finding improving directions in Lagrangian relaxation by fictitious play: A NASA scheduling application

Author

Listed:
  • Bell, Colin E.

Abstract

No abstract is available for this item.

Suggested Citation

  • Bell, Colin E., 1996. "Finding improving directions in Lagrangian relaxation by fictitious play: A NASA scheduling application," European Journal of Operational Research, Elsevier, vol. 88(3), pages 550-562, February.
    • Handle: RePEc:eee:ejores:v:88:y:1996:i:3:p:550-562
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00210-X
    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. Marshall L. Fisher, 1985. "An Applications Oriented Guide to Lagrangian Relaxation," Interfaces, INFORMS, vol. 15(2), pages 10-21, April.
    Full references (including those not matched with items on IDEAS)

    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. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    2. Syam, Siddhartha S. & Côté, Murray J., 2010. "A location-allocation model for service providers with application to not-for-profit health care organizations," Omega, Elsevier, vol. 38(3-4), pages 157-166, June.
    3. Quddus, Md Abdul & Shahvari, Omid & Marufuzzaman, Mohammad & Ekşioğlu, Sandra D. & Castillo-Villar, Krystel K., 2021. "Designing a reliable electric vehicle charging station expansion under uncertainty," International Journal of Production Economics, Elsevier, vol. 236(C).
    4. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.
    5. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    6. Koushik Ramakrishna & Moosa Sharafali & Yun Lim, 2015. "A two-item two-warehouse periodic review inventory model with transshipment," Annals of Operations Research, Springer, vol. 233(1), pages 365-381, October.
    7. S S Chauhan & J-M Proth & A M Sarmiento & R Nagi, 2006. "Opportunistic supply chain formation from qualified partners for a new market demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(9), pages 1089-1099, September.
    8. Huisman, D. & Jans, R.F. & Peeters, M. & Wagelmans, A.P.M., 2003. "Combining Column Generation and Lagrangian Relaxation," ERIM Report Series Research in Management ERS-2003-092-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    9. J. E. Beasley, 1990. "A lagrangian heuristic for set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 151-164, February.
    10. Hamed Soleimani & Prem Chhetri & Amir M. Fathollahi-Fard & S. M. J. Mirzapour Al-e-Hashem & Shahrooz Shahparvari, 2022. "Sustainable closed-loop supply chain with energy efficiency: Lagrangian relaxation, reformulations and heuristics," Annals of Operations Research, Springer, vol. 318(1), pages 531-556, November.
    11. Marco Corazza & Giacomo di Tollo & Giovanni Fasano & Raffaele Pesenti, 2021. "A novel hybrid PSO-based metaheuristic for costly portfolio selection problems," Annals of Operations Research, Springer, vol. 304(1), pages 109-137, September.
    12. S Karabatı & C Akkan, 2006. "Minimizing sum of completion times on a single machine with sequence-dependent family setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 271-280, March.
    13. Kamalini Ramdas & Mohanbir S. Sawhney, 2001. "A Cross-Functional Approach to Evaluating Multiple Line Extensions for Assembled Products," Management Science, INFORMS, vol. 47(1), pages 22-36, January.
    14. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    15. X-Y Li & Y P Aneja & F Baki, 2010. "An ant colony optimization metaheuristic for single-path multicommodity network flow problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1340-1355, September.
    16. Aliakbari, Mina & Geunes, Joseph & Ghahari, Amir & Prince, Mike, 2024. "Freight railcar-to-train assignment and departure scheduling in a railyard," European Journal of Operational Research, Elsevier, vol. 314(3), pages 950-962.
    17. Rivi Sandhu & Diego Klabjan, 2007. "Integrated Airline Fleeting and Crew-Pairing Decisions," Operations Research, INFORMS, vol. 55(3), pages 439-456, June.
    18. Ahmadi, Reza H. & Kouvelis, Panagiotis, 1999. "Design of electronic assembly lines: An analytical framework and its application," European Journal of Operational Research, Elsevier, vol. 115(1), pages 113-137, May.
    19. Bora Tarhan & Ignacio Grossmann & Vikas Goel, 2013. "Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and gradual uncertainty resolution," Annals of Operations Research, Springer, vol. 203(1), pages 141-166, March.
    20. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.

    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:88:y:1996:i:3:p:550-562. 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.