{"title":"基于监督控制理论的修船厂最优调度","authors":"Denis C. Pinha, M. H. D. Queiroz, J. Cury","doi":"10.1109/CASE.2011.6042515","DOIUrl":null,"url":null,"abstract":"Supervisory Control Theory (SCT) allows for the automatic synthesis of non-blocking supervisors capable of ensuring all and only those sequences of events that meet the specifications for discrete event systems. For a job shop problem, it's possible to obtain an optimal supervisor capable of satisfying resource, production routine and deadline specifications, as well as of providing all viable scheduling solutions, by using a timed SCT extension. This paper investigates the feasibility of applying SCT to production planning and logistics modeling - applications rendered possible through a method for synthesizing schedules via an innovative approach to resource modeling; through the incremental synthesis of production routines and deadlines; and through a bisection method for minimizing total production time and job-specific lead times. The method is applied to the scheduling of activities at a repair shipyard, namely, the activities of the five main resources involved in the execution of ten job orders. The paper concludes with the presentation of a computational tool developed to integrate production planning and a tool for automatic supervisory synthesis so as to facilitate handling of the interface by users not familiar with SCT.","PeriodicalId":236208,"journal":{"name":"2011 IEEE International Conference on Automation Science and Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"Optimal scheduling of a repair shipyard based on Supervisory Control Theory\",\"authors\":\"Denis C. Pinha, M. H. D. Queiroz, J. Cury\",\"doi\":\"10.1109/CASE.2011.6042515\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Supervisory Control Theory (SCT) allows for the automatic synthesis of non-blocking supervisors capable of ensuring all and only those sequences of events that meet the specifications for discrete event systems. For a job shop problem, it's possible to obtain an optimal supervisor capable of satisfying resource, production routine and deadline specifications, as well as of providing all viable scheduling solutions, by using a timed SCT extension. This paper investigates the feasibility of applying SCT to production planning and logistics modeling - applications rendered possible through a method for synthesizing schedules via an innovative approach to resource modeling; through the incremental synthesis of production routines and deadlines; and through a bisection method for minimizing total production time and job-specific lead times. The method is applied to the scheduling of activities at a repair shipyard, namely, the activities of the five main resources involved in the execution of ten job orders. The paper concludes with the presentation of a computational tool developed to integrate production planning and a tool for automatic supervisory synthesis so as to facilitate handling of the interface by users not familiar with SCT.\",\"PeriodicalId\":236208,\"journal\":{\"name\":\"2011 IEEE International Conference on Automation Science and Engineering\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Automation Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CASE.2011.6042515\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Automation Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASE.2011.6042515","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimal scheduling of a repair shipyard based on Supervisory Control Theory
Supervisory Control Theory (SCT) allows for the automatic synthesis of non-blocking supervisors capable of ensuring all and only those sequences of events that meet the specifications for discrete event systems. For a job shop problem, it's possible to obtain an optimal supervisor capable of satisfying resource, production routine and deadline specifications, as well as of providing all viable scheduling solutions, by using a timed SCT extension. This paper investigates the feasibility of applying SCT to production planning and logistics modeling - applications rendered possible through a method for synthesizing schedules via an innovative approach to resource modeling; through the incremental synthesis of production routines and deadlines; and through a bisection method for minimizing total production time and job-specific lead times. The method is applied to the scheduling of activities at a repair shipyard, namely, the activities of the five main resources involved in the execution of ten job orders. The paper concludes with the presentation of a computational tool developed to integrate production planning and a tool for automatic supervisory synthesis so as to facilitate handling of the interface by users not familiar with SCT.