{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:47:23Z","timestamp":1761598043133,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T00:00:00Z","timestamp":1550448000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s11277-019-06185-5","type":"journal-article","created":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T08:09:11Z","timestamp":1550477351000},"page":"681-699","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A New Priority Rule for Solving Project Scheduling Problems"],"prefix":"10.1007","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3779-9763","authenticated-orcid":false,"given":"Patience I.","family":"Adamu","sequence":"first","affiliation":[]},{"given":"Hilary I.","family":"Okagbue","sequence":"additional","affiliation":[]},{"given":"Pelumi E.","family":"Oguntunde","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,18]]},"reference":[{"key":"6185_CR1","unstructured":"Adamu, P. I. & Aromolaran O. T. (2018). Machine learning priority rule (MLPR) for solving resource-constrained project scheduling problems. In Lecture Notes in engineering and computer science: Proceedings of the international multi-conference of engineers and computer scientists 2018, Hong Kong (pp. 974-979) 14\u201316 March 2018."},{"key":"6185_CR2","unstructured":"Adamu, P. I., Agarana, M. C., & Okagbue, H. I. (2018). Machine learning heuristic for solving multi-mode resource-constrained project scheduling problems. In Lecture notes in engineering and computer science: Proceedings of the international multiconference of engineers and computer scientists 2018, Hong Kong (pp. 23\u201328) 14\u201316 March 2018."},{"key":"6185_CR3","first-page":"154","volume":"4","author":"PI Adamu","year":"2009","unstructured":"Adamu, P. I. (2009). Hard resource-constrained project scheduling problems. International Journal of Numerical Mathematics,\n                           4, 154\u2013169.","journal-title":"International Journal of Numerical Mathematics"},{"key":"6185_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1983). Scheduling subject to resource constraints: Classification and complexity. Discrete Applied Mathematics,\n                           5, 11\u201324.","journal-title":"Discrete Applied Mathematics"},{"key":"6185_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.ins.2017.12.013","volume":"432","author":"S Chand","year":"2018","unstructured":"Chand, S., Huynh, Q., Singh, H., Ray, T., & Wagner, M. (2018). On the use of genetic programming to evolve priority rules for resource constrained project scheduling problems. Information Sciences,\n                           432, 146\u2013163.","journal-title":"Information Sciences"},{"key":"6185_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.future.2018.04.029","volume":"86","author":"M Dumic","year":"2018","unstructured":"Dumic, M., Sisejkovic, D., Coric, R., & Jakobovic, D. (2018). Evolving priority rules for resource constrained project scheduling problem with genetic programming. Future Generation Computer Systems,\n                           86, 211\u2013221.","journal-title":"Future Generation Computer Systems"},{"key":"6185_CR7","doi-asserted-by":"crossref","unstructured":"Ekenna, C., Jacobs, S. A., Thomas, S. & Amato, N. M. (2013). Adaptive neighbor connection for PRMS: A natural fit for heterogeneous environments and parallelism. In Proceedings of the IEEE international conference on robotics and system (IROS), Tokyo, Japan, Nov 2013.","DOI":"10.1109\/IROS.2013.6696510"},{"key":"6185_CR8","unstructured":"Hartmann, S. (1997). Project scheduling with multiple modes: A genetic algorithm\u201d, Manuskripte aus den Instituten fur Betriebswirtschaftslehre der Universit at Kiel, no. 435."},{"key":"6185_CR9","doi-asserted-by":"crossref","unstructured":"Hsu, D., Sanchez-Ante, G., & Sun, Z. (2005). Hybrid PRM sampling with a cost-sensitive adaptive strategy. In Proceedings of the IEEE international conference on robotics and automation (ICRA) (pp. 3885\u20133891).","DOI":"10.1109\/ROBOT.2005.1570712"},{"key":"6185_CR10","doi-asserted-by":"publisher","unstructured":"Kadam, S. U. & Mane S. U. (2015). A genetic-local search algorithm approach for resource constrained project scheduling problem. In International conference on computing communication control and automation, Pune (pp. 841\u2013846). \n                    https:\/\/doi.org\/10.1109\/iccubea.2015.168\n                    \n                  .","DOI":"10.1109\/iccubea.2015.168"},{"key":"6185_CR11","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch, R. (1996). Serial and Parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operations Research,\n                           90, 320\u2013333.","journal-title":"European Journal of Operations Research"},{"issue":"3","key":"6185_CR12","first-page":"905","volume":"2","author":"SH Mohammad","year":"2015","unstructured":"Mohammad, S. H., Mohammad, R. A., & Yagub, A. (2015). An efficient genetic algorithm for solving the multi-mode resource-constrained project scheduling problem based on random key representation. International Journal of Supply and Operations Management,\n                           2(3), 905\u2013924.","journal-title":"International Journal of Supply and Operations Management"},{"issue":"1","key":"6185_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJOR.2015.070859","volume":"24","author":"J Rezaeian","year":"2015","unstructured":"Rezaeian, J., Soleimani, F., Mohaselafshary, S., & Arab, A. (2015). Using a meta-heuristic algorithm for solving the multi-mode resource-constrained project scheduling problem. International Journal of Operational Research,\n                           24(1), 1\u201316.","journal-title":"International Journal of Operational Research"},{"key":"6185_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0377-2217(97)00348-2","volume":"107","author":"A Sprecher","year":"1998","unstructured":"Sprecher, A., & Drexl, A. (1998). Multi-mode resource-constrained project scheduling problems by a simple general and powerful sequencing algorithm. European Journal of Operational Research,\n                           107, 431\u2013450.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"6185_CR15","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/mnsc.28.10.1197","volume":"28","author":"FB Talbot","year":"1982","unstructured":"Talbot, F. B. (1982). Resource-constrained project scheduling with time\u2013resource trade-offs: The nonpreemptive case. Management Science,\n                           28(10), 1197\u20131210.","journal-title":"Management Science"},{"key":"6185_CR16","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1287\/mnsc.24.11.1163","volume":"24","author":"FB Talbot","year":"1978","unstructured":"Talbot, F. B., & Patterson, J. H. (1978). An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems. Management Science,\n                           24, 1163\u20131174.","journal-title":"Management Science"},{"key":"6185_CR17","unstructured":"Vanhoucke, M. (2012). Optimizing regular scheduling objectives: Schedule generation schemes. Pm Knowledge Center. [Online]. Available: \n                    http:\/\/www.pmknowledgecenter.com\/dynamic_scheduling\/baseline\/optimizing-regular-scheduling-objectives-schedule-generation-schemes\n                    \n                  . Accessed 15 Mar 2018."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-019-06185-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-019-06185-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-019-06185-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T10:58:27Z","timestamp":1582023507000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-019-06185-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,18]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["6185"],"URL":"https:\/\/doi.org\/10.1007\/s11277-019-06185-5","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"type":"print","value":"0929-6212"},{"type":"electronic","value":"1572-834X"}],"subject":[],"published":{"date-parts":[[2019,2,18]]},"assertion":[{"value":"18 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}