{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:30:14Z","timestamp":1742963414955,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030726096"},{"type":"electronic","value":"9783030726102"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72610-2_31","type":"book-chapter","created":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T17:04:24Z","timestamp":1617901464000},"page":"407-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Lower Bound Polynomial Fast Procedure for the Resource-Constrained Project Scheduling Problem Tested on PSPLIB Instances"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1349-405X","authenticated-orcid":false,"given":"E. Kh.","family":"Gimadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6843-8971","authenticated-orcid":false,"given":"E. N.","family":"Goncharov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7664-5049","authenticated-orcid":false,"given":"A. A.","family":"Shtepa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,9]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1009822502231","volume":"5","author":"P Baptiste","year":"2000","unstructured":"Baptiste, P., Pape, C.L.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. Constraints 5, 119\u2013139 (2000)","journal-title":"Constraints"},{"issue":"4","key":"31_CR2","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1287\/mnsc.45.4.543","volume":"45","author":"J Bottcher","year":"1999","unstructured":"Bottcher, J., Drexl, A., Salewski, F.: Project scheduling under partially renewable resource constraints. Manage. Sci. 45(4), 543\u2013559 (1999)","journal-title":"Manage. Sci."},{"issue":"1","key":"31_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., et al.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3\u201341 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR4","unstructured":"Gafarov, E., Lazarev, A., Werner, F.: On Lower and Upper Bounds for the Resource-Constrained Project Scheduling Problem. Technical report. Otto-von-Guericke Universitaet (2010)"},{"key":"31_CR5","unstructured":"Gimadi, E.Kh.: On Some Mathematical Models and Methods for Planning Large-Scale Projects. Models and Optimization Methods. In: Proceedings of AN USSR Sib. Branch, Mathematics Institution, Novosibirsk: Nauka, vol. 10, pp. 89\u2013115 (1988) (in Russian)"},{"key":"31_CR6","doi-asserted-by":"publisher","unstructured":"Gimadi, E., Sevastianov, S.V.: On solvability of the project scheduling problem with accumulative resources of an arbitrary sign. In: Leopold-Wildburger U., Rendl F., W\u00e4scher G. (eds.) Operations Research Proceedings, pp. 241\u2013246. Springer, Berlin (2003) https:\/\/doi.org\/10.1007\/978-3-642-55537-4_39","DOI":"10.1007\/978-3-642-55537-4_39"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Gimadi, E.K., Sevastianov, S.V., Zalyubovsky, V.V.: On the Project Scheduling Problem under Stored Resource Constraints. In: Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation, Antibes - Juan les Pins, France, pp. 703\u2013706 (2001)","DOI":"10.1109\/ETFA.2001.997762"},{"key":"31_CR8","unstructured":"Gimadi, E.K., Zalyubovskii, V.V., Sevastyanov, S.V.: Polynomial solvability of scheduling problems with storable resources and deadlines. Diskretnyi Analiz i Issledovanie Operazii, Ser. 2, 7(1), 9\u201334 (2000) (in Russian)"},{"issue":"2","key":"31_CR9","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann, S., Kolisch, R.: Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur. J. Oper. Res. 127(2), 394\u2013407 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR10","unstructured":"Herroelen, W, Demeulemeester, E., De Reyck, B.: A Classification Scheme for Project Scheduling. In: Weglarz J. (ed.). Project Scheduling-Recent Models, Algorithms and Applications, International Series in Operations Research and Management Science, Kluwer Academy Publish., Dordrecht, vol. 14, pp. 77\u2013106 (1998)"},{"key":"31_CR11","series-title":"International Handbooks on Information Systems","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-05443-8_3","volume-title":"Handbook on Project Management and Scheduling Vol.1","author":"S Knust","year":"2015","unstructured":"Knust, S.: Lower bounds on the minimum project duration. In: Schwindt, C., Zimmermann, J. (eds.) Handbook on Project Management and Scheduling Vol.1. IHIS, pp. 43\u201355. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-05443-8_3"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Kolisch, R., Sprecher, A.: PSPLIB - a Project Scheduling Problem Library. Eur. J. Oper. Res. 96 205\u2013216 (1996) http:\/\/www.om-db.wi.tum.de\/psplib\/","DOI":"10.1016\/S0377-2217(96)00170-1"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R Kolisch","year":"1995","unstructured":"Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Manage. Sci. 41, 1693\u20131703 (1995)","journal-title":"Manage. Sci."},{"key":"31_CR14","unstructured":"Kozlov, M.K., Shafranskii, V.V.: Scheduling the implementation of work packages for a given dynamics of the receipt of stored resources. Izv. USSR Acad. Sci. Tech. Cybern. 4, 75\u201381 (1977) (in Russian)"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","volume":"143","author":"P Laborie","year":"2003","unstructured":"Laborie, P.: Algorithms for propagation of resource constraints in AI planning and scheduling: existing approaches and new results. Artif. Intell. 143, 151\u2013188 (2003)","journal-title":"Artif. Intell."},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Neron, E., et al.: Lower bounds for resource constrained project scheduling problem. In: Jozefowska, J., Weglarz, J. (eds.), Perspectives in Modern Project Scheduling, Chap. 7, pp. 167\u2013204. Springer, Boston (2006)","DOI":"10.1007\/978-0-387-33768-5_7"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s001860200251","volume":"56","author":"K Neumann","year":"2002","unstructured":"Neumann, K., Schwindt, C.: Project scheduling with inventory constraints. Math. Methods Oper. Res. 56, 513\u2013533 (2002)","journal-title":"Math. Methods Oper. Res."},{"issue":"3","key":"31_CR18","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/s10601-010-9103-2","volume":"16","author":"A Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P., Wallace, M.: Explaining the cumulative propagator. Constraints 16(3), 250\u2013282 (2011)","journal-title":"Constraints"},{"issue":"2","key":"31_CR19","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.ejor.2006.12.033","volume":"185","author":"V Valls","year":"2008","unstructured":"Valls, V., Ballestin, F., Quintanilla, S.: A hybrid genetic algorithm for the resource-consrtained project scheduling problem. Eur. J. Oper. Res. 185(2), 495\u2013508 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR20","unstructured":"Weglarz, J.: Project Scheduling. Recent Models, Algorithms and Applications. Kluwer Academy Publication, Boston(1999)"},{"key":"31_CR21","unstructured":"Zukhovickii, S.I., Radchik, I.A.: Mathematical Network Planning Methods. Nauka, Moscow (in Russian) (1965)"}],"container-title":["Lecture Notes in Computer Science","Analysis of Images, Social Networks and Texts"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72610-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T22:30:23Z","timestamp":1724797823000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72610-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030726096","9783030726102"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72610-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Analysis of Images, Social Networks and Texts","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aist2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aistconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"108","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.33","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}