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.

    File URL: https://libkey.io/10.1007/s10589-008-9210-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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)

    Citations

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


    Cited by:

    1. Akbari, Mahmood & Gheysari, Mahdi & Mostafazadeh-Fard, Behrouz & Shayannejad, Mohammad, 2018. "Surface irrigation simulation-optimization model based on meta-heuristic algorithms," Agricultural Water Management, Elsevier, vol. 201(C), pages 46-57.
    2. Omid Bozorg-Haddad & Mohammad Delpasand & Sarvin ZamanZad-Ghavidel & Xuefeng Chu, 2024. "Developing a novel social–water capital index by gene expression programming," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 26(11), pages 28187-28217, November.

    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. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    2. Luis F. Machado-Domínguez & Carlos D. Paternina-Arboleda & Jorge I. Vélez & Agustin Barrios-Sarmiento, 2021. "A memetic algorithm to address the multi-node resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 24(4), pages 413-429, August.
    3. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    4. Debels, Dieter & De Reyck, Bert & Leus, Roel & Vanhoucke, Mario, 2006. "A hybrid scatter search/electromagnetism meta-heuristic for project scheduling," European Journal of Operational Research, Elsevier, vol. 169(2), pages 638-653, March.
    5. Hartmann, Sönke, 1999. "Self-adapting genetic algorithms with an application to project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 506, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Moehring, Rolf & Uetz, Marc & Stork, Frederik & Schulz, Andreas S., 2002. "Solving Project Scheduling Problems by Minimum Cut," Working papers 4231-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    7. Bernardo F. Almeida & Isabel Correia & Francisco Saldanha-da-Gama, 2018. "A biased random-key genetic algorithm for the project scheduling problem with flexible resources," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(2), pages 283-308, July.
    8. Hartmann, Sönke, 2011. "Project scheduling with resource capacities and requests varying with time," Working Paper Series 01/2011, Hamburg School of Business Administration (HSBA).
    9. Alexander Tesch, 2020. "A polyhedral study of event-based models for the resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 23(2), pages 233-251, April.
    10. D. Debels & M. Vanhoucke, 2005. "A Decomposition-Based Heuristic For The Resource-Constrained Project Scheduling Problem," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 05/293, Ghent University, Faculty of Economics and Business Administration.
    11. Schirmer, Andreas & Potzhar, Kathrin, 2001. "Professional course scheduling in airline transport pilot training: A case from Lufthansa flight training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 539, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Nima Zoraghi & Aria Shahsavar & Babak Abbasi & Vincent Peteghem, 2017. "Multi-mode resource-constrained project scheduling problem with material ordering under bonus–penalty policies," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 49-79, April.
    13. Moukrim, Aziz & Quilliot, Alain & Toussaint, Hélène, 2015. "An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration," European Journal of Operational Research, Elsevier, vol. 244(2), pages 360-368.
    14. Lin, B.M.T. & Liu, S.T., 2008. "Maximizing the reward in the relocation problem with generalized due dates," International Journal of Production Economics, Elsevier, vol. 115(1), pages 55-63, September.
    15. Sönke Hartmann, 1998. "A competitive genetic algorithm for resource‐constrained project scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(7), pages 733-750, October.
    16. Cédric Verbeeck & Vincent Peteghem & Mario Vanhoucke & Pieter Vansteenwegen & El-Houssaine Aghezzaf, 2017. "A metaheuristic solution approach for the time-constrained project scheduling problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(2), pages 353-371, March.
    17. Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre (Ed.), 2000. "Jahresbericht 1999," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 522, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    18. Arno Sprecher, 2000. "Scheduling Resource-Constrained Projects Competitively at Modest Memory Requirements," Management Science, INFORMS, vol. 46(5), pages 710-723, May.
    19. Jürgen Kuster & Dietmar Jannach & Gerhard Friedrich, 2010. "Applying Local Rescheduling in response to schedule disruptions," Annals of Operations Research, Springer, vol. 180(1), pages 265-282, November.
    20. Sprecher, Arno, 1999. "Network decomposition techniques for resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 505, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    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.

    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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.