{"type":"ScholarlyArticle","title":"Large Neighborhood Search and Adaptive Randomized Decompositions for Flexible Jobshop Scheduling","authors":[{"name":"Dario Pacino","slug":"dario-pacino","given":"Dario","family":"Pacino","affiliation":""},{"name":"Pascal Van Hentenryck","slug":"pascal-van-hentenryck","given":"Pascal","family":"Van Hentenryck","affiliation":""}],"abstract":"This paper considers a constraint-based scheduling approach to the flexible jobshop, a generalization of the traditional jobshop scheduling where activities have a choice of machines. It studies both large neighborhood (LNS) and adaptive randomized decomposition (ARD) schemes, using random, temporal, and machine decompositions. Empirical results on standard benchmarks show that, within 5 minutes, both LNS and ARD produce many new best solutions and are about 0.5% in average from the best-known solutions. Moreover, over longer runtimes, they improve 60% of the best-known solutions and match the remaining ones. The empirical results also show the importance of hybrid decompositions in LNS and ARD.","doi":"10.5591/978-1-57735-516-8/IJCAI11-333","url":"https://ijcai.org/proceedings/2011/333","pdf":"https://ijcai.org/proceedings/2011/0333.pdf","markdown":"https://ijcai.org/proceedings/2011/333.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/333","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":333,"pages":{"first":1997,"last":2001},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}