{"title":"基于定时Petri网和数学规划的柔性制造系统调度","authors":"T. Bourdeaud'huy, S. Hanafi, P. Yim","doi":"10.1109/WODES.2006.1678414","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a mathematical programming model for the exact resolution of the reachability problem in timed Petri nets. Such nets allow to model a large class of scheduling problems, while taking into account concurrency, parallelism and synchronisation. They are thus a natural way of dealing with \"flexible\" manufacturing problems, where several resources can be used for the same task. Our model is as general as possible since we do not make assumptions about the firing policy","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"39 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Scheduling of flexible manufacturing systems using timed Petri nets and mathematical programming\",\"authors\":\"T. Bourdeaud'huy, S. Hanafi, P. Yim\",\"doi\":\"10.1109/WODES.2006.1678414\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a mathematical programming model for the exact resolution of the reachability problem in timed Petri nets. Such nets allow to model a large class of scheduling problems, while taking into account concurrency, parallelism and synchronisation. They are thus a natural way of dealing with \\\"flexible\\\" manufacturing problems, where several resources can be used for the same task. Our model is as general as possible since we do not make assumptions about the firing policy\",\"PeriodicalId\":285315,\"journal\":{\"name\":\"2006 8th International Workshop on Discrete Event Systems\",\"volume\":\"39 1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 8th International Workshop on Discrete Event Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2006.1678414\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 8th International Workshop on Discrete Event Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2006.1678414","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduling of flexible manufacturing systems using timed Petri nets and mathematical programming
In this paper, we propose a mathematical programming model for the exact resolution of the reachability problem in timed Petri nets. Such nets allow to model a large class of scheduling problems, while taking into account concurrency, parallelism and synchronisation. They are thus a natural way of dealing with "flexible" manufacturing problems, where several resources can be used for the same task. Our model is as general as possible since we do not make assumptions about the firing policy
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
