{"type":"ScholarlyArticle","title":"Combining Local Search and Look-Ahead for Scheduling and Constraint Satisfaction Problems","authors":[{"name":"Andrea Schaerf","slug":"andrea-schaerf","given":"Andrea","family":"Schaerf","affiliation":""}],"abstract":"We propose a solution technique for scheduling and constraint satisfaction problems th at combines backtracking-free constructive methods and local search techniques. Our technique incrementally constructs the solution, performing a local search on partial solutions each time the construction reaches a dead-end. Local search on the space of partial solutions is guided by a cost function based on three components: the distance to feasibility of the partial solution, a look-ahead factor, and (for optimization problems) a lower bound of the objective function. In order to improve search effectiveness, we make use of an adaptive relaxation of constraints and an interleaving of different lookahead factors . The new technique has been successfully experimented on two real-life problems: university course scheduling and sport tournament scheduling.","doi":null,"url":"https://ijcai.org/proceedings/1997/181","pdf":"https://ijcai.org/proceedings/1997/0181.pdf","markdown":"https://ijcai.org/proceedings/1997/181.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/181","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Scheduling","track":"Planning and Scheduling","number":181,"pages":{"first":1254,"last":1258},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}