具有不可用时间段和额外资源的Flow Shop调度问题的混合算法

IF 1 Q3 MULTIDISCIPLINARY SCIENCES gazi university journal of science Pub Date : 2022-12-21 DOI:10.35378/gujs.1108155

F. Özçeli̇k, T. Saraç

{"title":"具有不可用时间段和额外资源的Flow Shop调度问题的混合算法","authors":"F. Özçeli̇k, T. Saraç","doi":"10.35378/gujs.1108155","DOIUrl":null,"url":null,"abstract":"In machine scheduling problems, not all machines are always available. They may be interrupted periodically for reasons such as planned maintenance, lunch and rest breaks. However, this situation is often ignored in the literature or these time periods are considered as fixed. In this study, flow shop scheduling problem with unavailable time periods is discussed. In the considered problem, unavailable time periods are not fixed, they can be pulled forward to prevent the idle times. A MIP model and a genetic algorithm have been developed for the considered problem. The performance of the proposed solution methods is demonstrated using randomly generated test problems. With the developed genetic algorithm, GAMS results are improved by an average of 26,82%.","PeriodicalId":12615,"journal":{"name":"gazi university journal of science","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Hybrid Algorithm for Flow Shop Scheduling Problem with Unavailable Time Periods and Additional Resources\",\"authors\":\"F. Özçeli̇k, T. Saraç\",\"doi\":\"10.35378/gujs.1108155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In machine scheduling problems, not all machines are always available. They may be interrupted periodically for reasons such as planned maintenance, lunch and rest breaks. However, this situation is often ignored in the literature or these time periods are considered as fixed. In this study, flow shop scheduling problem with unavailable time periods is discussed. In the considered problem, unavailable time periods are not fixed, they can be pulled forward to prevent the idle times. A MIP model and a genetic algorithm have been developed for the considered problem. The performance of the proposed solution methods is demonstrated using randomly generated test problems. With the developed genetic algorithm, GAMS results are improved by an average of 26,82%.\",\"PeriodicalId\":12615,\"journal\":{\"name\":\"gazi university journal of science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2022-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"gazi university journal of science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.35378/gujs.1108155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"gazi university journal of science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35378/gujs.1108155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}

引用次数: 0

摘要

在机器调度问题中，并非所有的机器都是可用的。它们可能会因计划维护、午餐和休息时间等原因而定期中断。然而，这种情况在文献中经常被忽视，或者这些时间段被认为是固定的。本文讨论了具有不可用时间段的流水车间调度问题。在所考虑的问题中，不可用的时间段不是固定的，它们可以向前拉以防止空闲时间。针对所考虑的问题，已经开发了MIP模型和遗传算法。使用随机生成的测试问题演示了所提出的解决方法的性能。利用所开发的遗传算法，GAMS结果平均提高了26,82%。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Hybrid Algorithm for Flow Shop Scheduling Problem with Unavailable Time Periods and Additional Resources

In machine scheduling problems, not all machines are always available. They may be interrupted periodically for reasons such as planned maintenance, lunch and rest breaks. However, this situation is often ignored in the literature or these time periods are considered as fixed. In this study, flow shop scheduling problem with unavailable time periods is discussed. In the considered problem, unavailable time periods are not fixed, they can be pulled forward to prevent the idle times. A MIP model and a genetic algorithm have been developed for the considered problem. The performance of the proposed solution methods is demonstrated using randomly generated test problems. With the developed genetic algorithm, GAMS results are improved by an average of 26,82%.

求助全文

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

来源期刊

gazi university journal of science MULTIDISCIPLINARY SCIENCES-

CiteScore

1.60

自引率

11.10%

发文量

期刊介绍： The scope of the “Gazi University Journal of Science” comprises such as original research on all aspects of basic science, engineering and technology. Original research results, scientific reviews and short communication notes in various fields of science and technology are considered for publication. The publication language of the journal is English. Manuscripts previously published in another journal are not accepted. Manuscripts with a suitable balance of practice and theory are preferred. A review article is expected to give in-depth information and satisfying evaluation of a specific scientific or technologic subject, supported with an extensive list of sources. Short communication notes prepared by researchers who would like to share the first outcomes of their on-going, original research work are welcome.