{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:42:05Z","timestamp":1725514925400},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540723967"},{"type":"electronic","value":"9783540723974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72397-4_14","type":"book-chapter","created":{"date-parts":[[2007,6,22]],"date-time":"2007-06-22T19:56:32Z","timestamp":1182542192000},"page":"186-199","source":"Crossref","is-referenced-by-count":0,"title":["A Position-Based Propagator for the Open-Shop Problem"],"prefix":"10.1007","author":[{"given":"Jean-No\u00ebl","family":"Monette","sequence":"first","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Dupont","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J., Pinson, E.: An algorithm for solving the job-shop problem. Management Science\u00a035(2), 164\u2013176 (1989)","journal-title":"Management Science"},{"issue":"2","key":"14_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., Cook, B.: A computational study of the job shop scheduling problem. ORSA J. Comput.\u00a03(2), 149\u2013156 (1991)","journal-title":"ORSA J. Comput."},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"Carlier, J., Pinson, E.: Adjustment of heads and tails for the job-shop problem. European J. Oper. Res.\u00a078, 146\u2013161 (1994)","journal-title":"European J. Oper. Res."},{"key":"14_CR4","unstructured":"Caseau, Y., Laburthe, F.: Improved CLP scheduling with task intervals. In: Proc. 11th Intl. Conf. on Logic Programming (1994)"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier, J., Pinson, E.: A practical use of Jackson\u2019s preemptive schedule for solving the job-shop problem. Ann. Oper. Res.\u00a026, 269\u2013287 (1990)","journal-title":"Ann. Oper. Res."},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/jos.73","volume":"4","author":"U. Dorndorf","year":"2001","unstructured":"Dorndorf, U., Pesch, E., Phan-Huy, T.: Solving the open shop scheduling problem. J. Scheduling\u00a04, 157\u2013174 (2001)","journal-title":"J. Scheduling"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-24664-0_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P. Vilim","year":"2004","unstructured":"Vilim, P.: $\\mathcal{O}(n \\log n)$ filtering algorithms for unary resource constraint. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 335\u2013347. Springer, Heidelberg (2004)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Integer Programming and Combinatorial Optimization","author":"P. Martin","year":"1996","unstructured":"Martin, P., Shmoys, D.: A new approach to computing optimal schedules for the job-shop scheduling problem. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, Springer, Heidelberg (1996)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1009757726572","volume":"2","author":"J. Zhou","year":"1997","unstructured":"Zhou, J.: A permutation-based approach for solving the job-shop problem. Constraints\u00a02, 185\u2013213 (1997)","journal-title":"Constraints"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1009687210594","volume":"3","author":"W. Nuijten","year":"1998","unstructured":"Nuijten, W., Le Pape, C.: Constraint-based job shop scheduling with ILOG Scheduler. J. Heuristics\u00a03, 271\u2013286 (1998)","journal-title":"J. Heuristics"},{"key":"14_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/11402763_15","volume-title":"Recent Advances in Constraints","author":"A. Wolf","year":"2005","unstructured":"Wolf, A.: Better propagation for non-preemptive single-resource constraint problems. In: Faltings, B.V., Petcu, A., Fages, F., Rossi, F. (eds.) CSCLP 2004. LNCS (LNAI), vol.\u00a03419, pp. 201\u2013215. Springer, Heidelberg (2005)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1018930613891","volume":"92","author":"C. Gu\u00e9ret","year":"1999","unstructured":"Gu\u00e9ret, C., Prins, C.: A new lower bound for the open-shop problem. Annals of Operation Research\u00a092, 165\u2013183 (1999)","journal-title":"Annals of Operation Research"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/nav.3800030307","volume":"3","author":"J.R. Jackson","year":"1956","unstructured":"Jackson, J.R.: An extension of Johnson\u2019s results on job lot scheduling. Naval Research Logistics Quarterly\u00a03, 201\u2013203 (1956)","journal-title":"Naval Research Logistics Quarterly"},{"key":"14_CR14","unstructured":"http:\/\/www.gecode.org"},{"key":"14_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-based scheduling","author":"P. Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-based scheduling. Kluwer Academic Publishers, Dordrecht (2001)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72397-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,23]],"date-time":"2020-04-23T08:37:24Z","timestamp":1587631044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72397-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540723967","9783540723974"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72397-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}