{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T18:15:34Z","timestamp":1768414534310,"version":"3.49.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,26]],"date-time":"2014-03-26T00:00:00Z","timestamp":1395792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10951-014-0374-0","type":"journal-article","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T05:30:10Z","timestamp":1395725410000},"page":"285-298","source":"Crossref","is-referenced-by-count":16,"title":["Schedule generation scheme for solving multi-mode resource availability cost problem by modified particle swarm optimization"],"prefix":"10.1007","volume":"18","author":[{"given":"Jian-Jun","family":"Qi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ya-Jie","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,26]]},"reference":[{"key":"374_CR1","unstructured":"Alfandari, L., Plateau, A., & Tolla, P. (2001). A two-phase path-relinking algorithm for the generalized assignment problem. Proceedings of the Fourth Metaheuristics International Conference, Porto."},{"issue":"3","key":"374_CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10732-005-1509-4","volume":"11","author":"AM Alvarez","year":"2005","unstructured":"Alvarez, A. M., Gonz\u00e1lez-Velarde, J. L., & De-Alba, K. (2005). GRASP embedded scatter search for the multicommodity capacitated network design problem. Journal of Heuristics, 11(3), 233\u2013257.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"374_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cor.2009.09.019","volume":"38","author":"A Barrios","year":"2011","unstructured":"Barrios, A., Ballest\u00edn, F., & Valls, V. (2011). A double genetic algorithm for the MRCPSP\/max. Computers & Operations Research, 38(1), 33\u201343.","journal-title":"Computers & Operations Research"},{"key":"374_CR4","doi-asserted-by":"crossref","unstructured":"Chen, T., Zhang, B., Hao, X., & Dai, Y. (2006, July). Task scheduling in grid based on particle swarm optimization. Fifth IEEE International Symposium on Parallel and Distributed Computing, ISPDC\u201906 (pp. 238\u2013245).","DOI":"10.1109\/ISPDC.2006.46"},{"issue":"3","key":"374_CR5","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.eswa.2009.07.024","volume":"37","author":"RM Chen","year":"2010","unstructured":"Chen, R. M., Wu, C. L., Wang, C. M., & Lo, S. T. (2010). Using novel particle swarm optimization scheme to solve resource-constrained scheduling problem in PSPLIB. Expert Systems with Applications, 37(3), 1899\u20131910.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"374_CR6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc, M., & Kennedy, J. (2002). The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1), 58\u201373.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"9","key":"374_CR7","doi-asserted-by":"crossref","first-page":"2653","DOI":"10.1016\/j.cor.2008.11.010","volume":"36","author":"N Damak","year":"2009","unstructured":"Damak, N., Jarboui, B., Siarry, P., & Loukil, T. (2009). Differential evolution for solving multi-mode resource-constrained project scheduling problems. Computers & Operations Research, 36(9), 2653\u20132659.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"374_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.cor.2010.01.001","volume":"38","author":"F Deblaere","year":"2011","unstructured":"Deblaere, F., Demeulemeester, E., & Herroelen, W. (2011). Reactive scheduling in the multi-mode RCPSP. Computers & Operations Research, 38(1), 63\u201374.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"374_CR9","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8(1), 156\u2013166.","journal-title":"Decision Sciences"},{"key":"374_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0026589","volume-title":"Artificial evolution","author":"F Glover","year":"1998","unstructured":"Glover, F. (1998). A template for scatter search and path relinking. In J.-K. Hao (Ed.), Artificial evolution (pp. 1\u201351). Berlin: Springer."},{"issue":"2","key":"374_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1022602019183","volume":"3","author":"DE Goldberg","year":"1988","unstructured":"Goldberg, D. E., & Holland, J. H. (1988). Genetic algorithms and machine learning. Machine Learning, 3(2), 95\u201399.","journal-title":"Machine Learning"},{"key":"374_CR12","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","volume":"4","author":"J Kennedy","year":"1995","unstructured":"Kennedy, J., & Eberhart, R. C. (1995). Particle swarm optimization. Proceedings of IEEE international conference on neural networks, 4, 1942\u20131948.","journal-title":"Proceedings of IEEE international conference on neural networks"},{"issue":"4","key":"374_CR13","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1007\/s13369-012-0221-6","volume":"37","author":"J Khorasani","year":"2012","unstructured":"Khorasani, J. (2012). A new heuristic approach for unit commitment problem using particle swarm optimization. Arabian Journal for Science and Engineering, 37(4), 1033\u20131042.","journal-title":"Arabian Journal for Science and Engineering"},{"issue":"1","key":"374_CR14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/S0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., & Sprecher, A. (1997). PSPLIB-a project scheduling problem library: OR software-ORSEP operations research software exchange program. European Journal of Operational Research, 96(1), 205\u2013216.","journal-title":"European Journal of Operational Research"},{"key":"374_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter search: methodology and implementations in C","author":"M Laguna","year":"2003","unstructured":"Laguna, M., & Mart\u00edn, R. (2003). Scatter search: methodology and implementations in C. Kluwer: Springer."},{"issue":"2","key":"374_CR16","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.ijpe.2007.02.003","volume":"111","author":"O Lambrechts","year":"2008","unstructured":"Lambrechts, O., Demeulemeester, E., & Herroelen, W. (2008). A tabu search procedure for developing robust predictive project schedules. International Journal of Production Economics, 111(2), 493\u2013508.","journal-title":"International Journal of Production Economics"},{"key":"374_CR17","unstructured":"Liu, Y. H. (2006). A scatter search based approach with approximate evaluation for the heterogeneous probabilistic traveling salesman problem. IEEE Congress on InEvolutionary Computation, CEC 2006 (pp. 1603\u20131609)."},{"key":"374_CR18","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/978-3-540-25945-9_51","volume-title":"Current topics in artificial intelligence","author":"FCG L\u00f3pez","year":"2004","unstructured":"L\u00f3pez, F. C. G., Torres, M. G., P\u00e9rez, J. A. M., & Vega, J. M. M. (2004). Scatter search for the feature selection problem. In R. Conejo (Ed.), Current topics in artificial intelligence (pp. 517\u2013525). Berlin: Springer."},{"issue":"2","key":"374_CR19","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.ijpe.2008.11.002","volume":"117","author":"A Lova","year":"2009","unstructured":"Lova, A., Tormos, P., Cervantes, M., & Barber, F. (2009). An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. International Journal of Production Economics, 117(2), 302\u2013316.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"374_CR20","first-page":"3514","volume":"2006","author":"X Luo","year":"2006","unstructured":"Luo, X., Wang, D., Tang, J., & Tu, Y. (2006). An improved PSO algorithm for resource-constrained project scheduling problem, intelligent control and automation, 2006. The Sixth World Congress on WCICA, 2006(1), 3514\u20133518.","journal-title":"The Sixth World Congress on WCICA"},{"issue":"3","key":"374_CR21","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s13369-012-0196-3","volume":"37","author":"MJ Maghsoudi","year":"2012","unstructured":"Maghsoudi, M. J., Ibrahim, Z., Buyamin, S., & Rahmat, M. F. A. (2012). Data clustering for the DNA computing readout method implemented on LightCycler and based on particle swarm optimization. Arabian Journal for Science and Engineering, 37(3), 697\u2013707.","journal-title":"Arabian Journal for Science and Engineering"},{"issue":"1","key":"374_CR22","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/opre.32.1.89","volume":"32","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R. H. (1984). Minimizing costs of resource requirements in project networks subject to a fixed completion time. Operations Research, 32(1), 89\u2013120.","journal-title":"Operations Research"},{"key":"374_CR23","doi-asserted-by":"crossref","unstructured":"Neumann, K., N\u00fcbel, H., & Schwindt, C. (2000). Active and stable project scheduling. Mathematical Methods of Operations Research, 52(3), 441\u2013465.","DOI":"10.1007\/s001860000092"},{"issue":"1","key":"374_CR24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1019633214895","volume":"115","author":"JE Orosz","year":"2002","unstructured":"Orosz, J. E., & Jacobson, S. H. (2002). Analysis of static simulated annealing algorithms. Journal of Optimization theory and Applications, 115(1), 165\u2013182.","journal-title":"Journal of Optimization theory and Applications"},{"issue":"1","key":"374_CR25","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/5326.740669","volume":"29","author":"L Ozdamar","year":"1999","unstructured":"Ozdamar, L. (1999). A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 29(1), 44\u201359.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews"},{"key":"374_CR26","volume-title":"Handbook of applied optimization","year":"2002","unstructured":"Pardalos, P. M., & Resende, M. G. (Eds.). (2002). Handbook of applied optimization. Oxford: Oxford University Press."},{"issue":"3","key":"374_CR27","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TEVC.2004.826076","volume":"8","author":"KE Parsopoulos","year":"2004","unstructured":"Parsopoulos, K. E., & Vrahatis, M. N. (2004). On the computation of all global minimizers through particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3), 211\u2013224.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"374_CR28","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2009.03.034","volume":"201","author":"V Peteghem Van","year":"2010","unstructured":"Van Peteghem, V., & Vanhoucke, M. (2010). A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, 201(2), 409\u2013418.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"374_CR29","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.amc.2007.07.022","volume":"196","author":"M Ranjbar","year":"2008","unstructured":"Ranjbar, M., Kianfar, F., & Shadrokh, S. (2008). Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Applied Mathematics and Computation, 196(2), 879\u2013888.","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"374_CR30","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/j.ejor.2010.03.008","volume":"206","author":"SB Rodrigues","year":"2010","unstructured":"Rodrigues, S. B., & Yamashita, D. S. (2010). An exact algorithm for minimizing resource availability costs in project scheduling. European Journal of Operational Research, 206(3), 562\u2013568.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"374_CR31","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1016\/j.ejor.2004.08.018","volume":"169","author":"RA Russell","year":"2006","unstructured":"Russell, R. A., & Chiang, W. C. (2006). Scatter search for the vehicle routing problem with time windows. European Journal of Operational Research, 169(2), 606\u2013622.","journal-title":"European Journal of Operational Research"},{"key":"374_CR32","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/11925231_28","volume-title":"MICAI 2006: advances in artificial intelligence","author":"LV Santana-Quintero","year":"2006","unstructured":"Santana-Quintero, L. V., Ram\u00edrez, N., & Coello, C. C. (2006). A multi-objective particle swarm optimizer hybridized with scatter search. In A. Gelbukh & C. A. Reyes-Garcia (Eds.), MICAI 2006: advances in artificial intelligence (pp. 294\u2013304). Berlin: Springer."},{"issue":"1","key":"374_CR33","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.ejor.2006.03.056","volume":"181","author":"S Shadrokh","year":"2007","unstructured":"Shadrokh, S., & Kianfar, F. (2007). A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty. European Journal of Operational Research, 181(1), 86\u2013101.","journal-title":"European Journal of Operational Research"},{"key":"374_CR34","volume-title":"Resource-constrained multi-project scheduling models and methods","author":"Y-Y Shou","year":"2010","unstructured":"Shou, Y.-Y. (2010). Resource-constrained multi-project scheduling models and methods. Hangzhou: Zhejiang University Press."},{"issue":"2","key":"374_CR35","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0377-2217(93)90185-P","volume":"64","author":"MG Speranza","year":"1993","unstructured":"Speranza, M. G., & Vercellis, C. (1993). Hierarchical models for multi-project planning and scheduling. European Journal of Operational Research, 64(2), 312\u2013325.","journal-title":"European Journal of Operational Research"},{"key":"374_CR36","doi-asserted-by":"crossref","unstructured":"Sprecher, A., Hartmann, S., & Drexl, A. (1997). An exact algorithm for project scheduling with multiple modes. Operations-Research-Spektrum, 19(3), 195\u2013203.","DOI":"10.1007\/BF01545587"},{"issue":"2","key":"374_CR37","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1009673512884","volume":"4","author":"PR Thomas","year":"1998","unstructured":"Thomas, P. R., & Salhi, S. (1998). A tabu search approach for the resource constrained project scheduling problem. Journal of Heuristics, 4(2), 123\u2013139.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"374_CR38","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1139\/l02-034","volume":"29","author":"YC Toklu","year":"2002","unstructured":"Toklu, Y. C. (2002). Application of genetic algorithms to construction scheduling with or without resource constraints. Canadian Journal of Civil Engineering, 29(3), 421\u2013429.","journal-title":"Canadian Journal of Civil Engineering"},{"issue":"1","key":"374_CR39","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.035","volume":"166","author":"E Triki","year":"2005","unstructured":"Triki, E., Collette, Y., & Siarry, P. (2005). A theoretical study on the behavior of simulated annealing leading to a new cooling schedule. European Journal of Operational Research, 166(1), 77\u201392.","journal-title":"European Journal of Operational Research"},{"key":"374_CR40","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-1-4615-5533-9_15","volume-title":"Project scheduling","author":"V Valls","year":"1999","unstructured":"Valls, V., Laguna, M., Lino, P., P\u00e9rez, A., & Quintanilla, S. (1999). Project scheduling with stochastic activity interruptions. In J. W\u0229glarz (Ed.), Project scheduling (pp. 333\u2013353). Kluwer: Springer."},{"issue":"2","key":"374_CR41","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.ejor.2004.08.019","volume":"169","author":"DS Yamashita","year":"2006","unstructured":"Yamashita, D. S., Armentano, V. A., & Laguna, M. (2006). Scatter search for project scheduling with resource availability cost. European Journal of Operational Research, 169(2), 623\u2013637.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"374_CR42","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.ipl.2008.05.010","volume":"108","author":"C Zhang","year":"2008","unstructured":"Zhang, C., Sun, J., Zhu, X., & Yang, Q. (2008). An improved particle swarm optimization algorithm for flowshop scheduling problem. Information Processing Letters, 108(4), 204\u2013209.","journal-title":"Information Processing Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0374-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0374-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0374-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:50Z","timestamp":1559468390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0374-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,26]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["374"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0374-0","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,26]]}}}