{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:07:53Z","timestamp":1649160473781},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,12,2]],"date-time":"2006-12-02T00:00:00Z","timestamp":1165017600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2007,3,20]]},"DOI":"10.1007\/s10601-006-9009-1","type":"journal-article","created":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T21:14:21Z","timestamp":1165007661000},"page":"3-19","source":"Crossref","is-referenced-by-count":1,"title":["Arc-B-consistency of the Inter-distance Constraint"],"prefix":"10.1007","volume":"12","author":[{"given":"Konstantin","family":"Artiouchine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Baptiste","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,2]]},"reference":[{"issue":"2","key":"9009_CR1","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, W. (1991). A computational study of the Job-Shop scheduling problem. ORSA J. Comput. 3(2):149\u2013156.","journal-title":"ORSA J. Comput."},{"key":"9009_CR2","unstructured":"Artiouchine, K., Baptiste, Ph., & D\u00fcrr, C. Runway sequencing with holding patterns. http:\/\/www.lix.polytechnique.fr\/Labo\/Konstantin.Artiouchine\/ejor04.pdf ."},{"key":"9009_CR3","doi-asserted-by":"crossref","unstructured":"Baptiste, Ph., Le Pape, C., & Nuijten, W. (2001). Constraint-based Scheduling. Kluwer.","DOI":"10.1007\/978-1-4615-1479-4"},{"key":"9009_CR4","unstructured":"Baptiste, Ph., & Le Pape, C. (1996). Edge-finding constraint propagation algorithms for disjunctive and cumulative scheduling. In Proc. 15th Workshop of the UK Planning Special Interest Group."},{"key":"9009_CR5","unstructured":"Baptiste, Ph., Carlier, J., Kononov, A., Queyranne, M., Sevastianov, S., & Sviridenko, M. Structural properties of preemptive schedules. To appear in Journal of Scheduling."},{"key":"9009_CR6","doi-asserted-by":"crossref","unstructured":"Bayen, A.M., & Tomlin, C.J. (2003). Real-time discrete control law synthesis for hybrid systems using MILP: Application to congested airspace. In Proceedings of the American Control Conference.","DOI":"10.1109\/ACC.2003.1242452"},{"key":"9009_CR7","unstructured":"Bayen, A.M., Tomlin, C.J., Ye, Y., Zhang, J. MILP formulation and polynomial time algorithm for an aircraft scheduling problem. cherokee.stanford.edu\/~bayen\/publications.html ."},{"key":"9009_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF03543071","volume":"26","author":"J. Carlier","year":"1990","unstructured":"Carlier, J., & Pinson, E. (1990). A practical use of Jackson\u2019s preemptive schedule for solving the Job-Shop problem. Ann. Oper. Res. 26:269\u2013287.","journal-title":"Ann. Oper. Res."},{"key":"9009_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","volume":"78","author":"J. Carlier","year":"1994","unstructured":"Carlier, J., & Pinson, E. (1994). Adjustment of heads and tails for the Job-Shop problem. Eur. J. Oper. Res. 78:146\u2013161.","journal-title":"Eur. J. Oper. Res."},{"key":"9009_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/jos.73","volume":"4","author":"U. Dorndorf","year":"2001","unstructured":"Dorndorf, U., Pesch, E., & Phan-Huy, T. (2001). Solving the open shop scheduling problem. J. Sched. 4:157\u2013174.","journal-title":"J. Sched."},{"key":"9009_CR11","unstructured":"Garey, M.R., & Johnson, D.S. (1979). Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman."},{"issue":"2","key":"9009_CR12","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M.R. Garey","year":"1981","unstructured":"Garey, M.R., Johnson, D.S., Simons, B.B., & Tarjan, R.E. (1981). Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J. Comput. 10(2):256\u2013269.","journal-title":"SIAM J. Comput."},{"key":"9009_CR13","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0167-5060(08)70821-5","volume":"4","author":"J.K. Lenstra","year":"1979","unstructured":"Lenstra, J.K. & Rinnooy Kan, A.H.G. (1979). Computational complexity of discrete optimization problems. Ann. Discrete Math. 4:121\u2013140.","journal-title":"Ann. Discrete Math."},{"key":"9009_CR14","unstructured":"Lhomme, O. (1993). Consistency techniques for numeric CSPs. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, Chamb\u00e9ry, France."},{"key":"9009_CR15","unstructured":"L\u00f3pez-Ortiz, A., Quimper, C.-G., Tromp, J., & van Beek, P. (2003). A fast and simple algorithm for bounds consistency of the alldifferent constraint. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico."},{"key":"9009_CR16","doi-asserted-by":"crossref","unstructured":"Martin, P.D., & Shmoys, D.B. (1996). A new approach to computing optimal schedules for the Job-Shop scheduling problem. In Proc. 5th Conference on Integer Programming and Combinatorial Optimization.","DOI":"10.1007\/3-540-61310-2_29"},{"key":"9009_CR17","unstructured":"Museux, N., Jeannun, L., Sav\u00e9ant, P., Le Hu\u00e9d\u00e9, F., Josset, F.-X., & Mattioli, J. (2003). Claire\/Eclair: Un environnement de mod\u00e9lisation et de r\u00e9solution pour des applications d\u2019optimisations combinatoires \u00e9mbarqu\u00e9es. Journ\u00e9es Francophones de Programmation en Logique et de programmation par Contraintes."},{"key":"9009_CR18","unstructured":"Nuijten, W., Bousonville, T., Focacci, F., Godard, D., & Le Pape, C. (2004). Towards an industrial manufacturing scheduling problem and test bed. In Proc. of the 9th International Workshop on Project Management and Scheduling."},{"key":"9009_CR19","unstructured":"Pinson, E. (1988). Le probl\u00e8me de Job-Shop. Th\u00e8se de l\u2019Universit\u00e9 Paris VI."},{"key":"9009_CR20","unstructured":"Puget, J.-F. (1998). A fast algorithm for the bound consistency of all-diff constraints. In Proc. 15th National Conference on Artificial Intelligence."},{"key":"9009_CR21","volume-title":"Proc. of the Twenty-First National Conference on Artificial Intelligence","author":"C.-G. Quimper","year":"2006","unstructured":"Quimper, C.-G., L\u00f3pez-Ortiz, A., & Pesant, G. (2006). A quadratic propagator for the inter-distance constraint. In Proc. of the Twenty-First National Conference on Artificial Intelligence. Menlo Park, CA: AAAI Press."},{"key":"9009_CR22","unstructured":"R\u00e9gin, J.-C. (1994). A filtering algorithm for constraints of difference in CSPs. In Proc. 12th National Conference on Artificial Intelligence."},{"key":"9009_CR23","unstructured":"R\u00e9gin, J.-C. (1997). The global minimum distance constraint. Technical Report, ILOG."},{"key":"9009_CR24","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C., & Puget, J.-F. (1997). A filtering algorithm for global sequencing constraints. In Proceedings of the Third International Conference on Principles and Practice of Constraint Programming.","DOI":"10.1007\/BFb0017428"},{"issue":"2","key":"9009_CR25","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0212018","volume":"12","author":"B. Simons","year":"1983","unstructured":"Simons, B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM J. Comput. 12(2):294\u2013299.","journal-title":"SIAM J. Comput."},{"key":"9009_CR26","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/S0377-2217(99)00497-X","volume":"127","author":"Ph. Torres","year":"2000","unstructured":"Torres, Ph., & Lopez, P. (2000). On Not-First\/Not-Last conditions in disjunctive scheduling. Eur. J. Oper. Res. 127:332\u2013343.","journal-title":"Eur. J. Oper. Res."},{"key":"9009_CR27","unstructured":"Vil\u00edm, P. (2004). o(n logn) filtering algorithms for unary resource constraint. In R\u00e9gin, J.-C. & Rueher, M. eds., Proceedings of CP-AI-OR, volume 3011 of LNCS, pages 335\u2013347. Springer."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-9009-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-006-9009-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-006-9009-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T04:51:06Z","timestamp":1587271866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-006-9009-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,2]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,20]]}},"alternative-id":["9009"],"URL":"https:\/\/doi.org\/10.1007\/s10601-006-9009-1","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,2]]}}}