柔性循环作业车间问题的算法

2018 IEEE 14th International Conference on Automation Science and Engineering (CASE) Pub Date : 2018-08-01 DOI:10.1109/COASE.2018.8560449

F. Quinton, Idir Hamaz, L. Houssin

{"title":"柔性循环作业车间问题的算法","authors":"F. Quinton, Idir Hamaz, L. Houssin","doi":"10.1109/COASE.2018.8560449","DOIUrl":null,"url":null,"abstract":"This paper considers the cyclic jobshop problem in a flexible context where is objective is to find the minimum cycle time of a periodic schedule. The flexibility feature comes from the ability of the machines or robots to perform several kinds of tasks. Hence, the scheduling problem does not only concern starting time of tasks but also on which machines the tasks will be performed. We propose an exact method to solve this problem and two heuristics.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"48 1","pages":"945-950"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Algorithms for the flexible cyclic jobshop problem\",\"authors\":\"F. Quinton, Idir Hamaz, L. Houssin\",\"doi\":\"10.1109/COASE.2018.8560449\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the cyclic jobshop problem in a flexible context where is objective is to find the minimum cycle time of a periodic schedule. The flexibility feature comes from the ability of the machines or robots to perform several kinds of tasks. Hence, the scheduling problem does not only concern starting time of tasks but also on which machines the tasks will be performed. We propose an exact method to solve this problem and two heuristics.\",\"PeriodicalId\":6518,\"journal\":{\"name\":\"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)\",\"volume\":\"48 1\",\"pages\":\"945-950\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COASE.2018.8560449\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COASE.2018.8560449","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

研究挠性环境下的循环作业车间问题，其目标是求周期调度的最小周期时间。灵活性来自于机器或机器人执行多种任务的能力。因此，调度问题不仅涉及任务的开始时间，而且还涉及任务将在哪些机器上执行。我们提出了解决这个问题的精确方法和两个启发式方法。

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

查看原文本刊更多论文

Algorithms for the flexible cyclic jobshop problem

This paper considers the cyclic jobshop problem in a flexible context where is objective is to find the minimum cycle time of a periodic schedule. The flexibility feature comes from the ability of the machines or robots to perform several kinds of tasks. Hence, the scheduling problem does not only concern starting time of tasks but also on which machines the tasks will be performed. We propose an exact method to solve this problem and two heuristics.

求助全文

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

来源期刊

2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)

自引率

0.00%

发文量