{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:38Z","timestamp":1725664238862},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602996"},{"type":"electronic","value":"9783540447887"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60299-2_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:15:16Z","timestamp":1330262116000},"page":"549-562","source":"Crossref","is-referenced-by-count":7,"title":["Reducing domains for search in CLP(FD) and its application to job-shop scheduling"],"prefix":"10.1007","author":[{"given":"Hans-Joachim","family":"Goltz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"7","key":"33_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. Extending CHIP in order to solve complex scheduling and placement problems. Math. Comput. Modelling, 17(7):57\u201373, 1993.","journal-title":"Math. Comput. Modelling"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"D. Applegate and W. Cook. A computational study of job-shop scheduling. Operations Research Society of America, 3(2), 1991.","DOI":"10.1287\/ijoc.3.2.149"},{"volume-title":"Constraint Logic Programming (Selected Research)","year":"1993","key":"33_CR3","unstructured":"F. Benhamou and A. Colmerauer, editors. Constraint Logic Programming (Selected Research). MIT Press, Cambridge, London, 1993."},{"key":"33_CR4","series-title":"volume 844 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/3-540-58402-1_20","volume-title":"Programming Language Implementation and Logic Programming","author":"S. Breitinger","year":"1994","unstructured":"S. Breitinger and H.C.R. Lock. Improving search for job-shop-scheduling with CLP(FD). In M. Hermenegildo and J. Penjam, editors, Programming Language Implementation and Logic Programming, volume 844 of Lecture Notes in Computer Science, pages 277\u2013291, Berlin, Heidelberg, 1994. Springer."},{"key":"33_CR5","unstructured":"S. Breitinger and H.C.R. Lock. Modelling and scheduling in CLP(FD). In [13], pages 95\u2013110, 1994."},{"issue":"2","key":"33_CR6","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"J. Carlier and E. Pinson. An algorithm for solving the job shop problem. Management Science, 35(2):164\u2013176, 1989.","journal-title":"Management Science"},{"key":"33_CR7","unstructured":"Y. Caseau and F. Laburthe. Improved CLP scheduling with task intervals. In P. Van Hentenryck, editor, Proc. of the 11th International Conference on Logic Programming, pages 369\u2013383. MIT Press, 1994."},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0743-1066(90)90052-7","volume":"8","author":"M. Dincbas","year":"1990","unstructured":"M. Dincbas, H. Simonis, and P. van Hentenryck. Solving large combinatorial problems in logic programming. J. Logic Programming, 8:75\u201393, 1990.","journal-title":"J. Logic Programming"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proc. 14th Principles of Programming Languages, pages 111\u2013119, Munich, 1987.","DOI":"10.1145\/41625.41635"},{"key":"33_CR10","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/0743-1066(94)90033-7","volume":"19\/20","author":"J. Jaffar","year":"1994","unstructured":"J. Jaffar and M. J. Maher. Constraint logic programming: A survey. J. Logic Programming, 19\/20:503\u2013581, 1994.","journal-title":"J. Logic Programming"},{"key":"33_CR11","volume-title":"Industrial Scheduling","author":"J.F. Muth","year":"1963","unstructured":"J.F. Muth and G.L. Thompson. Industrial Scheduling. Prentice-Hall, Englewood Cliffs, NJ, 1963."},{"key":"33_CR12","volume-title":"Technical Report CMU-RI-TR-91-23","author":"N. Sadeh","year":"1991","unstructured":"N. Sadeh and M. Fox. Variable and value ordering heuristics for hard constraint satisfaction problems: an application to job-shop scheduling. Technical Report CMU-RI-TR-91-23, Carnegie Mellon University, Pittesburgh, Pennsylvania, 1991."},{"key":"33_CR13","unstructured":"L. Sterling, editor. Proc. Internat. Conf. on the Practical Application of Prolog. London, 1994."},{"key":"33_CR14","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. Hentenryck van","year":"1989","unstructured":"P. van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge (Mass.), London, 1989."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP '95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60299-2_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:57:59Z","timestamp":1605628679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60299-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602996","9783540447887"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60299-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}