基于数据的作业车间调度问题定时Petri网识别方法

2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM) Pub Date : 2018-12-01 DOI:10.1109/IEEM.2018.8607741

T. Nishi, Naoki Shimamura

{"title":"基于数据的作业车间调度问题定时Petri网识别方法","authors":"T. Nishi, Naoki Shimamura","doi":"10.1109/IEEM.2018.8607741","DOIUrl":null,"url":null,"abstract":"We address a data-based identification method of machine scheduling problems using timed Petri nets. A general machine scheduling model is represented by timed Petri nets with resource places. Given a set of machines and jobs, and their starting times and completion times of several machines, the objective is to find resource constraints of a given machine scheduling problem from input and output data. The problem is to find the connectivity of each resource place in the operational places. A mixed integer linear programming model is formulated to find an optimal connectivity of resource places to minimize the mean square error of the input and output data. An approximation algorithm is developed to apply larger instances. Numerical examples are provided to show the effectiveness of the proposed approximation algorithm.","PeriodicalId":119238,"journal":{"name":"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets\",\"authors\":\"T. Nishi, Naoki Shimamura\",\"doi\":\"10.1109/IEEM.2018.8607741\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We address a data-based identification method of machine scheduling problems using timed Petri nets. A general machine scheduling model is represented by timed Petri nets with resource places. Given a set of machines and jobs, and their starting times and completion times of several machines, the objective is to find resource constraints of a given machine scheduling problem from input and output data. The problem is to find the connectivity of each resource place in the operational places. A mixed integer linear programming model is formulated to find an optimal connectivity of resource places to minimize the mean square error of the input and output data. An approximation algorithm is developed to apply larger instances. Numerical examples are provided to show the effectiveness of the proposed approximation algorithm.\",\"PeriodicalId\":119238,\"journal\":{\"name\":\"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)\",\"volume\":\"79 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEM.2018.8607741\",\"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 International Conference on Industrial Engineering and Engineering Management (IEEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2018.8607741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

利用定时Petri网，提出了一种基于数据的机器调度问题识别方法。一个通用的机器调度模型用带资源位置的定时Petri网表示。给定一组机器和作业，以及它们的开始时间和几台机器的完成时间，目标是从输入和输出数据中找到给定机器调度问题的资源约束。问题是找到每个资源位置在操作位置的连通性。建立了一个混合整数线性规划模型，以求得资源位置的最优连通性，使输入和输出数据的均方误差最小。提出了一种适用于较大实例的近似算法。数值算例表明了所提近似算法的有效性。

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

查看原文本刊更多论文

Data-Based Identification Method for Jobshop Scheduling Problems Using Timed Petri Nets

We address a data-based identification method of machine scheduling problems using timed Petri nets. A general machine scheduling model is represented by timed Petri nets with resource places. Given a set of machines and jobs, and their starting times and completion times of several machines, the objective is to find resource constraints of a given machine scheduling problem from input and output data. The problem is to find the connectivity of each resource place in the operational places. A mixed integer linear programming model is formulated to find an optimal connectivity of resource places to minimize the mean square error of the input and output data. An approximation algorithm is developed to apply larger instances. Numerical examples are provided to show the effectiveness of the proposed approximation algorithm.

求助全文

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

来源期刊

2018 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)

自引率

0.00%

发文量