基于约束规划的作业车间调度问题下边界算法

IF 4.1 2区工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Operations Research Pub Date : 2025-01-09 DOI:10.1016/j.cor.2024.106964

Francisco Yuraszeck , Gonzalo Mejía , Daniel Alejandro Rossit , Armin Lüer-Villagra

{"title":"基于约束规划的作业车间调度问题下边界算法","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.1000,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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.1000,\"publicationDate\":\"2025-01-09\",\"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\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","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":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种新的约束规划方法来求解作业车间调度问题在最大完工时间条件下的强下界。我们的方法包括两个阶段。在第一阶段，解决原始问题的松弛，而在第二阶段，迭代地收紧松弛，直到达到时间限制或没有找到更好的边界。我们用80个JSSP开放实例测试了我们的过程，结果验证了我们的方法，因为我们能够在一个实例中找到7个新的下限并证明最优性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A constraint programming-based lower bounding procedure for the job shop scheduling problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Computers & Operations Research 工程技术-工程：工业

CiteScore

8.60

自引率

8.70%

发文量

292

审稿时长

8.5 months

期刊介绍： 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.