{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:04Z","timestamp":1725488944136},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_87","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T16:28:21Z","timestamp":1186763301000},"page":"547-552","source":"Crossref","is-referenced-by-count":0,"title":["Approaches to Solving RCPSP Using Relaxed Problem with Consumable Resources"],"prefix":"10.1007","author":[{"given":"Ivan A.","family":"Rykov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"87_CR1","first-page":"9","volume":"7","author":"E. Gimadi","year":"2000","unstructured":"Gimadi E, Sevastianov S, Zalyubovsky S (2000) Polynomial solvability of project scheduling problems with storable resources and due dates. Discrete analysis and operations research, 7,2: 9\u201334","journal-title":"Discrete analysis and operations research"},{"key":"87_CR2","doi-asserted-by":"crossref","unstructured":"Gimadi E, Sevastianov S, Zalyubovsky V (2001) On the Project Scheduling Problem under Stored Resource Constraints. Proceedings of 8th IEEE International Conference on Emerging Technologies and Factory Automation. Antibes-Juan les Pins, France: 703\u2013706","DOI":"10.1109\/ETFA.2001.997762"},{"issue":"12","key":"87_CR3","first-page":"32","volume":"41","author":"E. Gimadi","year":"1997","unstructured":"Gimadi E, Zalyubovskii V, Sharygin P (1997) The problem of strip packing: an asymptotically exact approach. Russian Mathematics (Iz. VUZ), Allerton Press Inc., 41,12: 32\u201342.","journal-title":"Russian Mathematics (Iz. VUZ)"},{"key":"87_CR4","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R. Kolish","year":"1996","unstructured":"Kolish R (1996) Serial and Parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research, 90: 320\u2013333","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"87_CR5","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/0209062","volume":"9","author":"E. Coffman","year":"1980","unstructured":"Coffman E, Garey M, Johnson D, Tarjan K (1980) Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9,4: 804\u2013826","journal-title":"SIAM Journal on Computing"},{"key":"87_CR6","doi-asserted-by":"crossref","unstructured":"Baker B, Brown D, Kartseff H (1981) A 5\/4 algorithm for two-dimensional packing. Journal of algorithms","DOI":"10.1016\/0196-6774(81)90034-1"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_87.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:06:37Z","timestamp":1605762397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_87","relation":{},"subject":[]}}