IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v47y2010i1p97-128.html
   My bibliography  Save this article

Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources

Author

Listed:
  • Omid Bozorg Haddad

    ()

  • Mahsa Mirmomeni

    ()

  • Mahboubeh Zarezadeh Mehrizi

    ()

  • Miguel Mariño

    ()

Abstract

No abstract is available for this item.

Suggested Citation

  • Omid Bozorg Haddad & Mahsa Mirmomeni & Mahboubeh Zarezadeh Mehrizi & Miguel Mariño, 2010. "Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources," Computational Optimization and Applications, Springer, vol. 47(1), pages 97-128, September.
  • Handle: RePEc:spr:coopap:v:47:y:2010:i:1:p:97-128
    DOI: 10.1007/s10589-008-9210-9
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-008-9210-9
    Download Restriction: Access to full text is restricted to subscribers.

    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. Sou-Sen Leu & Chung-Huei Yang, 1999. "A genetic-algorithm-based resource-constrained construction scheduling system," Construction Management and Economics, Taylor & Francis Journals, vol. 17(6), pages 767-776.
    2. Aristide Mingozzi & Vittorio Maniezzo & Salvatore Ricciardelli & Lucio Bianco, 1998. "An Exact Algorithm for the Resource-Constrained Project Scheduling Problem Based on a New Mathematical Formulation," Management Science, INFORMS, vol. 44(5), pages 714-729, May.
    3. Kolisch, Rainer & Hartmann, Sönke, 1999. "Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 10966, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    Full references (including those not matched with items on IDEAS)

    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:spr:coopap:v:47:y:2010:i:1:p:97-128. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.