{"title":"A comparative analysis of constraint programming and metaheuristics for job-shop scheduling","authors":"M. Gregor, M. Hruboš, Dušan Nemec","doi":"10.1109/CYBERI.2018.8337536","DOIUrl":null,"url":null,"abstract":"The paper considers two kinds of optimization methods: constraint programming and metaheuristic search. It shows how each of the approaches can be applied to multiple instances of the job shop scheduling problem and compares the performance of these approaches among themselves and also under various parameter settings. It is shown that, given the instances of the problem and the parameter configurations considered in the paper, constraint programming clearly outperforms the other approaches. In its final section, the paper outlines further conclusions as well as suggestions for future work.","PeriodicalId":6534,"journal":{"name":"2018 Cybernetics & Informatics (K&I)","volume":"39 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Cybernetics & Informatics (K&I)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERI.2018.8337536","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The paper considers two kinds of optimization methods: constraint programming and metaheuristic search. It shows how each of the approaches can be applied to multiple instances of the job shop scheduling problem and compares the performance of these approaches among themselves and also under various parameter settings. It is shown that, given the instances of the problem and the parameter configurations considered in the paper, constraint programming clearly outperforms the other approaches. In its final section, the paper outlines further conclusions as well as suggestions for future work.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
