{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T15:05:00Z","timestamp":1747580700671},"reference-count":76,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"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":4923,"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":[[2000,2]]},"DOI":"10.1016\/s0004-3702(99)00099-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"31-81","source":"Crossref","is-referenced-by-count":26,"title":["Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics"],"prefix":"10.1016","volume":"117","author":[{"given":"J.Christopher","family":"Beck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark S.","family":"Fox","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(99)00099-5_ID005","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Science"},{"issue":"11","key":"10.1016\/S0004-3702(99)00099-5_ID006","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","article-title":"Maintaining knowledge about temporal intervals","volume":"26","author":"Allen","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(99)00099-5_ID007","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of the job-shop scheduling problem","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0004-3702(99)00099-5_ID008","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0004-3702(99)00099-5_ID009","series-title":"Proc. 3rd International Conference on Computer Integrated Manufacturing","article-title":"Disjunctive constraints for manufacturing scheduling: Principles and extensions","author":"Baptiste","year":"1995"},{"key":"10.1016\/S0004-3702(99)00099-5_ID010","series-title":"Proc. 15th Workshop of the UK Planning and Scheduling Special Interest Group","article-title":"Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling","author":"Baptiste","year":"1996"},{"key":"10.1016\/S0004-3702(99)00099-5_ID011","series-title":"Proc. AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI-95, Montreal, Quebec","article-title":"Constraint-based optimization and approximation for job-shop scheduling","author":"Baptiste","year":"1995"},{"key":"10.1016\/S0004-3702(99)00099-5_ID012","series-title":"Proc. First Joint Workshop on Artificial Intelligence and Operations Research","article-title":"Incorporating efficient operations research algorithms in constraint-based scheduling","author":"Baptiste","year":"1995"},{"issue":"11","key":"10.1016\/S0004-3702(99)00099-5_ID013","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-library: Distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0004-3702(99)00099-5_ID014","series-title":"Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling, Ph.D. Thesis","author":"Beck","year":"1999"},{"issue":"2","key":"10.1016\/S0004-3702(99)00099-5_ID015","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/(SICI)1099-1425(199808)1:2<89::AID-JOS9>3.0.CO;2-H","article-title":"The ODO project: Toward a unified basis for constraint-directed scheduling","volume":"1","author":"Beck","year":"1998","journal-title":"J. Scheduling"},{"key":"10.1016\/S0004-3702(99)00099-5_ID016","series-title":"Proc. 3rd International Conference on Principles and Practice of Constraint Programming (CP-97)","first-page":"390","article-title":"Five pitfalls of empirical scheduling research","author":"Beck","year":"1997"},{"key":"10.1016\/S0004-3702(99)00099-5_ID017","series-title":"Proc. AAAI-97, Providence, RI","article-title":"Beyond contention: Extending texture-based scheduling heuristics","author":"Beck","year":"1997"},{"key":"10.1016\/S0004-3702(99)00099-5_ID018","series-title":"Proc. AAAI-97, Providence, RI","article-title":"Texture-based heuristics for scheduling revisited","author":"Beck","year":"1997"},{"issue":"4","key":"10.1016\/S0004-3702(99)00099-5_ID019","first-page":"101","article-title":"A generic framework for constraint-directed search and scheduling","volume":"19","author":"Beck","year":"1998","journal-title":"AI Magazine"},{"key":"10.1016\/S0004-3702(99)00099-5_ID020","series-title":"Proc. AAAI-99, Orlando, FL","article-title":"Scheduling alternative activities","author":"Beck","year":"1999"},{"key":"10.1016\/S0004-3702(99)00099-5_ID021","series-title":"Constrainedness and the phase transition in job shop scheduling, Technical Report","author":"Beck","year":"1997"},{"issue":"1","key":"10.1016\/S0004-3702(99)00099-5_ID022","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0377-2217(95)00362-2","article-title":"The job shop scheduling problem: Conventional and new solution techniques","volume":"93","author":"Blazewicz","year":"1996","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(99)00099-5_ID023","series-title":"Proc. AAAI-96, Portland, OR","first-page":"271","article-title":"Heuristic-based stochastic sampling","author":"Bresina","year":"1996"},{"issue":"2","key":"10.1016\/S0004-3702(99)00099-5_ID024","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job-shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0004-3702(99)00099-5_ID025","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","article-title":"Adjustment of heads and tails for the job-shop problem","volume":"78","author":"Carlier","year":"1994","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(99)00099-5_ID026","series-title":"Proc. 11th International Conference on Logic Programming","article-title":"Improved CLP scheduling with task intervals","author":"Caseau","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID027","series-title":"Proc. 8th Franco-Japanese Conference CCS-95","article-title":"Improving branch and bound for jobshop scheduling with constraint propagation","author":"Caseau","year":"1995"},{"key":"10.1016\/S0004-3702(99)00099-5_ID028","series-title":"Proc. IJCAI-99, Stockholm, Sweden","article-title":"An iterative sampling procedure for resource constrained project scheduling with time windows","author":"Cesta","year":"1999"},{"key":"10.1016\/S0004-3702(99)00099-5_ID029","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1023\/A:1018934507395","article-title":"Applying constraint satisfaction techniques to job shop scheduling","volume":"70","author":"Cheng","year":"1997","journal-title":"Ann. Oper. Res. (Special Volume on Scheduling: Theory and Practice)"},{"key":"10.1016\/S0004-3702(99)00099-5_ID030","series-title":"Empirical Methods for Artificial Intelligence","author":"Cohen","year":"1995"},{"key":"10.1016\/S0004-3702(99)00099-5_ID031","series-title":"ODO: A constraint-based scheduler founded on a unified problem solving model, Master's Thesis","author":"Davis","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID032","series-title":"Proc. IJCAI-93 Workshop on Production Planning, Scheduling and Control, Chamb\u00e9ry, France","article-title":"Odo: A constraint-based scheduling shell","author":"Davis","year":"1993"},{"key":"10.1016\/S0004-3702(99)00099-5_ID033","series-title":"Influence Diagrams, Belief Nets, and Decision Analysis","article-title":"Optimization in constraint networks","author":"Dechter","year":"1990"},{"key":"10.1016\/S0004-3702(99)00099-5_ID034","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1287\/opre.24.4.774","article-title":"Finding some essential characteristics of the feasible solutions for a scheduling problem","volume":"24","author":"Erschler","year":"1976","journal-title":"Oper. Res."},{"key":"10.1016\/S0004-3702(99)00099-5_ID035","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0377-2217(80)90005-3","article-title":"Characterising the set of feasible sequences for n jobs to be carried out on a single machine","volume":"4","author":"Erschler","year":"1980","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(99)00099-5_ID036","series-title":"Industrial Scheduling","first-page":"225","article-title":"Probabilistic learning combinations of local job-shop scheduling rules","author":"Fisher","year":"1963"},{"key":"10.1016\/S0004-3702(99)00099-5_ID037","series-title":"Constraint-directed search: A case study of job-shop scheduling, Ph.D. Thesis, CMU-RI-TR-85-7","author":"Fox","year":"1983"},{"key":"10.1016\/S0004-3702(99)00099-5_ID038","series-title":"Proc. IJCAI-89, Detroit, MI","first-page":"309","article-title":"Constrained heuristic search","author":"Fox","year":"1989"},{"issue":"11","key":"10.1016\/S0004-3702(99)00099-5_ID039","doi-asserted-by":"crossref","first-page":"958","DOI":"10.1145\/359642.359654","article-title":"Synthesizing constraint expressions","volume":"21","author":"Freuder","year":"1978","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/S0004-3702(99)00099-5_ID040","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"},{"key":"10.1016\/S0004-3702(99)00099-5_ID041","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(99)00099-5_ID042","series-title":"Proc. 2nd International Conference on Principles and Practice of Constraint Programming (CP-96)","first-page":"179","article-title":"An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem","author":"Gent","year":"1996"},{"key":"10.1016\/S0004-3702(99)00099-5_ID043","series-title":"Proc. AAAI-96, Portland, OR, Vol. 1","first-page":"246","article-title":"The constrainedness of search","author":"Gent","year":"1996"},{"key":"10.1016\/S0004-3702(99)00099-5_ID044","series-title":"Proc. KI-94: Advances in Artificial Intelligence. 18th German Annual Conference on Artificial Intelligence","first-page":"355","article-title":"The hardest random SAT problems","author":"Gent","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID045","series-title":"Proc. AAAI-98, Madison, WI","first-page":"431","article-title":"Boosting combinatorial search through randomization","author":"Gomes","year":"1998"},{"key":"10.1016\/S0004-3702(99)00099-5_ID046","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00099-5_ID047","series-title":"Nonsystematic backtracking search, Ph.D. Thesis","author":"Harvey","year":"1995"},{"key":"10.1016\/S0004-3702(99)00099-5_ID048","series-title":"Proc. IJCAI-95, Montreal, Quebec","first-page":"607","article-title":"Limited discrepancy search","author":"Harvey","year":"1995"},{"key":"10.1016\/S0004-3702(99)00099-5_ID049","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF00881805","article-title":"Branching rules for satisfiability","volume":"15","author":"Hooker","year":"1995","journal-title":"J. Automat. Reason."},{"issue":"1","key":"10.1016\/S0004-3702(99)00099-5_ID050","first-page":"32","article-title":"Algorithms for constraint satisfaction problems: A survey","volume":"13","author":"Kumar","year":"1992","journal-title":"AI Magazine"},{"key":"10.1016\/S0004-3702(99)00099-5_ID051","series-title":"Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (Supplement), Ph.D. Thesis","author":"Lawrence","year":"1984"},{"issue":"2","key":"10.1016\/S0004-3702(99)00099-5_ID052","first-page":"55","article-title":"Implementation of resource constraints in ILOG Schedule: A library for the development of constraint-based scheduling systems","volume":"3","author":"Le Pape","year":"1994","journal-title":"Int. Syst. Engrg."},{"key":"10.1016\/S0004-3702(99)00099-5_ID053","series-title":"Proc. AAAI-SIGMAN Workshop on Artificial Intelligence Approaches to Modelling and Scheduling Manufacturing Processes","article-title":"Using a constraint-based scheduling library to solve a specific scheduling problem","author":"Le Pape","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID054","series-title":"Proc. 12th European Conference on Artificial Intelligence (ECAI-96), Budapest, Hungary","article-title":"Constraint propagation techniques for disjunctive scheduling: The preemptive case","author":"Le Pape","year":"1996"},{"key":"10.1016\/S0004-3702(99)00099-5_ID055","series-title":"Proc. CP-97 Workshop on Industrial Constraint-Directed Scheduling, Schloss Hagenberg, Austria","article-title":"An experimental comparison of constraint-based algorithms for the preemptive job shop scheduling problem","author":"Le Pape","year":"1997"},{"key":"10.1016\/S0004-3702(99)00099-5_ID056","series-title":"Proc. IJCAI-93, Chambery, France, Vol. 1","first-page":"232","article-title":"Consistency techniques for numeric CSPs","author":"Lhomme","year":"1993"},{"key":"10.1016\/S0004-3702(99)00099-5_ID057","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00099-5_ID058","series-title":"Proc. 5th Conference on Integer Programming and Combinatorial Optimization","article-title":"A new approach to computing optimal schedules for the job shop scheduling problem","author":"Martin","year":"1996"},{"key":"10.1016\/S0004-3702(99)00099-5_ID059","series-title":"Proc. AAAI-92, San Jose, CA","first-page":"459","article-title":"Hard and easy distributions of SAT problems","author":"Mitchell","year":"1992"},{"key":"10.1016\/S0004-3702(99)00099-5_ID060","series-title":"Scheduling by iterative partition of bottleneck conflicts, Technical Report CMU-RI-TR-92-05","author":"Muscettola","year":"1992"},{"key":"10.1016\/S0004-3702(99)00099-5_ID061","series-title":"Proc. AAAI-94, Seattle, WA","first-page":"1105","article-title":"On the utility of bottleneck reasoning for scheduling","author":"Muscettola","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID062","series-title":"Time and resource constrained scheduling: A constraint satisfaction approach, Ph.D. Thesis","author":"Nuijten","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID063","series-title":"Proc. IJCAI-93 Workshop on Knowledge-Based Production, Scheduling and Control, Chamb\u00e9ry, France","first-page":"251","article-title":"Randomized constraint satisfaction for job shop scheduling","author":"Nuijten","year":"1993"},{"key":"10.1016\/S0004-3702(99)00099-5_ID064","series-title":"Proc. AAAI-97, Providence, RI","article-title":"Stochastic procedures for generating feasible schedules","author":"Oddi","year":"1997"},{"key":"10.1016\/S0004-3702(99)00099-5_ID065","series-title":"Proc. AAAI-94, Seattle, WA, Vol. 1","first-page":"362","article-title":"A filtering algorithm for constraints of difference in CSPs","author":"R\u00e9gin","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID066","series-title":"Proc. AAAI-96, Portland, OR, Vol. 1","first-page":"209","article-title":"Generalized arc consistency for global cardinality constraint","author":"R\u00e9gin","year":"1996"},{"key":"10.1016\/S0004-3702(99)00099-5_ID067","series-title":"Lookahead techniques for micro-opportunistic job-shop scheduling, Ph.D. Thesis, CMU-CS-91-102","author":"Sadeh","year":"1991"},{"key":"10.1016\/S0004-3702(99)00099-5_ID068","series-title":"Intelligent Scheduling","first-page":"99","article-title":"Micro-opportunistic scheduling","author":"Sadeh","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID069","series-title":"Preference propagation in temporal\/capacity constraint graphs, Technical Report CMU-RI-TR-89-2","author":"Sadeh","year":"1989"},{"issue":"1","key":"10.1016\/S0004-3702(99)00099-5_ID070","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(95)00098-4","article-title":"Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem","volume":"86","author":"Sadeh","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00099-5_ID071","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0004-3702(73)90011-8","article-title":"The structure of ill-structured problems","volume":"4","author":"Simon","year":"1973","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(99)00099-5_ID072","series-title":"Trying harder to fail first, Technical Report 97.45","author":"Smith","year":"1997"},{"key":"10.1016\/S0004-3702(99)00099-5_ID073","series-title":"Proc. International Symposium for Computer Scientists","article-title":"OPIS: An opportunistic factory scheduling system","author":"Smith","year":"1989"},{"key":"10.1016\/S0004-3702(99)00099-5_ID074","series-title":"Exploiting temporal knowledge to organize constraints, Technical Report CMU-RI-TR-83-12","author":"Smith","year":"1983"},{"key":"10.1016\/S0004-3702(99)00099-5_ID075","series-title":"Intelligent Scheduling","first-page":"29","article-title":"OPIS: A methodology and architecture for reactive scheduling","author":"Smith","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID076","series-title":"Proc. AAAI-93, Washington, DC","first-page":"139","article-title":"Slack-based heuristics for constraint satisfaction scheduling","author":"Smith","year":"1993"},{"key":"10.1016\/S0004-3702(99)00099-5_ID077","series-title":"Proc. AAAI-99, Orlando, FL","first-page":"163","article-title":"Encodings of non-binary constraint satisfaction problems","author":"Stergiou","year":"1999"},{"key":"10.1016\/S0004-3702(99)00099-5_ID078","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","article-title":"Benchmarks for basic scheduling problems","volume":"64","author":"Taillard","year":"1993","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0004-3702(99)00099-5_ID079","series-title":"Job shop scheduling by local search, Technical Report COSOR Memorandum 94-05","author":"Vaessens","year":"1994"},{"key":"10.1016\/S0004-3702(99)00099-5_ID080","series-title":"Constraint Satisfaction in Logic Programming","author":"Van Hentenryck","year":"1989"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370299000995?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370299000995?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T02:34:38Z","timestamp":1621046078000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370299000995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":76,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0004370299000995"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(99)00099-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}