{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:49:37Z","timestamp":1752461377620},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615514"},{"type":"electronic","value":"9783540706205"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61551-2_72","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:56:01Z","timestamp":1330293361000},"page":"149-163","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Constraint programming: an efficient and practical approach to solving the job-shop problem"],"prefix":"10.1007","author":[{"given":"Yves","family":"Colombani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggoun and N. Beldiceanu. Extending CHIP in Order To Solve Complex Scheduling and Placement Problems. In Journ\u00e9es Francophones de Programmation Logique, 1992.","DOI":"10.1016\/0895-7177(93)90068-A"},{"issue":"2","key":"11_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"David Applegate and William Cook. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing, 3(2): 149\u2013156, 1991.","journal-title":"ORSA Journal on Computing"},{"key":"11_CR3","unstructured":"Philippe Baptiste, Claude Le Pape, and Win Nuijten. Constraint-Based Optimisation and Approximation for Job-Shop Scheduling. In Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manifacturing Systems, IJCAI-95, 1995."},{"key":"11_CR4","unstructured":"Fr\u00e9d\u00e9ric Benhamou, William J. Older, and Andr\u00e9 Vellino. Constraint Logic Programming on Boolean, Integer and Real Intervals. Accepted for publication in Journal of Symbolic Computation, 1994."},{"key":"11_CR5","unstructured":"Yves Caseau and Fran\u00e7ois Laburthe. Improved CLP Scheduling with Task Intervals. In International Conference on Logic Programming, 1994."},{"key":"11_CR6","unstructured":"Yves Caseau and Fran\u00e7ois Laburthe. Disjunctive Scheduling with Task Intervals. Technical Report 95-25, LIENS, 1995."},{"key":"11_CR7","unstructured":"Yves Colombani. Strat\u00e9gies d'\u00e9num\u00e9ration pour le probl\u00e8me du job-shop. Technical Report 141, LIM, 1996."},{"issue":"2","key":"11_CR8","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Jacques Carlier and \u00c9ric Pinson. An Algorithm for Solving the Job-Shop Problem. Management Science, 35(2):164\u2013176, 1989.","journal-title":"Management Science"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"Jacques Carlier and \u00c9ric Pinson. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78:146\u2013161, 1994.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"11_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"A.K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1):99\u2013118, 1977.","journal-title":"Artificial Intelligence"},{"key":"11_CR11","unstructured":"J.F. Muth and G.L. Thompson. Industrial scheduling. Prentice Hall, 1963."},{"key":"11_CR12","unstructured":"Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP96"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61551-2_72","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T10:44:41Z","timestamp":1640947481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61551-2_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615514","9783540706205"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-61551-2_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}