用Jaya算法优化无等待约束作业车间调度问题

IF 0.9 Q4 ENGINEERING, INDUSTRIAL

Management and Production Engineering Review Pub Date : 2023-10-20 DOI:10.24425/mper.2023.147196

{"title":"用Jaya算法优化无等待约束作业车间调度问题","authors":"","doi":"10.24425/mper.2023.147196","DOIUrl":null,"url":null,"abstract":"This work is interested to optimize the job shop scheduling problem with a no wait constraint. This constraint occurs when two consecutive operations in a job must be processed without any waiting time either on or between machines. The no wait job shop scheduling problem is a combinatorial optimization problem. Therefore, the study presented here is focused on solving this problem by proposing strategy for making Jaya algorithm applicable for handling optimization of this type of problems and to ﬁnd processing sequence that minimizes the makespan ( C max ). Several benchmarks are used to analyze the performance of this algorithm compared to the best-known solutions.","PeriodicalId":45454,"journal":{"name":"Management and Production Engineering Review","volume":"8 1","pages":"0"},"PeriodicalIF":0.9000,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach\",\"authors\":\"\",\"doi\":\"10.24425/mper.2023.147196\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work is interested to optimize the job shop scheduling problem with a no wait constraint. This constraint occurs when two consecutive operations in a job must be processed without any waiting time either on or between machines. The no wait job shop scheduling problem is a combinatorial optimization problem. Therefore, the study presented here is focused on solving this problem by proposing strategy for making Jaya algorithm applicable for handling optimization of this type of problems and to ﬁnd processing sequence that minimizes the makespan ( C max ). Several benchmarks are used to analyze the performance of this algorithm compared to the best-known solutions.\",\"PeriodicalId\":45454,\"journal\":{\"name\":\"Management and Production Engineering Review\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Management and Production Engineering Review\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24425/mper.2023.147196\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, INDUSTRIAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Management and Production Engineering Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24425/mper.2023.147196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, INDUSTRIAL","Score":null,"Total":0}

引用次数: 0

摘要

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

查看原文本刊更多论文

Optimizing the Job Shop Scheduling Problem with a no Wait Constraint by Using the Jaya Algorithm Approach

This work is interested to optimize the job shop scheduling problem with a no wait constraint. This constraint occurs when two consecutive operations in a job must be processed without any waiting time either on or between machines. The no wait job shop scheduling problem is a combinatorial optimization problem. Therefore, the study presented here is focused on solving this problem by proposing strategy for making Jaya algorithm applicable for handling optimization of this type of problems and to ﬁnd processing sequence that minimizes the makespan ( C max ). Several benchmarks are used to analyze the performance of this algorithm compared to the best-known solutions.

求助全文

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

来源期刊

Management and Production Engineering Review ENGINEERING, INDUSTRIAL-

CiteScore

2.80

自引率

21.40%

发文量

期刊介绍： Management and Production Engineering Review (MPER) is a peer-refereed, international, multidisciplinary journal covering a broad spectrum of topics in production engineering and management. Production engineering is a currently developing stream of science encompassing planning, design, implementation and management of production and logistic systems. Orientation towards human resources factor differentiates production engineering from other technical disciplines. The journal aims to advance the theoretical and applied knowledge of this rapidly evolving field, with a special focus on production management, organisation of production processes, management of production knowledge, computer integrated management of production flow, enterprise effectiveness, maintainability and sustainable manufacturing, productivity and organisation, forecasting, modelling and simulation, decision making systems, project management, innovation management and technology transfer, quality engineering and safety at work, supply chain optimization and logistics. Management and Production Engineering Review is published under the auspices of the Polish Academy of Sciences Committee on Production Engineering and Polish Association for Production Management.