{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:47:24Z","timestamp":1752461244895},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":6599,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0004-3702(95)00078-s","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:57:34Z","timestamp":1027601854000},"page":"455-480","source":"Crossref","is-referenced-by-count":24,"title":["Backtracking techniques for the job shop scheduling constraint satisfaction problem"],"prefix":"10.1016","volume":"76","author":[{"given":"Norman","family":"Sadeh","sequence":"first","affiliation":[]},{"given":"Katia","family":"Sycara","sequence":"additional","affiliation":[]},{"given":"Yalin","family":"Xiong","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(95)00078-S_BIB1","series-title":"Proceedings First International Conference on Expert Planning Systems","article-title":"Operations research and artificial intelligence cooperation to solve scheduling problems","author":"Badie","year":"1990"},{"issue":"11","key":"10.1016\/0004-3702(95)00078-S_BIB2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/361219.361224","article-title":"Backtrack programming techniques","volume":"18","author":"Bitner","year":"1975","journal-title":"Commun. ACM"},{"article-title":"A distributed asynchronous system for predictive and reactive scheduling","year":"1989","author":"Burke","key":"10.1016\/0004-3702(95)00078-S_BIB3"},{"key":"10.1016\/0004-3702(95)00078-S_BIB4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","article-title":"Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition","volume":"41","author":"Dechter","year":"1989","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00078-S_BIB5","series-title":"Proceedings of IJCAI-89","first-page":"271","article-title":"Experimental evaluation of preprocessing techniques in constraint satisfaction problems","author":"Dechter","year":"1989"},{"issue":"1","key":"10.1016\/0004-3702(95)00078-S_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"Artif. Intell."},{"issue":"3","key":"10.1016\/0004-3702(95)00078-S_BIB7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0004-3702(79)90008-0","article-title":"A truth maintenance system","volume":"12","author":"Doyle","year":"1979","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00078-S_BIB8","series-title":"Proceedings IJCAI-89","first-page":"309","article-title":"Constrained heuristic search","author":"Fox","year":"1989"},{"issue":"1","key":"10.1016\/0004-3702(95)00078-S_BIB9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition for backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"year":"1979","author":"Garey","key":"10.1016\/0004-3702(95)00078-S_BIB10"},{"article-title":"Performance measurement and analysis of certain search algorithms","year":"1979","author":"Gaschnig","key":"10.1016\/0004-3702(95)00078-S_BIB11"},{"issue":"4","key":"10.1016\/0004-3702(95)00078-S_BIB12","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1145\/321296.321300","article-title":"Backtrack programming","volume":"12","author":"Golomb","year":"1965","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0004-3702(95)00078-S_BIB13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","article-title":"Increasing tree search efficiency for constraint satisfaction problems","volume":"14","author":"Haralick","year":"1980","journal-title":"Artif. Intell."},{"year":"1974","series-title":"Operations Research in Production Planning, Scheduling, and Inventory Control","author":"Johnson","key":"10.1016\/0004-3702(95)00078-S_BIB14"},{"article-title":"Management of temporal constraints for factory scheduling","year":"1987","author":"Le Pape","key":"10.1016\/0004-3702(95)00078-S_BIB15_1"},{"year":"1987","series-title":"Proceedings Working Conference on Temporal Aspects in Information Systems","author":"Le Pape","key":"10.1016\/0004-3702(95)00078-S_BIB15_2"},{"issue":"1","key":"10.1016\/0004-3702(95)00078-S_BIB16","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problems","volume":"25","author":"Mackworth","year":"1985","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(95)00078-S_BIB17","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0004-3702(83)80007-1","article-title":"Search rearrangement backtracking and polynomial average time","volume":"21","author":"Purdom","year":"1983","journal-title":"Artif. Intell."},{"article-title":"Look-ahead techniques for micro-opportunistic job shop scheduling","year":"1991","author":"Sadeh","key":"10.1016\/0004-3702(95)00078-S_BIB18"},{"key":"10.1016\/0004-3702(95)00078-S_BIB19","series-title":"Intelligent Scheduling","article-title":"Micro-opportunistic scheduling: the MICRO-BOSS factory scheduler","author":"Sadeh","year":"1994"},{"article-title":"Preference propagation in temporal\/capacity constraint graphs","year":"1988","author":"Sadeh","key":"10.1016\/0004-3702(95)00078-S_BIB20"},{"key":"10.1016\/0004-3702(95)00078-S_BIB21","unstructured":"also: Robotics Institute Technical Report CMU-RI-TR-89-2."},{"key":"10.1016\/0004-3702(95)00078-S_BIB22","series-title":"Proceedings NASA Conference on Space Telerobotics","article-title":"Focus of attention in an activity-based scheduler","author":"Sadeh","year":"1989"},{"key":"10.1016\/0004-3702(95)00078-S_BIB23","series-title":"Proceedings Fourth International Conference on Expert Systems in Production and Operations Management","first-page":"134","article-title":"Variable and value ordering heuristics for activity-based job-shop scheduling","author":"Sadeh","year":"1990"},{"article-title":"Variable and value ordering heuristics for hard constraint satisfaction problems: an application to job shop scheduling","year":"1992","author":"Sadeh","key":"10.1016\/0004-3702(95)00078-S_BIB24"},{"key":"10.1016\/0004-3702(95)00078-S_BIB25","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0004-3702(77)90029-7","article-title":"Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis","volume":"9","author":"Stallman","year":"1977","journal-title":"Artif. Intell."},{"issue":"6","key":"10.1016\/0004-3702(95)00078-S_BIB26","doi-asserted-by":"crossref","DOI":"10.1109\/21.135688","article-title":"Distributed constrained heuristic search","volume":"21","author":"Sycara","year":"1991","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1016\/0004-3702(95)00078-S_BIB27","series-title":"Combinatorial Analysis, Proceedings Symposium on Applied Mathematics","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1090\/psapm\/010\/0121306","article-title":"An enumerative technique for a class of combinatorial problems","author":"Walker","year":"1960"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029500078S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029500078S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T08:27:48Z","timestamp":1556180868000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029500078S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["000437029500078S"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(95)00078-s","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}