{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:06Z","timestamp":1725455886444},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637530"},{"type":"electronic","value":"9783540696421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0017454","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:46Z","timestamp":1132644166000},"page":"375-389","source":"Crossref","is-referenced-by-count":9,"title":["Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Baptiste","sequence":"first","affiliation":[]},{"given":"Claude","family":"Le Pape","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A. Aggoun","year":"1993","unstructured":"A. Aggoun and N. Beldiceanu [1993], Extending CHIP in Order to Solve Complex Scheduling and Placement Problems, Mathematical and Computer Modelling 17:57\u201373.","journal-title":"Mathematical and Computer Modelling"},{"issue":"2","key":"30_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"D. Applegate and W. Cook [1991], A Computational Study of the Job-Shop Scheduling Problem, ORSA Journal on Computing 3(2):149\u2013156.","journal-title":"ORSA Journal on Computing"},{"key":"30_CR3","unstructured":"Ph. Baptiste and C. Le Pape [1995], A Theoretical and Experimental Comparison of Constraint Propagation Techniques for Disjunctive Scheduling, Proc. 14th International Joint Conference on Artificial Intelligence."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"P. Brucker, S. Knust, A. Schoo, and O. Thiele [1997], A Branch and Bound Algorithm for the Resource-Constrained Project Scheduling Problem, Working Paper, University of Osnabr\u00fcck, 1997.","DOI":"10.1016\/S0377-2217(97)00335-4"},{"issue":"3","key":"30_CR5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1051\/ro\/1991250303111","volume":"25","author":"J. Carlier","year":"1991","unstructured":"J. Carlier and B. Latapie [1991], Une m\u00e9thode arborescente pour r\u00e9soudre les probl\u00e8mes cumulatifs, RAIRO Recherche op\u00e9rationnelle \/ Operations Research 25(3):311\u2013340.","journal-title":"RAIRO Recherche op\u00e9rationnelle \/ Operations Research"},{"key":"30_CR6","unstructured":"J. Carlier and E. N\u00e9ron [1996], A New Branch-and-Bound Method for Solving the Resource-Constrained Project Scheduling Problem, Proc. International Workshop on Production Planning and Control."},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"J. Carlier and E. Pinson [1990], A Practical Use of Jackson's Preemptive Schedule for Solving the Job-Shop Problem, Annals of Operations Research 26:269\u2013287.","journal-title":"Annals of Operations Research"},{"key":"30_CR8","unstructured":"Y. Caseau and F. Laburthe [1995], Disjunctive Scheduling with Task Intervals, Technical Report, Ecole Normale Sup\u00e9rieure."},{"key":"30_CR9","unstructured":"Y. Caseau and F. Laburthe [1996a], Cumulative Scheduling with Task Intervals, Proc. Joint International Conference and Symposium on Logic Programming."},{"key":"30_CR10","unstructured":"Y. Caseau and F. Laburthe [1996b], CLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving, Working Paper, Bouygues, Direction Scientifique."},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"A. Cesta and A. Oddi [1996], Gaining Efficiency and Flexibility in the Simple Temporal Problem, Proc. 3rd International Workshop on Temporal Representation and Reasoning.","DOI":"10.1109\/TIME.1996.555676"},{"issue":"12","key":"30_CR12","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1287\/mnsc.38.12.1803","volume":"38","author":"E. Demeulemeester","year":"1992","unstructured":"E. Demeulemeester and W. Herroelen [1992], A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem, Management Science 38(12):1803\u20131818.","journal-title":"Management Science"},{"key":"30_CR13","unstructured":"M. R. Garcy and D. S. Johnson [1979], Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Company."},{"key":"30_CR14","unstructured":"M. Gondran and M. Minoux [1984], Graphs and Algorithms, John Wiley and Sons."},{"issue":"10","key":"30_CR15","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R. Kolisch","year":"1995","unstructured":"R. Kolisch, A. Sprecher, and A. Drexl [1995], Characterization and Generation of a General Class of Resource-Constrained Project Scheduling Problems, Management Science 41(10):1693\u20131703.","journal-title":"Management Science"},{"issue":"2","key":"30_CR16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1049\/ise.1994.0009","volume":"3","author":"C. Pape Le","year":"1994","unstructured":"C. Le Pape [1994], Implementation of Resource Constraints in ILOG SCHEDULE: A Library for the Development of Constraint-Based Scheduling Systems, Intelligent Systems Engineering 3(2):55\u201366.","journal-title":"Intelligent Systems Engineering"},{"key":"30_CR17","unstructured":"C. Le Pape and Ph. Baptiste [1996], Constraint Propagation Techniques for Disjunctive Scheduling: The Preemptive Case, Proc. 12th European Conference on Artificial Intelligence."},{"key":"30_CR18","unstructured":"C. Le Pape and Ph. Baptiste [1997], A Constraint Programming Library for Preemptive and Non-Preemptive Scheduling, Proc. 3rd International Conference on the Practical Application of Constraint Technology."},{"key":"30_CR19","unstructured":"O. Lhomme [1993], Consistency Techniques for Numeric CSPs, Proc. 13th International Joint Conference on Artificial Intelligence."},{"key":"30_CR20","unstructured":"W. P. M. Nuijten [1994], Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, PhD Thesis, Eindhoven University of Technology."},{"issue":"7","key":"30_CR21","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1287\/mnsc.30.7.854","volume":"30","author":"J. H. Patterson","year":"1984","unstructured":"J. H. Patterson [1984], A Comparison of Exact Approaches for Solving the Multiple Constrained Resource Project Scheduling Problem, Management Science 30(7):854\u2013867.","journal-title":"Management Science"},{"key":"30_CR22","unstructured":"M. Perregaard [1995], Branch and Bound Methods for the Multi-Processor Job Shop and Flow Shop Scheduling Problem, MSc Thesis, University of Copenhagen."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming-CP97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017454","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T02:53:30Z","timestamp":1586573610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637530","9783540696421"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0017454","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}