A Matheuristic-based Rescheduling Method for Flexible Job Shops with Lot-streaming and Machine Reconfigurations

IF 2 3区计算机科学 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS

Computer Supported Cooperative Work-The Journal of Collaborative Computing Pub Date : 2023-05-24 DOI:10.1109/CSCWD57460.2023.10152589

Jia-xu Fan, Chunjiang Zhang, Weiming Shen

{"title":"A Matheuristic-based Rescheduling Method for Flexible Job Shops with Lot-streaming and Machine Reconfigurations","authors":"Jia-xu Fan, Chunjiang Zhang, Weiming Shen","doi":"10.1109/CSCWD57460.2023.10152589","DOIUrl":null,"url":null,"abstract":"This paper studies a flexible job shop rescheduling problem with lot-streaming and machine reconfigurations (FJRP-LSMR) to minimize the sum of the instability and total weighted tardiness, where machine reconfigurations are performed by assembling selected auxiliary modules for processing different batches of products. In this case, a rescheduling process is triggered by dynamic events, and requires to determine the lot-sizing plan, machine assignment, and sublot sequencing simultaneously. To address the intractable problem with multiple decision-making processes, a matheuristic integrating the genetic algorithm (GA) and the mixed integer linear programming (MILP) technique is proposed, where an MILP model is developed for optimally solving the lot-sizing sub-problem, and is embedded to the GA as a local search function. The proposed matheuristic is tested on randomly-generated instances to investigate the performance of all the algorithmic components. Experimental results demonstrate that the GA representation is effective in the complicated dynamic scheduling problem, and the lot-sizing sub-problem can be well addressed by the proposed MILP-based local search.","PeriodicalId":51008,"journal":{"name":"Computer Supported Cooperative Work-The Journal of Collaborative Computing","volume":"1 1","pages":"1950-1955"},"PeriodicalIF":2.0000,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Supported Cooperative Work-The Journal of Collaborative Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/CSCWD57460.2023.10152589","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}

引用次数: 0

Abstract

This paper studies a flexible job shop rescheduling problem with lot-streaming and machine reconfigurations (FJRP-LSMR) to minimize the sum of the instability and total weighted tardiness, where machine reconfigurations are performed by assembling selected auxiliary modules for processing different batches of products. In this case, a rescheduling process is triggered by dynamic events, and requires to determine the lot-sizing plan, machine assignment, and sublot sequencing simultaneously. To address the intractable problem with multiple decision-making processes, a matheuristic integrating the genetic algorithm (GA) and the mixed integer linear programming (MILP) technique is proposed, where an MILP model is developed for optimally solving the lot-sizing sub-problem, and is embedded to the GA as a local search function. The proposed matheuristic is tested on randomly-generated instances to investigate the performance of all the algorithmic components. Experimental results demonstrate that the GA representation is effective in the complicated dynamic scheduling problem, and the lot-sizing sub-problem can be well addressed by the proposed MILP-based local search.

查看原文本刊更多论文

具有批量流和机器重构的柔性作业车间的数学重调度方法

本文研究了一类具有批量流和机器重构的柔性作业车间重调度问题(FJRP-LSMR)，该问题通过装配选定的辅助模块来加工不同批次的产品，以最小化不稳定性和总加权延迟的总和。在这种情况下，重新调度过程由动态事件触发，并且需要同时确定批量计划、机器分配和子批排序。为了解决多决策过程的棘手问题，提出了一种将遗传算法(GA)与混合整数线性规划(MILP)技术相结合的数学方法，建立了最优求解批量子问题的混合整数线性规划模型，并将其作为局部搜索函数嵌入到遗传算法中。在随机生成的实例上对所提出的数学算法进行了测试，以研究所有算法组件的性能。实验结果表明，遗传算法在复杂的动态调度问题中是有效的，并且基于milp的局部搜索可以很好地解决批量子问题。

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

求助全文

约1分钟内获得全文求助全文

来源期刊

Computer Supported Cooperative Work-The Journal of Collaborative Computing COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-

CiteScore

6.40

自引率

4.20%

发文量

审稿时长

>12 weeks

期刊介绍： Computer Supported Cooperative Work (CSCW): The Journal of Collaborative Computing and Work Practices is devoted to innovative research in computer-supported cooperative work (CSCW). It provides an interdisciplinary and international forum for the debate and exchange of ideas concerning theoretical, practical, technical, and social issues in CSCW. The CSCW Journal arose in response to the growing interest in the design, implementation and use of technical systems (including computing, information, and communications technologies) which support people working cooperatively, and its scope remains to encompass the multifarious aspects of research within CSCW and related areas. The CSCW Journal focuses on research oriented towards the development of collaborative computing technologies on the basis of studies of actual cooperative work practices (where ‘work’ is used in the wider sense). That is, it welcomes in particular submissions that (a) report on findings from ethnographic or similar kinds of in-depth fieldwork of work practices with a view to their technological implications, (b) report on empirical evaluations of the use of extant or novel technical solutions under real-world conditions, and/or (c) develop technical or conceptual frameworks for practice-oriented computing research based on previous fieldwork and evaluations.