{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:36:24Z","timestamp":1759937784194},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,3]],"date-time":"2008-10-03T00:00:00Z","timestamp":1222992000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10589-008-9210-9","type":"journal-article","created":{"date-parts":[[2008,10,2]],"date-time":"2008-10-02T16:31:52Z","timestamp":1222965112000},"page":"97-128","source":"Crossref","is-referenced-by-count":58,"title":["Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained\/unconstrained resources"],"prefix":"10.1007","volume":"47","author":[{"given":"Omid","family":"Bozorg Haddad","sequence":"first","affiliation":[]},{"given":"Mahsa","family":"Mirmomeni","sequence":"additional","affiliation":[]},{"given":"Mahboubeh","family":"Zarezadeh Mehrizi","sequence":"additional","affiliation":[]},{"given":"Miguel A.","family":"Mari\u00f1o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,3]]},"reference":[{"issue":"1","key":"9210_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0263-7863(00)00024-7","volume":"19","author":"M.C.L. Abeyasinghe","year":"2001","unstructured":"Abeyasinghe, M.C.L., Greenwood, D.J., Johansen, D.E.: An efficient method for scheduling construction projects with resource constraints. Int. J. Proj. Manag. 19(1), 29\u201345 (2001)","journal-title":"Int. J. Proj. Manag."},{"key":"9210_CR2","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.jfranklin.2006.06.001","volume":"344","author":"A. Afshar","year":"2007","unstructured":"Afshar, A., Bozorg Haddad, O., Adams, B.J., Mari\u00f1o, M.A.: Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation. J. Frankl. Inst. 344, 452\u2013462 (2007)","journal-title":"J. Frankl. Inst."},{"key":"9210_CR3","first-page":"652","volume-title":"Proceedings of the International Computing Congress","author":"H. Al-Tabtabai","year":"1998","unstructured":"Al-Tabtabai, H., Alex, A.P.: Network compression using genetic algorithms. Computing in civil engineering. In: Wang, K.C.P. (ed.) Proceedings of the International Computing Congress, pp.\u00a0652\u2013659. ASCE, Boston (1998)"},{"key":"9210_CR4","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s11269-005-9001-3","volume":"20","author":"O. Bozorg Haddad","year":"2006","unstructured":"Bozorg Haddad, O., Afshar, A., Mari\u00f1o, M.A.: Honey-bees mating optimization (HBMO) algorithm: a\u00a0new heuristic approach for water resources optimization. Water Resour. Manag. 20, 661\u2013680 (2006)","journal-title":"Water Resour. Manag."},{"key":"9210_CR5","volume-title":"The New Critical Path Method","author":"D.H. Busch","year":"1991","unstructured":"Busch, D.H.: The New Critical Path Method. Probus Publishing Company, Chicago (1991)"},{"key":"9210_CR6","volume-title":"Construction Project Scheduling","author":"M.T. Callahan","year":"1992","unstructured":"Callahan, M.T.: Construction Project Scheduling. McGraw-Hill, New York (1992)"},{"issue":"3","key":"9210_CR7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1111\/1475-3995.00356","volume":"9","author":"I. Chabini","year":"2002","unstructured":"Chabini, I., Ganugapati, S.: Parallel algorithms for dynamic shortest path problems. Int. Trans. Oper. Res. 9(3), 279\u2013302 (2002)","journal-title":"Int. Trans. Oper. Res."},{"key":"9210_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1061\/(ASCE)0733-9364(1996)122:2(125)","volume":"122","author":"W.T. Chan","year":"1996","unstructured":"Chan, W.T., Chua, D.K.H., Kannan, G.: Construction resource scheduling with genetic algorithms. J. Constr. Eng. Manag. 122, 125\u2013132 (1996)","journal-title":"J. Constr. Eng. Manag."},{"key":"9210_CR9","doi-asserted-by":"crossref","unstructured":"Christodoulous, S.: Ant colony optimization in construction scheduling. Proceedings of the 2005 ASCE International Conference on Computing in Civil Engineering, July 11\u201317, Cancun, Mexico (2005)","DOI":"10.1061\/40794(179)167"},{"issue":"2\u20133","key":"9210_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0925-5273(96)00031-X","volume":"43","author":"P.M. Fran\u00e7a","year":"1996","unstructured":"Fran\u00e7a, P.M., Gendreau, M., Laporte, G., Muller, F.M.: A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. Int. J. Prod. Econ. 43(2\u20133), 79\u201389 (1996)","journal-title":"Int. J. Prod. Econ."},{"key":"9210_CR11","volume-title":"Genetic Algorithms and Engineering Design","author":"M. Gen","year":"1997","unstructured":"Gen, M., Cheng, R.W.: Genetic Algorithms and Engineering Design. Wiley, New York (1997)"},{"key":"9210_CR12","doi-asserted-by":"crossref","unstructured":"Gen, M., Cheng, R., Wang, D.: Genetic algorithms for solving shortest path problems. IEEE International Conference on Evolutionary Computation, 13\u201316 April, pp.\u00a0401\u2013406 (1997)","DOI":"10.1109\/ICEC.1997.592343"},{"key":"9210_CR13","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"9210_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"9210_CR15","volume-title":"Precedence and Arrow Networking Techniques for Construction","author":"R.B. Harris","year":"1978","unstructured":"Harris, R.B.: Precedence and Arrow Networking Techniques for Construction. Wiley, New York (1978)"},{"key":"9210_CR16","unstructured":"Hartmann, S.: Project scheduling with multiple modes: a genetic algorithm. Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universidad Kiel, No.\u00a0435, Germany (1997a)"},{"key":"9210_CR17","unstructured":"Hartmann, S.: A competitive genetic algorithm for resource-constrained project scheduling. Manuskripte aus den Instituten f\u00fcr Betriebswirtschaftslehre der Universidad Kiel, No.\u00a0451, Germany (1997b)"},{"key":"9210_CR18","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C","volume":"45","author":"S. Hartmann","year":"1998","unstructured":"Hartmann, S.: Naval Res. Logist. 45, 733\u2013750 (1998)","journal-title":"Naval Res. Logist."},{"key":"9210_CR19","unstructured":"He, J., Wan, Z.P., Guochun, T.: Construction project scheduling problem with uncertain resource constraints. Optimization Online, www.optimization-online.org\/DB_FILE\/2004\/06\/884.pdf (2004)"},{"key":"9210_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1061\/(ASCE)0733-9364(1999)125:3(167)","volume":"125","author":"T. Hegazy","year":"1999","unstructured":"Hegazy, T.: Optimization of resource allocation and leveling using genetic algorithms. J.\u00a0Constr. Eng. Manag. 125, 167\u2013175 (1999a)","journal-title":"J.\u00a0Constr. Eng. Manag."},{"key":"9210_CR21","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1139\/l99-031","volume":"26","author":"T. Hegazy","year":"1999","unstructured":"Hegazy, T.: Optimization of construction time-cost trade-off analysis using genetic algorithms. Can. J. Civil Eng. 26, 685\u2013697 (1999b)","journal-title":"Can. J. Civil Eng."},{"key":"9210_CR22","volume-title":"Construction Planning and Scheduling","author":"J.W. Hinze","year":"1998","unstructured":"Hinze, J.W.: Construction Planning and Scheduling. Prentice Hall, Upper Saddle River (1998)"},{"key":"9210_CR23","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann-Arbor (1975)"},{"issue":"8","key":"9210_CR24","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1016\/0305-0548(94)90014-0","volume":"21","author":"O. Icmeli","year":"1994","unstructured":"Icmeli, O., Erenguc, S.S.: A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows. Comput. Oper. Res. 21(8), 841\u2013853 (1994)","journal-title":"Comput. Oper. Res."},{"issue":"4598","key":"9210_CR25","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"9210_CR26","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s001860000093","volume":"52","author":"R. Klein","year":"2000","unstructured":"Klein, R., Scholl, A.: Progress: Optimally solving the generalized resource constrained project scheduling problem. Math. Methods Oper. Res. 52, 467\u2013488 (2000)","journal-title":"Math. Methods Oper. Res."},{"key":"9210_CR27","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-1-4615-5533-9_7","volume-title":"Handbook on Recent Advances in Project Scheduling","author":"R. Kolisch","year":"1999","unstructured":"Kolisch, R., Hartmann, S.: Heuristic algorithms for the resource-constrained project scheduling problem: classification and computational analysis in project scheduling. In: Weglarz, J. (ed.) Handbook on Recent Advances in Project Scheduling, pp.\u00a0147\u2013178. Kluwer, Dordrecht (1999)"},{"key":"9210_CR28","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1061\/(ASCE)0733-9364(2001)127:4(270)","volume":"127","author":"S.S. Leu","year":"2001","unstructured":"Leu, S.S., Hwang, S.T.: Optimal repetitive scheduling model with shareable resource constraint. J.\u00a0Constr. Eng. Manag. 127, 270\u2013280 (2001)","journal-title":"J.\u00a0Constr. Eng. Manag."},{"key":"9210_CR29","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1080\/014461999371105","volume":"17","author":"S.S. Leu","year":"1999","unstructured":"Leu, S.S., Yang, C.H.: A genetic-algorithm-based resource-constrained construction scheduling system. Constr. Manag. Econ. 17, 767\u2013776 (1999)","journal-title":"Constr. Manag. Econ."},{"key":"9210_CR30","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1061\/(ASCE)0733-9364(1997)123:3(233)","volume":"123","author":"H. Li","year":"1997","unstructured":"Li, H., Love, P.: Using improved genetic algorithms to facilitate time-cost optimization. J.\u00a0Constr. Eng. Manag. 123, 233\u2013237 (1997)","journal-title":"J.\u00a0Constr. Eng. Manag."},{"issue":"2","key":"9210_CR31","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/S0305-0548(98)00056-2","volume":"26","author":"C.F. Liaw","year":"1999","unstructured":"Liaw, C.F.: A tabu search algorithm for the open shop scheduling problem. Comput. Oper. Res. 26(2), 109\u2013126 (1999)","journal-title":"Comput. Oper. Res."},{"key":"9210_CR32","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1023\/A:1009684406579","volume":"5","author":"M.D. Miller","year":"1999","unstructured":"Miller, M.D., Chen, H.C., Matson, J., Liu, Q.: A\u00a0hybrid genetic algorithm for the single machine scheduling problem. J.\u00a0Heuristics 5, 437\u2013454 (1999)","journal-title":"J.\u00a0Heuristics"},{"issue":"5","key":"9210_CR33","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A. Mingozzi","year":"1998","unstructured":"Mingozzi, A., Maniezzo, V., Ricciardelli, S., Bianco, L.: An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manag. Sci. 44(5), 714\u2013729 (1998)","journal-title":"Manag. Sci."},{"issue":"6","key":"9210_CR34","doi-asserted-by":"crossref","first-page":"1179","DOI":"10.1109\/TSMCB.2005.850180","volume":"35","author":"S. Misra","year":"2005","unstructured":"Misra, S., Oommen, B.J.: Dynamic algorithms for the shortest path routing problem: learning automata-based solutions. IEEE Trans. Syst. Man Cybern., Part B 35(6), 1179\u20131192 (2005)","journal-title":"IEEE Trans. Syst. Man Cybern., Part B"},{"key":"9210_CR35","volume-title":"Project Management With CPM, PERT & Precedence Diagramming","author":"J.J. Moder","year":"1995","unstructured":"Moder, J.J., Phillips, C.R., Davis, E.W.: Project Management With CPM, PERT & Precedence Diagramming, 3rd edn. Blitz Publishing Co., Middleton (1995)","edition":"3"},{"key":"9210_CR36","unstructured":"Montemanni, R., Gambardella, L.M., Rizzoli, A.E., Donati, A.V.: A branch and bound algorithm for the robust shortest path problem with interval data. Technical Report IDSIA-09-02, Istituto Dalle Molle di Studi sull\u2019Intelligenza 20 Artificiale (2002)"},{"key":"9210_CR37","volume-title":"CPM in Construction Management","author":"J.J. O\u2019Brien","year":"1999","unstructured":"O\u2019Brien, J.J.: CPM in Construction Management, 5th edn. McGraw-Hill, New York (1999)","edition":"5"},{"key":"9210_CR38","doi-asserted-by":"crossref","unstructured":"Opricovic, S., Tzeng, G.H.: Multicriteria scheduling in water resources engineering using genetic algorithm. Proceedings of ICCCBE-VIII, 8th Int. Conf. on Computing in Civil and Building Engineering, Aug. 14\u201317, 2000, Stanford, CA, USA (2000)","DOI":"10.1061\/40513(279)187"},{"key":"9210_CR39","doi-asserted-by":"crossref","unstructured":"Pallottino, S., Scutella, M.G.: Shortest path algorithms in transportation models: classical and innovative aspects. Equilib. Adv. Transp. Model. 245\u2013281 (1998)","DOI":"10.1007\/978-1-4615-5757-9_11"},{"key":"9210_CR40","doi-asserted-by":"crossref","unstructured":"Righini, G., Salani, M.: Dynamic programming algorithms for the elementary shortest path problem with resource constraints. Electronic Notes in Discrete Mathematics, Workshop on Graphs and Combinatorial Optimization, 17, pp.\u00a0247\u2013249 (2004)","DOI":"10.1016\/j.endm.2004.03.047"},{"key":"9210_CR41","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0377-2217(01)00140-0","volume":"138","author":"J. Rosl\u00f6f","year":"2002","unstructured":"Rosl\u00f6f, J., Harjunkoski, I., Westerlund, T., Isaksson, J.: Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure. Eur. J. Oper. Res. 138, 29\u201342 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9210_CR42","first-page":"191","volume":"1","author":"A.B. Senouci","year":"2003","unstructured":"Senouci, A.B., Naji, K.K.: Resource-constrained scheduling of construction projects using genetic algorithms. Int. J. IT Archit. Eng. Constr. 1(3), 191\u2013208 (2003)","journal-title":"Int. J. IT Archit. Eng. Constr."},{"issue":"3","key":"9210_CR43","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1139\/l02-034","volume":"29","author":"Y.C. Toklu","year":"2002","unstructured":"Toklu, Y.C.: Application of genetic algorithms to construction scheduling with or without resource constraints. Can. J. Civil Eng. 29(3), 421\u2013429 (2002)","journal-title":"Can. J. Civil Eng."},{"key":"9210_CR44","unstructured":"Wall, M.B.: A genetic algorithm for resource-constrained scheduling. Ph.D. Thesis, Department of Mechanical Engineering, Massachusetts Institute of Technology, Cambridge, MA (1996)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9210-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-008-9210-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9210-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:35Z","timestamp":1559302595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-008-9210-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,3]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9210"],"URL":"https:\/\/doi.org\/10.1007\/s10589-008-9210-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,3]]}}}