{"title":"车间作业问题的模型","authors":"F. Arfi, D. Saidouni, J. Ilié","doi":"10.1109/ICITES.2012.6216644","DOIUrl":null,"url":null,"abstract":"In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding the shortest paths in RATA model for the problem of job-shop and test their implementation.","PeriodicalId":137864,"journal":{"name":"2012 International Conference on Information Technology and e-Services","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A model for job-shop problem\",\"authors\":\"F. Arfi, D. Saidouni, J. Ilié\",\"doi\":\"10.1109/ICITES.2012.6216644\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding the shortest paths in RATA model for the problem of job-shop and test their implementation.\",\"PeriodicalId\":137864,\"journal\":{\"name\":\"2012 International Conference on Information Technology and e-Services\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 International Conference on Information Technology and e-Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITES.2012.6216644\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Information Technology and e-Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITES.2012.6216644","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding the shortest paths in RATA model for the problem of job-shop and test their implementation.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
