{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:34:51Z","timestamp":1725536091745},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642032509"},{"type":"electronic","value":"9783642032516"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03251-6_7","type":"book-chapter","created":{"date-parts":[[2009,7,28]],"date-time":"2009-07-28T06:17:59Z","timestamp":1248761879000},"page":"99-115","source":"Crossref","is-referenced-by-count":1,"title":["Iterative Flattening Search on RCPSP\/max Problems: Recent Developments"],"prefix":"10.1007","author":[{"given":"Angelo","family":"Oddi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Rasconi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Foundations and Applications","author":"H.H. Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search. In: Foundations and Applications. Morgan Kaufmann, San Francisco (2005)"},{"key":"7_CR2","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: Iterative Flattening: A Scalable Method for Solving Multi-Capacity Scheduling Problems. In: AAAI\/IAAI. 17\n                  th\n                 National Conference on Artificial Intelligence, pp. 742\u2013747 (2000)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling Project Networks with Resource Constraints and Time Windows. Annals of Operations Research\u00a016, 201\u2013240 (1988)","journal-title":"Annals of Operations Research"},{"key":"7_CR4","unstructured":"Michel, L., Van Hentenryck, P.: Iterative Relaxations for Iterative Flattening in Cumulative Scheduling. In: ICAPS 2004. Proceedings of the 14th International Conference on Automated Planning & Scheduling, pp. 200\u2013208 (2004)"},{"key":"7_CR5","unstructured":"Godard, D., Laborie, P., Nuitjen, W.: Randomized Large Neighborhood Search for Cumulative Scheduling. In: ICAPS 2005. Proceedings of the 15th International Conference on Automated Planning & Scheduling, pp. 81\u201389 (2005)"},{"issue":"1","key":"7_CR6","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., Mohring, R., Neumann, K., Pesch, E.: Resource-Constrained Project Scheduling: Notation, Classification, Models, and Methods. European Journal of Operational Research\u00a0112(1), 3\u201341 (1999)","journal-title":"European Journal of Operational Research"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/BF01545589","volume":"19","author":"K. Neumann","year":"1997","unstructured":"Neumann, K., Schwindt, C.: Activity-on-Node Networks with Minimal and Maximal Time Lags and Their Application to Make-to-Order Production. Operation Research Spektrum\u00a019, 205\u2013217 (1997)","journal-title":"Operation Research Spektrum"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0166-218X(96)00042-X","volume":"72","author":"M. Sch\u00e4ffter","year":"1997","unstructured":"Sch\u00e4ffter, M.: Scheduling with respect to forbidden sets. Discrete Applied Mathematics\u00a072, 141\u2013154 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR9","volume-title":"Handbook on Recent Advances in Project Scheduling","author":"R. Kolisch","year":"1998","unstructured":"Kolisch, R., Schwindt, C., Sprecher, A.: Benchmark Instances for Project Scheduling Problems. In: Weglarz, J. (ed.) Handbook on Recent Advances in Project Scheduling. Kluwer, Dordrecht (1998)"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1013617802515","volume":"8","author":"A. Cesta","year":"2002","unstructured":"Cesta, A., Oddi, A., Smith, S.F.: A constraint-based method for project scheduling with time windows. J. Heuristics\u00a08(1), 109\u2013136 (2002)","journal-title":"J. Heuristics"},{"key":"7_CR11","unstructured":"Dean, T.: Large-scale temporal data bases for planning in complex domains. In: IJCAI, pp. 860\u2013866 (1987)"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence\u00a049, 61\u201395 (1991)","journal-title":"Artificial Intelligence"},{"key":"7_CR13","unstructured":"Cesta, A., Oddi, A., Smith, S.: Profile Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems. In: AIPS 1998. Proceedings of the 4th International Conference on Artificial Intelligence Planning Systems, pp. 214\u2013223 (1998)"},{"key":"7_CR14","unstructured":"Laborie, P., Ghallab, M.: Planning with Sharable Resource Constraints. In: Proceedings of the 14th Int. Joint Conference on Artificial Intelligence (IJCAI 1995) (1995)"},{"key":"7_CR15","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Oddi, A., Cesta, A., Policella, N., Smith, S.F.: Iterative flattening search for resource constrained scheduling. J. Intelligent Manufacturing (2008) (published on-line November, 2008), doi:10.1007\/s10845-008-0163-8","DOI":"10.1007\/s10845-008-0163-8"},{"key":"7_CR17","unstructured":"Cesta, A., Fratini, S.: The timeline representation framework as a planning and scheduling software development environment. (unpublished manuscript) (2008)"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03251-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:13:55Z","timestamp":1552115635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03251-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642032509","9783642032516"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03251-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}