{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:45:32Z","timestamp":1752461132626},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615767"},{"type":"electronic","value":"9783540706274"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61576-8_79","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:57:21Z","timestamp":1330293441000},"page":"129-149","source":"Crossref","is-referenced-by-count":14,"title":["Improving branch and bound for Jobshop scheduling with constraint propagation"],"prefix":"10.1007","author":[{"given":"Yves","family":"Caseau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Laburthe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"J.Adams, E. Balas & D. Zawak. The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science 34, p391\u2013401. 1988","journal-title":"Management Science"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"D. Applegate & B. Cook. A Computational Study of the Job Shop Scheduling Problem. Operations Research Society of America 3, 1991","DOI":"10.1287\/ijoc.3.2.149"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E. Balas","year":"1969","unstructured":"E. Balas. Machine Sequencing via Disjunctive Programming: an Implicit Enumeration Algorithm. Operations Research 17, p 941\u2013957. 1969","journal-title":"Operations Research"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"E. Balas On the facial structure of Scheduling Polyhedra, Mathematical Programming studies 24, p. 179\u2013218.","DOI":"10.1007\/BFb0121051"},{"key":"13_CR5","unstructured":"P. Baptiste, C. Le Pape A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. Proc. of the 14th International Joint Conference on Artificila Intellignece, 1995."},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"J. Carlier. The one machine sequencing problem European Journal of Operations Research 11, p. 42\u201347, 1982.","journal-title":"European Journal of Operations Research"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"J. Carlier & E. Pinson. An Algorithm for Solving the Job Shop Problem. Management science, vol 35, no 2, february 1989","DOI":"10.1287\/mnsc.35.2.164"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"J. Carlier & E. Pinson. Adjustments of heads and tails for the job-shop problem, European Journal of Operations Research, vol 78, 1994, p. 146\u2013161.","journal-title":"European Journal of Operations Research"},{"key":"13_CR9","unstructured":"Y. Caseau. A Deductive Object-Oriented Language. Annals of Maths and Artificial Intelligence, Special Issue on Deductive Databases, March 1991."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Y. Caseau, P.-Y. Guillo & E. Levenez. A Deductive and Object-Oriented Approach to a Complex Scheduling Problem. Proc. of DOOD'93, 1993","DOI":"10.1007\/3-540-57530-8_5"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Y. Caseau & P. Koppstein. A Cooperative-Architecture Expert System for Solving Large Time\/Travel Assignment Problems. International Conference on Databases and Expert Systems Applications, Spain, 1992.","DOI":"10.1007\/978-3-7091-7557-6_34"},{"key":"13_CR12","unstructured":"Y. Caseau & F. Laburthe. Improved CLP Scheduling with Task Intervals. Proc. of the Eleventh International Conference on Logic Programming, ed: P. van Hentenryck, The MIT Press, 1994."},{"key":"13_CR13","unstructured":"Y. Caseau & F. Laburthe. Disjunctive Scheduling with Task Intervals. LIENS report 95-25, \u00c9cole Normale Sup\u00e9rieure, 1995."},{"key":"13_CR14","first-page":"84","volume-title":"Comment entrecroiser des proc\u00e9dures par s\u00e9paration et \u00e9valuation et des algorithmes g\u00e9n\u00e9tiques: application \u00e0 des probl\u00e8mes d'ordonnancement \u00e0 contraintes disjunctives","author":"L. Djerid","year":"1995","unstructured":"L. Djerid & M.-C. Portmann. Comment entrecroiser des proc\u00e9dures par s\u00e9paration et \u00e9valuation et des algorithmes g\u00e9n\u00e9tiques: application \u00e0 des probl\u00e8mes d'ordonnancement \u00e0 contraintes disjunctives. FRANCORO, Mons, 1995, p. 84\u201385"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell'Amico","year":"1993","unstructured":"M. Dell'Amico & M. Trubian. Applying Tabu-Search to the Job-Shop Scheduling Problem. Annals of Operations Research, vol 41, 1993, p. 231\u2013252","journal-title":"Annals of Operations Research"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"M. Dyer","year":"1990","unstructured":"M. Dyer & L.A. Wolsey. Formulating the Single Machine Sequencing Problem with Release Dates as a Mixed Integer Program. Discrete Applied Mathematics 26, p.255\u2013270. 1990.","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR17","unstructured":"S. Lawrence. Resource Constrained Project Scheduling: an Experimental Investigation of Heuristic Scheduling Techniques. GSIA, C.M.U. 1984"},{"key":"13_CR18","unstructured":"J.F. Muth & G.L. Thompson Industrial scheduling. Prentice Hall, 1963."},{"key":"13_CR19","unstructured":"Nakano & Yamada A Genetic Algorithm applicable to Large Scale JobShop Problems. Parallel Problem solving from Nature 2, Elsevier, 1992."},{"key":"13_CR20","unstructured":"E. Taillard. Parallel Taboo Search Technique for the Jobshop Scheduling Problem. Internal Report ORPWP 89\/11, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne, 1989"},{"key":"13_CR21","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. Hentenryck Van","year":"1989","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, Cambridge, 1989."},{"key":"13_CR22","volume-title":"Doctoral Thesis","author":"S.L. Velde Van De","year":"1991","unstructured":"S.L. Van De Velde. Machine scheduling and Lagrangian relaxation. Doctoral Thesis, CWI, Amsterdam, 1991"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"P van Laarhoven, E.Aarts & J.K. Lenstra. Job Shop Scheduling by Simulated Annealing. Operations Research vol 40, no 1, 1992","DOI":"10.1287\/opre.40.1.113"}],"container-title":["Lecture Notes in Computer Science","Combinatorics and Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61576-8_79.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:59Z","timestamp":1605647279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61576-8_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615767","9783540706274"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-61576-8_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}