{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:20:25Z","timestamp":1772792425916,"version":"3.50.1"},"reference-count":78,"publisher":"Elsevier","isbn-type":[{"value":"9780444527264","type":"print"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1016\/s1574-6526(06)80026-x","type":"book-chapter","created":{"date-parts":[[2008,2,26]],"date-time":"2008-02-26T16:51:39Z","timestamp":1204044699000},"page":"761-799","source":"Crossref","is-referenced-by-count":35,"title":["Constraint-Based Scheduling and Planning"],"prefix":"10.1016","member":"78","reference":[{"issue":"2","key":"10.1016\/S1574-6526(06)80026-X_bib1","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 Journal on Computing"},{"key":"10.1016\/S1574-6526(06)80026-X_bib2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00291-003-0155-1","article-title":"Tight LP bounds for resource constrained project scheduling","volume":"26","author":"Baptiste","year":"2004","journal-title":"OR Spektrum"},{"key":"10.1016\/S1574-6526(06)80026-X_bib3","series-title":"Proc. 15th Workshop of the U.K. Planning Special Interest Group","article-title":"Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling","author":"Baptiste","year":"1996"},{"key":"10.1016\/S1574-6526(06)80026-X_bib4","series-title":"Proc. 1st International Joint Workshop on Artificial Intelligence and Operations Research","article-title":"Incorporating efficient operations research algorithms in constraint-based scheduling","author":"Baptiste","year":"1995"},{"key":"10.1016\/S1574-6526(06)80026-X_bib5","series-title":"Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems","author":"Baptiste","year":"2001"},{"issue":"1\u20132","key":"10.1016\/S1574-6526(06)80026-X_bib6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","article-title":"Fast Planning Through Planning Graph Analysis","volume":"90","author":"Blum","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80026-X_bib7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01539706","article-title":"A branch and bound method for the general shop problem with sequence dependent setup-times","volume":"18","author":"Brucker","year":"1996","journal-title":"OR Spektrum"},{"key":"10.1016\/S1574-6526(06)80026-X_bib8","article-title":"Probl\u00e8mes d'Ordonnancement \u00e0 Contraintes de Ressources: Algorithmes et Complexit\u00e9","author":"Carlier","year":"1984","journal-title":"Th\u00e8se de doctorat d'Etat, Universit\u00e9 Paris VI"},{"issue":"2","key":"10.1016\/S1574-6526(06)80026-X_bib9","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\/S1574-6526(06)80026-X_bib10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","article-title":"A practical use of Jackson's preemptive schedule for solving the job shop problem","volume":"26","author":"Carlier","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80026-X_bib11","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 Journal of Operational Research"},{"key":"10.1016\/S1574-6526(06)80026-X_bib12","series-title":"Proc. 11th International Conference on Logic Programming","article-title":"Improved CLP scheduling with task intervals","author":"Caseau","year":"1994"},{"key":"10.1016\/S1574-6526(06)80026-X_bib13","article-title":"Disjunctive scheduling with task intervals","author":"Caseau","year":"1995","journal-title":"Technical report, Ecole Normale Superieure"},{"key":"10.1016\/S1574-6526(06)80026-X_bib14","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1017\/S0269888901000078","article-title":"Combining local and global search in a constraint programming environment","volume":"16","author":"Caseau","year":"2001","journal-title":"Knowledge Engineering Review"},{"key":"10.1016\/S1574-6526(06)80026-X_bib15","series-title":"Third International Conference on Temporal Representation and Reasoning (TIME-96)","article-title":"Gaining efficiency and flexibility in the simple temporal problem","author":"Cesta","year":"1996"},{"key":"10.1016\/S1574-6526(06)80026-X_bib16","series-title":"ECP-97","article-title":"A time and resource problem for planning architectures","author":"Cesta","year":"1997"},{"key":"10.1016\/S1574-6526(06)80026-X_bib17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0004-3702(87)90092-0","article-title":"Planning for Conjunctive Goals","volume":"33","author":"Chapman","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80026-X_bib18","series-title":"Proc. SpaceOps 2000","article-title":"ASPEN \u2014 Automating Space Mission Operations using Automated Planning and Scheduling","author":"Chien","year":"2000"},{"key":"10.1016\/S1574-6526(06)80026-X_bib19","article-title":"Int\u00e9gration des techniques de recherche locale \u00e0 la programmation lin\u00e9aire en nombres entiers","author":"Danna","year":"2004","journal-title":"PhD thesis, Universit\u00e9 d'Avignon et des Pays de Vaucluse"},{"key":"10.1016\/S1574-6526(06)80026-X_bib20","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","article-title":"Exploring relaxation induced neighborhoods to improve MIP solutions","volume":"102","author":"Danna","year":"2005","journal-title":"Mathematical Programming"},{"issue":"1\u20133","key":"10.1016\/S1574-6526(06)80026-X_bib21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80026-X_bib22","series-title":"Annotated Bibliographies in Combinatorial Optimization","article-title":"Linear assignment","author":"Dell'Amico","year":"1997"},{"issue":"2","key":"10.1016\/S1574-6526(06)80026-X_bib23","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(01)00128-X","article-title":"Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP","volume":"132","author":"Do","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80026-X_bib24","article-title":"Analyse sous contraintes et aide \u00e0 la d\u00e9cision pour certains probl\u00e8mes d'ordonnancement","author":"Erschler","year":"1976","journal-title":"Th\u00e8se de doctorat d'etat, Universit\u00e9 Paul Sabatier"},{"key":"10.1016\/S1574-6526(06)80026-X_bib25","first-page":"7","article-title":"Raisonnement temporel sous contraintes de ressource et probl\u00e8mes d'ordonnacement","volume":"5","author":"Erschler","year":"1991","journal-title":"Revue d'Intelligence Artificielle"},{"key":"10.1016\/S1574-6526(06)80026-X_bib26","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","article-title":"STRIPS: a new approach to the application of theorem proving to problem solving","volume":"2","author":"Fikes","year":"1971","journal-title":"Artificial Intelligence"},{"issue":"6","key":"10.1016\/S1574-6526(06)80026-X_bib27","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: Shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Communications of the ACM"},{"key":"10.1016\/S1574-6526(06)80026-X_bib28","article-title":"Solving Combinatorial Optimization Problems in Constraint Programming","author":"Focacci","year":"2001","journal-title":"PhD thesis, Universit\u00e0 di Ferrara"},{"key":"10.1016\/S1574-6526(06)80026-X_bib29","series-title":"Proc. CPAIOR '00","article-title":"A constraint propagation algorithm for scheduling with sequence dependent setup times","author":"Focacci","year":"2000"},{"key":"10.1016\/S1574-6526(06)80026-X_bib30","series-title":"Proc. Fifth International Conference on Artificial Intelligence Planning and Scheduling, AIPS'00","first-page":"92","article-title":"Solving scheduling problems with setup times and alternative resources","author":"Focacci","year":"2000"},{"key":"10.1016\/S1574-6526(06)80026-X_bib31","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-3615(90)90107-Z","article-title":"Constraint-guided scheduling: A short history","volume":"14","author":"Fox","year":"1990","journal-title":"Computers in Industry"},{"issue":"4","key":"10.1016\/S1574-6526(06)80026-X_bib32","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1023\/A:1025842019552","article-title":"Constraint-Based Attribute and Interval Planning","volume":"8","author":"Frank","year":"2003","journal-title":"Constraints"},{"key":"10.1016\/S1574-6526(06)80026-X_bib33","series-title":"Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop","author":"French","year":"1982"},{"key":"10.1016\/S1574-6526(06)80026-X_bib34","first-page":"193","article-title":"Algorithms and code for the assignment problem","volume":"13","author":"Martello","year":"1988","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80026-X_bib35","series-title":"Proc. AIPS-94","first-page":"61","article-title":"Representation and control in IxTeT, a temporal planner","author":"Ghallab","year":"1994"},{"key":"10.1016\/S1574-6526(06)80026-X_bib36","series-title":"Automated Planning: Theory and Practice","author":"Ghallab","year":"2004"},{"key":"10.1016\/S1574-6526(06)80026-X_bib37","series-title":"Graphs and Algorithms","author":"Gondran","year":"1984"},{"key":"10.1016\/S1574-6526(06)80026-X_bib38","series-title":"Proc. 14th International Joint Conference on Artificial Intelligence","article-title":"Limited discrepancy search","author":"Harvey","year":"1995"},{"key":"10.1016\/S1574-6526(06)80026-X_bib39","series-title":"ILOG CPLEX 9.0 User's Manual and Reference Manual","author":"ILOG CPLEX","year":"2003"},{"key":"10.1016\/S1574-6526(06)80026-X_bib40","series-title":"Proc. AIPS-00","article-title":"Planning in Interplanetary Space: Theory and Practice","author":"Jonsson","year":"2000"},{"key":"10.1016\/S1574-6526(06)80026-X_bib41","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(02)00362-4","article-title":"Algorithms for propagation resource constraints in AI planning and scheduling: Existing approaches and new results","volume":"143","author":"Laborie","year":"2003","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80026-X_bib42","series-title":"Proc. IJCAI-95","first-page":"1643","article-title":"Planning with sharable resource constraints","author":"Laborie","year":"1995"},{"key":"10.1016\/S1574-6526(06)80026-X_bib43","series-title":"Proc. Oberwolfach Workshop on Mathematics in the Supply Chain","article-title":"Experiments with cooperative optimization algorithms for production scheduling","author":"Le Pape","year":"2004"},{"key":"10.1016\/S1574-6526(06)80026-X_bib44","article-title":"Des syst\u00e8mes d'ordonnancement flexibles et opportunistes","author":"Le Pape","year":"1988","journal-title":"PhD thesis, University Paris XI"},{"issue":"2","key":"10.1016\/S1574-6526(06)80026-X_bib45","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","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":"Intelligent Systems Engineering"},{"key":"10.1016\/S1574-6526(06)80026-X_bib46","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1009613717770","article-title":"Heuristic control of a constraint-based algorithm for the preemptive job-shop scheduling problem","volume":"5","author":"Le Pape","year":"1999","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S1574-6526(06)80026-X_bib47","series-title":"Temporal Aspects in Information Systems","article-title":"Management of Temporal Constraints for Factory Scheduling","author":"Le Pape","year":"1988"},{"key":"10.1016\/S1574-6526(06)80026-X_bib48","first-page":"19","article-title":"Time-versus-capacity compromises in project scheduling","volume":"91","author":"Le Pape","year":"1995","journal-title":"AISB Quarterly"},{"key":"10.1016\/S1574-6526(06)80026-X_bib49","series-title":"Proc. 13th International Joint Conference on Artificial Intelligence","article-title":"Consistency techniques for numeric CSPs","author":"Lhomme","year":"1993"},{"key":"10.1016\/S1574-6526(06)80026-X_bib50","series-title":"Working Paper, University of Karlsruhe","article-title":"An implementation of the cumulative constraint","author":"Lock","year":"1996"},{"key":"10.1016\/S1574-6526(06)80026-X_bib51","series-title":"Proc. IJCAI-03","first-page":"954","article-title":"Generalizing GraphPlan by Formulating Planning as a CSP","author":"Lopez","year":"2004"},{"key":"10.1016\/S1574-6526(06)80026-X_bib52","series-title":"Proc. Fifth International IPCO conference","first-page":"389","article-title":"A new approach to computing optimal schedules for the job shop scheduling problem","author":"Martin","year":"1996"},{"key":"10.1016\/S1574-6526(06)80026-X_bib53","series-title":"Proc. AAAI-91","first-page":"634","article-title":"Systematic Nonlinear Planning","author":"McAllester","year":"1991"},{"key":"10.1016\/S1574-6526(06)80026-X_bib54","article-title":"Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach","author":"Nuijten","year":"1994","journal-title":"PhD thesis, Eindhoven University of Technology"},{"key":"10.1016\/S1574-6526(06)80026-X_bib55","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1009687210594","article-title":"Constraint-based job shop scheduling with ILOG Scheduler","volume":"3","author":"Nuijten","year":"1998","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S1574-6526(06)80026-X_bib56","article-title":"Job shop scheduling by constraint satisfaction","author":"Nuijten","year":"1993"},{"key":"10.1016\/S1574-6526(06)80026-X_bib57","series-title":"Proc. PMS 2000","first-page":"224","article-title":"New time-bound adjustment techniques for shop scheduling","author":"Nuijten","year":"2000"},{"key":"10.1016\/S1574-6526(06)80026-X_bib58","series-title":"Proc. 9th International Conference on Project Management and Scheduling","first-page":"162","article-title":"Towards an industrial manufacturing scheduling problem and test bed","author":"Nuijten","year":"2004"},{"key":"10.1016\/S1574-6526(06)80026-X_bib59","article-title":"Le probl\u00e8me de job-shop: arbitrage et ajustements","author":"Peridy","year":"1996","journal-title":"PhD thesis, Universit\u00e9 de Technologie de Compi\u00e8gne"},{"key":"10.1016\/S1574-6526(06)80026-X_bib60","series-title":"Proc. 4th International Conference on Principles and Practice of Constraint Programming","article-title":"A generic model and hybrid algorithm for hoist scheduling problems","author":"Rodosek","year":"1998"},{"key":"10.1016\/S1574-6526(06)80026-X_bib61","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1018904229454","article-title":"A new approach to integrating mixed integer programming and constraint logic programming","volume":"86","author":"Rodosek","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S1574-6526(06)80026-X_bib62","article-title":"A Structure for Plans and Behaviours","author":"Sacerdoti","year":"1975"},{"key":"10.1016\/S1574-6526(06)80026-X_bib63","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1023\/A:1009856210543","article-title":"Probe backtrack search for minimal perturbation in dynamic scheduling","volume":"5","author":"El Sakkout","year":"2000","journal-title":"Constraints"},{"key":"10.1016\/S1574-6526(06)80026-X_bib64","series-title":"Combinatorial Optimization","author":"Schrijver","year":"2003"},{"key":"10.1016\/S1574-6526(06)80026-X_bib65","series-title":"Resource Allocation in Project Management","author":"Schwindt","year":"2005"},{"issue":"1","key":"10.1016\/S1574-6526(06)80026-X_bib66","doi-asserted-by":"crossref","DOI":"10.1017\/S0269888900001089","article-title":"Bridging the gap between planning and scheduling","volume":"15","author":"Smith","year":"2000","journal-title":"Knowledge Engineering Review"},{"key":"10.1016\/S1574-6526(06)80026-X_bib67","series-title":"Intelligent Scheduling","article-title":"OPIS: A Methodology and Architecture for Reactive Scheduling","author":"Smith","year":"1994"},{"key":"10.1016\/S1574-6526(06)80026-X_bib68","series-title":"Proc. 11th National Conference on Artificial Intelligence","article-title":"Slack-based heuristics for constraint satisfaction","author":"Smith","year":"1993"},{"issue":"4","key":"10.1016\/S1574-6526(06)80026-X_bib69","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/ijoc.12.4.341.11881","article-title":"Multiple-machine lower bounds for shop scheduling problems","volume":"12","author":"Sourd","year":"2000","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S1574-6526(06)80026-X_bib70","article-title":"The Definition and Implementation of a Computer Programming Language Based on Constraints","author":"Steele","year":"1980","journal-title":"PhD thesis, Massachusetts Institute of Technology"},{"key":"10.1016\/S1574-6526(06)80026-X_bib71","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/S0377-2217(99)00497-X","article-title":"On not-first\/not-last conditions in disjunctive scheduling","volume":"127","author":"Torres","year":"2000","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S1574-6526(06)80026-X_bib72","series-title":"Foundations of Constraint Satisfaction","author":"Tsang","year":"1993"},{"key":"10.1016\/S1574-6526(06)80026-X_bib73","series-title":"Proc. AAAI-99","first-page":"585","article-title":"A constraint programming approach to planning","author":"van Beek","year":"1999"},{"key":"10.1016\/S1574-6526(06)80026-X_bib74","series-title":"Actes 2\u00e8mes journ\u00e9es francophones de programmation logique","article-title":"Le traitement des contraintes disjonctives dans un probl\u00e8me d'ordonnancement : exemple du hoist scheduling problem","author":"Varnier","year":"1993"},{"key":"10.1016\/S1574-6526(06)80026-X_bib75","article-title":"Branching and Pruning: An Optimal Temporal POCL Planner based on Constraint Programming","author":"Vidal","year":"2005","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S1574-6526(06)80026-X_bib76","series-title":"Proceedings of Fifth National Conference on Artificial Intelligence","first-page":"377","article-title":"Constraint propagation algorithms for temporal reasoning","author":"Vilain","year":"1986"},{"key":"10.1016\/S1574-6526(06)80026-X_bib77","series-title":"Proc. CPAIOR '04","first-page":"319","article-title":"O(n log n) filtering algorithms for unary resource constraint","author":"Vilim","year":"2004"},{"key":"10.1016\/S1574-6526(06)80026-X_bib78","series-title":"Proc. CP 2004","first-page":"62","article-title":"Unary resource constraint with optional activities","author":"Vilim","year":"2004"}],"container-title":["Foundations of Artificial Intelligence","Handbook of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157465260680026X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157465260680026X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T02:52:02Z","timestamp":1761619922000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157465260680026X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9780444527264"],"references-count":78,"URL":"https:\/\/doi.org\/10.1016\/s1574-6526(06)80026-x","relation":{},"ISSN":["1574-6526"],"issn-type":[{"value":"1574-6526","type":"print"}],"subject":[],"published":{"date-parts":[[2006]]}}}