{"type":"ScholarlyArticle","title":"The Multi-Inter-Distance Constraint","authors":[{"name":"Pierre Ouellet","slug":"pierre-ouellet","given":"Pierre","family":"Ouellet","affiliation":""},{"name":"Claude-Guy Quimper","slug":"claude-guy-quimper","given":"Claude-Guy","family":"Quimper","affiliation":""}],"abstract":"We introduce the MULTI-INTER-DISTANCE constraint that ensures no more than m variables are assigned to values lying in a window of p consecutive values. This constraint is useful for modeling scheduling problems where tasks of processing time p compete for m identical resources. We present a propagator that achieves bounds consistency in cubic time. Experiments show that this new constraint offers a much stronger filtering than an edge-finder and that it allows to solve larger instances of the runway scheduling problem.","doi":"10.5591/978-1-57735-516-8/IJCAI11-112","url":"https://ijcai.org/proceedings/2011/112","pdf":"https://ijcai.org/proceedings/2011/0112.pdf","markdown":"https://ijcai.org/proceedings/2011/112.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/112","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":112,"pages":{"first":629,"last":633},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}