{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:21:51Z","timestamp":1725664911066},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635765"},{"type":"electronic","value":"9783540696018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63576-9_117","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:31:00Z","timestamp":1330299060000},"page":"302-310","source":"Crossref","is-referenced-by-count":0,"title":["A weakly backjumping strategy to solve hard scheduling problems"],"prefix":"10.1007","author":[{"given":"Angelo","family":"Oddi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1016\/0196-6774(91)90036-X","volume":"12","author":"G. Ausiello","year":"1991","unstructured":"Ausiello G., Italiano G.F., Marchetti Spaccamela A., Nanni U., Incremental Algorithm for Minimal Length Paths, Journal of Algorithms 12, 1991, 615\u2013638.","journal-title":"Journal of Algorithms"},{"key":"27_CR2","first-page":"45","volume-title":"Gaining Efficency and Flexibility in the Simple Temporal Problem","author":"A. Cesta","year":"1996","unstructured":"Cesta A. and Oddi A., Gaining Efficency and Flexibility in the Simple Temporal Problem, Proceedings of the Third International Conference on Temporal Representation and Reasoning (TIME-96) 45\u201350, IEEE Computer Society Press, Los Alamitos, California, 1996."},{"key":"27_CR3","first-page":"331","volume":"91","author":"P. Cheeseman","year":"1991","unstructured":"Cheeseman P., Kanefsky B. and Taylor W.M., Where the really hard problems are. Proc. IJCAI-91. 331\u2013337, 1991.","journal-title":"Proc. IJCAI-"},{"key":"27_CR4","unstructured":"Cheng C. and Smith S.F., Generating Feasible Schedules under Complex Metric Constraints, Proceedings 12th National Conference on AI (AAAI-94), Seattle, WA, August 1994."},{"key":"27_CR5","unstructured":"Crawford J.M. and Anton L.D., Experimental Results on the Crossover Point in Satisfability Problems. Proceedings 11th National Conference on AI (AAAI-93), 21\u201327."},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter R., Meiri I. and Pearl J., Temporal Constraint Networks. Artificial Intelligence, 49, 1991, 61\u201395.","journal-title":"Artificial Intelligence"},{"key":"27_CR7","unstructured":"French S., Sequencing and Scheduling: an Introduction to the Mathematics of the Job-Shop. Hellis Horwood Lim., 1982."},{"key":"27_CR8","unstructured":"Garey M.R. and Johnson D.S., Computers and Intractability, a Guide to the Theory of NP-Completeness, W.H. Freeman Company 1979."},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M.L. Ginsberg","year":"1993","unstructured":"Ginsberg M.L., Dynamic Backtracking, Journal of Artificial Intelligence Research 1 (1993) 25\u201346.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"27_CR10","unstructured":"Oddi A., Metodi di Sequenziamento ed Algoritmi di Ragionamento Temporale Applicati alla Gestione di Risorse Mediche. Tesi Dottorato di Ricerca in Informatica Medica, Dipartimento di Informatica e Sistemistica, Universit\u00e1 di Roma Sapienza\u201d, Febbraio 1997."},{"key":"27_CR11","unstructured":"Oddi A. and Smith S.F., Stochastic Procedures for Generating Feasible Schedules, to appear in: Proceedings Fourteenth National Conference on Artificial Intelligence (AAAI-97), Providence, Rhode Island, July 27\u201331, 1997."},{"key":"27_CR12","unstructured":"Prosser P., Binary Constraint Satisfaction Problems: Some are Harder than Others, Proc. ECAI-94, ed. A.G.Cohn, Wiley 1994."},{"key":"27_CR13","unstructured":"Smith B.M., Phase Transition and the Mushy Region in Constraint Satisfaction Problems, Proc. ECAI-94, ed. A.G.Cohn, Wiley 1994."}],"container-title":["Lecture Notes in Computer Science","AI*IA 97: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63576-9_117.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:44:30Z","timestamp":1619574270000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63576-9_117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635765","9783540696018"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-63576-9_117","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}