具有广义优先级和序列依赖建立时间的多模式RCPSP的禁忌搜索

IF 6.7 1区工程技术 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computers & Industrial Engineering Pub Date : 2025-04-28 DOI:10.1016/j.cie.2025.111142

Baptistin Carvin , Odile Bellenguez , Guillaume Massonnet

{"title":"具有广义优先级和序列依赖建立时间的多模式RCPSP的禁忌搜索","authors":"Baptistin Carvin , Odile Bellenguez , Guillaume Massonnet","doi":"10.1016/j.cie.2025.111142","DOIUrl":null,"url":null,"abstract":"<div><div>This work addresses a problem inspired by industrial scheduling cases in the food industry, with a specific workshop structure and precedence graph. We propose a model derived from a MRCPSP which includes generalized precedence, and use an extended ProGen method to generate industrially consistent instances. We propose a tabu search based on a priority list that takes advantage of the instances structure. When minimizing makespan, we present evidences that this method outperforms commercial solvers with the MIP formulation in both admissible solutions number and makespan. Finally, we present an overview of performance on an alternative objective of interest for industrial applications.</div></div>","PeriodicalId":55220,"journal":{"name":"Computers & Industrial Engineering","volume":"205 ","pages":"Article 111142"},"PeriodicalIF":6.7000,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Tabu search for a multi-mode RCPSP with generalized precedence and sequence-dependent setup time\",\"authors\":\"Baptistin Carvin , Odile Bellenguez , Guillaume Massonnet\",\"doi\":\"10.1016/j.cie.2025.111142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This work addresses a problem inspired by industrial scheduling cases in the food industry, with a specific workshop structure and precedence graph. We propose a model derived from a MRCPSP which includes generalized precedence, and use an extended ProGen method to generate industrially consistent instances. We propose a tabu search based on a priority list that takes advantage of the instances structure. When minimizing makespan, we present evidences that this method outperforms commercial solvers with the MIP formulation in both admissible solutions number and makespan. Finally, we present an overview of performance on an alternative objective of interest for industrial applications.</div></div>\",\"PeriodicalId\":55220,\"journal\":{\"name\":\"Computers & Industrial Engineering\",\"volume\":\"205 \",\"pages\":\"Article 111142\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & Industrial Engineering\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0360835225002888\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Industrial Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0360835225002888","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

摘要

这项工作解决了一个问题，灵感来自工业调度案例在食品工业，具有特定的车间结构和优先图。我们提出了一个从MRCPSP衍生的模型，其中包括广义优先级，并使用扩展的ProGen方法来生成工业一致的实例。我们提出了一种基于优先级列表的禁忌搜索，该列表利用了实例结构。当最大完工时间最小化时，我们提供的证据表明，该方法在可接受解数和最大完工时间方面都优于具有MIP公式的商业求解方法。最后，我们概述了工业应用中另一个感兴趣的目标的性能。

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

查看原文本刊更多论文

Tabu search for a multi-mode RCPSP with generalized precedence and sequence-dependent setup time

This work addresses a problem inspired by industrial scheduling cases in the food industry, with a specific workshop structure and precedence graph. We propose a model derived from a MRCPSP which includes generalized precedence, and use an extended ProGen method to generate industrially consistent instances. We propose a tabu search based on a priority list that takes advantage of the instances structure. When minimizing makespan, we present evidences that this method outperforms commercial solvers with the MIP formulation in both admissible solutions number and makespan. Finally, we present an overview of performance on an alternative objective of interest for industrial applications.

求助全文

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

来源期刊

Computers & Industrial Engineering 工程技术-工程：工业

CiteScore

12.70

自引率

12.70%

发文量

794

审稿时长

10.6 months

期刊介绍： Computers & Industrial Engineering (CAIE) is dedicated to researchers, educators, and practitioners in industrial engineering and related fields. Pioneering the integration of computers in research, education, and practice, industrial engineering has evolved to make computers and electronic communication integral to its domain. CAIE publishes original contributions focusing on the development of novel computerized methodologies to address industrial engineering problems. It also highlights the applications of these methodologies to issues within the broader industrial engineering and associated communities. The journal actively encourages submissions that push the boundaries of fundamental theories and concepts in industrial engineering techniques.