{"title":"多顺序批处理反应器任务调度决策模型的建立","authors":"Tomasz Ujazdowski, R. Piotrowski","doi":"10.1109/MMAR55195.2022.9874345","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of scheduling the work cycles of multiple Sequential Batch Reactors. The paper proposes a decision model based on the Flow-Shop Scheduling Problem. Three tank sizes and tasks with variable number of phases were assumed. The application of the model for task scheduling has been tested using an optimisation algorithm. Task scheduling problems belong to NP-hard problems and are often solved by non-deterministic algorithms. The solution of the presented problem was realised by using the differential evolution algorithm for three different objective functions. Assuming both the criterion of minimising the maximum execution time (makespan) and the criterion of even operating time of the Sequential Batch Reactors.","PeriodicalId":169528,"journal":{"name":"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)","volume":"258 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Development of a decision model for solving the task scheduling of multiple Sequential Batch Reactors\",\"authors\":\"Tomasz Ujazdowski, R. Piotrowski\",\"doi\":\"10.1109/MMAR55195.2022.9874345\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of scheduling the work cycles of multiple Sequential Batch Reactors. The paper proposes a decision model based on the Flow-Shop Scheduling Problem. Three tank sizes and tasks with variable number of phases were assumed. The application of the model for task scheduling has been tested using an optimisation algorithm. Task scheduling problems belong to NP-hard problems and are often solved by non-deterministic algorithms. The solution of the presented problem was realised by using the differential evolution algorithm for three different objective functions. Assuming both the criterion of minimising the maximum execution time (makespan) and the criterion of even operating time of the Sequential Batch Reactors.\",\"PeriodicalId\":169528,\"journal\":{\"name\":\"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)\",\"volume\":\"258 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MMAR55195.2022.9874345\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 26th International Conference on Methods and Models in Automation and Robotics (MMAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MMAR55195.2022.9874345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Development of a decision model for solving the task scheduling of multiple Sequential Batch Reactors
This paper considers the problem of scheduling the work cycles of multiple Sequential Batch Reactors. The paper proposes a decision model based on the Flow-Shop Scheduling Problem. Three tank sizes and tasks with variable number of phases were assumed. The application of the model for task scheduling has been tested using an optimisation algorithm. Task scheduling problems belong to NP-hard problems and are often solved by non-deterministic algorithms. The solution of the presented problem was realised by using the differential evolution algorithm for three different objective functions. Assuming both the criterion of minimising the maximum execution time (makespan) and the criterion of even operating time of the Sequential Batch Reactors.