{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:00Z","timestamp":1725490380984},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540747819"},{"type":"electronic","value":"9783540747826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74782-6_39","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:51:49Z","timestamp":1188053509000},"page":"447-458","source":"Crossref","is-referenced-by-count":1,"title":["Boosting the Performance of Iterative Flattening Search"],"prefix":"10.1007","author":[{"given":"Angelo","family":"Oddi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Policella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amedeo","family":"Cesta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen F.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","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":"39_CR2","unstructured":"Michel, L., Van Hentenryck, P.: Iterative Relaxations for Iterative Flattening in Cumulative Scheduling. In: ICAPS 2004. Proceedings of the 14\n                    th\n                   International Conference on Automated Planning & Scheduling, pp. 200\u2013208 (2004)"},{"key":"39_CR3","unstructured":"Godard, D., Laborie, P., Nuitjen, W.: Randomized Large Neighborhood Search for Cumulative Scheduling. In: ICAPS 2005. Proceedings of the 15\n                    th\n                   International Conference on Automated Planning & Scheduling, pp. 81\u201389 (2005)"},{"key":"39_CR4","unstructured":"Policella, N., Smith, S.F., Cesta, A., Oddi, A.: Generating Robust Schedules through Temporal Flexibility. In: ICAPS 2004. Proceedings of the 14\n                    th\n                   International Conference on Automated Planning & Scheduling, pp. 209\u2013218 (2004)"},{"key":"39_CR5","unstructured":"Cesta, A., Oddi, A., Smith, S.: Profile Based Algorithms to Solve Multiple Capacitated Metric Scheduling Problems. In: AIPS 1998. Proceedings of the 4\n                    th\n                   International Conference on Artificial Intelligence Planning Systems, pp. 214\u2013223 (1998)"},{"key":"39_CR6","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"},{"issue":"3","key":"39_CR7","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C. Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput. Surv.\u00a035(3), 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science\u00a042, 797\u2013813 (1996)","journal-title":"Management Science"},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0377-2217(95)00354-1","volume":"90","author":"W. Nuijten","year":"1996","unstructured":"Nuijten, W., Aarts, E.: A Computational Study of Constraint Satisfaction for Multiple Capacitated Job Shop Scheduling. European Journal of Operational Research\u00a090(2), 269\u2013284 (1996)","journal-title":"European Journal of Operational Research"},{"key":"39_CR10","unstructured":"Lawrence, S.: Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement). Technical report, Graduate School of Industrial Administration, Carnegie Mellon University (1984)"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2007: Artificial Intelligence and Human-Oriented Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74782-6_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:38:39Z","timestamp":1619519919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74782-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540747819","9783540747826"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74782-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}