{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:04:20Z","timestamp":1751634260397},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540652243"},{"type":"electronic","value":"9783540494812"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49481-2_8","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:46:10Z","timestamp":1195933570000},"page":"87-101","source":"Crossref","is-referenced-by-count":17,"title":["Global Constraints for Partial CSPs: A Case-Study of Resource and Due Date Constraints"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Baptiste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude","family":"Le Pape","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Peridy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggoun and N. Beldiceanu [1993], Extending CHIP in Order to Solve Complex Scheduling and Placement Problems, Mathematical and Computer Modeling 17:57\u201373.","DOI":"10.1016\/0895-7177(93)90068-A"},{"issue":"2","key":"8_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":"8_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":"8_CR4","unstructured":"Ph. Baptiste [1998], An O(n4) Algorithm for Preemptive Scheduling of a Single Machine to Minimize the Number of Late Jobs, Technical Report 98\/98, Universit\u00e9 de Technologie de Compi\u00e8gne."},{"key":"8_CR5","unstructured":"S. Bistarelli, U. Montanari and F. Rossi [1995], Constraint Solving over Semirings, Proc. 14th International Joint Conference on Artificial Intelligence."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"P. Brucker [1995], Scheduling algorithms, Springer Lehrbuch.","DOI":"10.1007\/978-3-662-03088-2"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"J. Carlier [1982], The One-Machine Sequencing Problem, European Journal of Operational Research 11:42\u201347.","DOI":"10.1016\/S0377-2217(82)80007-6"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"J. Carlier and E. Pinson [1990], A Practical Use of Jackson\u2019s Preemptive Schedule for Solving the Job-Shop Problem, Annals of Operations Research 26:269\u2013287.","DOI":"10.1007\/BF03543071"},{"key":"8_CR9","unstructured":"Y. Caseau and F. Laburthe [1995], Disjunctive Scheduling with Task Intervals, Technical Report, Ecole Normale Sup\u00e9rieure."},{"key":"8_CR10","unstructured":"Y. Caseau and F. Laburthe [1996], CLAIRE: A Parametric Tool to Generate C++ Code for Problem Solving, Working Paper, Bouygues, Direction Scientifique."},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0377-2217(94)00116-T","volume":"81","author":"S. Dauz\u00e9re-P\u00e9r\u00e9s","year":"1995","unstructured":"S. Dauz\u00e9re-P\u00e9r\u00e9s [1995], Minimizing Late Jobs in the General One Machine Scheduling Problem, European Journal of Operational Research 81:134\u2013142.","journal-title":"European Journal of Operational Research"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"E. Freuder and R. Wallace [1992], Partial Constraint Satisfaction, Artificial Intelligence 58:21\u201370.","DOI":"10.1016\/0004-3702(92)90004-H"},{"key":"8_CR13","unstructured":"M. R. Garey and D. S. Johnson [1979], Computers and Intractability. A Guide to the Theory of NP-Completeness, W. H. Freeman and Company."},{"issue":"1","key":"8_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/opre.26.1.121","volume":"26","author":"H. Kise","year":"1978","unstructured":"H. Kise, T. Ibaraki and H. Mine [1978], A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times, Operations Research 26(1):121\u2013126.","journal-title":"Operations Research"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"E. L. Lawler [1990], A Dynamic Programming Algorithm for Preemptive Scheduling of a Single Machine to Minimize the Number of Late Jobs, Annals of Operations Research 26:125\u2013133.","DOI":"10.1007\/BF02248588"},{"key":"8_CR16","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."},{"issue":"1","key":"8_CR17","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J. M. Moore","year":"1968","unstructured":"J. M. Moore [1968], An n job, one machine sequencing algorithm for minimizing the number of late jobs, Management Science 15(1):102\u2013109.","journal-title":"Management Science"},{"key":"8_CR18","unstructured":"W. P. M. Nuijten [1994], Time and Resource Constrained Scheduling: A Constraint Satisfaction Approach, PhD Thesis, Eindhoven University of Technology."},{"key":"8_CR19","unstructured":"L. P\u00e9ridy [1996], Le probl\u00e9me de job-shop: arbitrages et ajustements, PhD Thesis, versit\u00e9 de Technologie de Compi\u00e8gne, France (in French)"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"J-C. R\u00e9gin and J-F. Puget [1997], A Filtering Algorithm for Global Sequencing Constraints, Proc. 3rd International Conference on Principles and Practice of Constraint Programming.","DOI":"10.1007\/BFb0017428"},{"key":"8_CR21","unstructured":"T. Schiex, H. Fargier and G. Verfaillie [1995], Valued Constraint Satisfaction Problems: Hard and Easy Problems, Proc. 14th International Joint Conference on Artificial Intelligence."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49481-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T17:21:41Z","timestamp":1588094501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49481-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540652243","9783540494812"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-49481-2_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}