{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:04:08Z","timestamp":1794341048219,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540639121","type":"print"},{"value":"9783540696650","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63912-8_98","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:37:40Z","timestamp":1153132660000},"page":"351-363","source":"Crossref","is-referenced-by-count":1,"title":["A tabu search strategy to solve scheduling problems with deadlines and complex metric constraints"],"prefix":"10.1007","author":[{"given":"Angelo","family":"Oddi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Amedeo","family":"Cesta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/0196-6774(91)90036-X","volume":"12","author":"G. Ausiello","year":"1991","unstructured":"G. Ausiello, G.F. Italiano, A. MarchettiSpaccamela, and U. Nanni. Incremental Algorithms for Minimal Length Paths. Journal of Algorithms, 12:615\u2013638, 1991.","journal-title":"Journal of Algorithms"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"A. Cesta and A. Oddi. Gaining Efficiency and Flexibility in the Simple Temporal Problem. In Proceedings of the Third International Conference on Temporal Representation and Reasoning (TIME-96). IEEE Computer Society Press, 1996.","DOI":"10.1109\/TIME.1996.555676"},{"key":"28_CR3","unstructured":"C. Cheng and S.F. Smith. Generating Feasible Schedules under Complex Metric Constraints. In Proceedings 12th National Conference on AI (AAAI-94), 1994."},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90061-0","volume":"32","author":"T.L. Dean","year":"1987","unstructured":"T.L. Dean and D.V. McDermott. Temporal Data Base Management. Artificial Intelligence, 32:1\u201355, 1987.","journal-title":"Artificial Intelligence"},{"key":"28_CR5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. Artificial Intelligence, 49:61\u201395, 1991.","journal-title":"Artificial Intelligence"},{"key":"28_CR6","unstructured":"S. French. Sequencing and Scheduling: an Introduction to the Mathematics of the Job-Shop. Hellis Horwood Lim., 1982."},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"F. Glover. Tabu Search \u2014 Part I. ORSA Journal of Computing, 1:190\u2013206, 1989.","journal-title":"ORSA Journal of Computing"},{"key":"28_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"F. Glover. Tabu Search \u2014 Part II. ORSA Journal of Computing, 2:4\u201332, 1990.","journal-title":"ORSA Journal of Computing"},{"key":"28_CR9","unstructured":"N. Muscettola. HSTS: Integrating Planning and Scheduling. In M. Zweben and M.S. Fox, editors, Intelligent Scheduling. Morgan Kaufmann, 1994."},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"E. Nowicki and C. Smutnicki. A Fast Taboo Search Algorithm for the Job Shop Problem. Management Science, 42:797\u2013813, 1996.","journal-title":"Management Science"},{"key":"28_CR11","unstructured":"A. Oddi. Sequencing Methods and Temporal Algorithms with Application in the Management of Medical Resources. PhD thesis, Department of Computer and System Science, University of Rome \u201cLa Sapienza\u201d, 1997."},{"key":"28_CR12","unstructured":"A. Oddi and S.F. Smith. Stochastic Procedures for Generating Feasible Schedules. In Proceedings 14th National Conference on AI (AAAI-97), 1997."},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M Laarhoven Van","year":"1992","unstructured":"P.J.M Van Laarhoven, E.H.L. Aarts, and J.K. Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research, 40:113\u2013125, 1992.","journal-title":"Operations Research"},{"key":"28_CR14","unstructured":"M. Zweben and M.S. Fox, editors. Intelligent Scheduling. Morgan Kaufmann, 1994."}],"container-title":["Lecture Notes in Computer Science","Recent Advances in AI Planning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63912-8_98","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T09:54:01Z","timestamp":1549187641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63912-8_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639121","9783540696650"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-63912-8_98","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/3-540-63912-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}