Francisco Yuraszeck , Gonzalo Mejía , Daniel Alejandro Rossit , Armin Lüer-Villagra
{"title":"A constraint programming-based lower bounding procedure for the job shop scheduling problem","authors":"Francisco Yuraszeck , Gonzalo Mejía , Daniel Alejandro Rossit , Armin Lüer-Villagra","doi":"10.1016/j.cor.2024.106964","DOIUrl":null,"url":null,"abstract":"<div><div>This paper presents a novel Constraint Programming (CP) approach to obtain strong lower bounds for the Job Shop Scheduling Problem (JSSP) under the makespan criterion. Our approach comprises two phases. In the first phase, a relaxation of the original problem is solved, while in the second phase, this relaxation is iteratively tightened until a time limit is reached or no better bounds are found. We tested our procedure with 80 JSSP open instances, and the results validated our approach as we were able to find 7 new lower bounds and prove optimality in one instance.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"177 ","pages":"Article 106964"},"PeriodicalIF":4.3000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054824004362","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/9 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
This paper presents a novel Constraint Programming (CP) approach to obtain strong lower bounds for the Job Shop Scheduling Problem (JSSP) under the makespan criterion. Our approach comprises two phases. In the first phase, a relaxation of the original problem is solved, while in the second phase, this relaxation is iteratively tightened until a time limit is reached or no better bounds are found. We tested our procedure with 80 JSSP open instances, and the results validated our approach as we were able to find 7 new lower bounds and prove optimality in one instance.
期刊介绍：
Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
