{"title":"双机柔性制造单元的并发路由、排序和设置","authors":"Eng-Joo Lee, P. Mirchandani","doi":"10.1109/56.786","DOIUrl":null,"url":null,"abstract":"An approach that allows in-process machine-loading through magazine setups, and concurrently routes and sequences the jobs on the versatile machines, is presented. To illustrate the concurrent approach, a specific two-versatile-machine flowshop scheduling problem, referred to as 2-VFSP, is defined and studied in detail. Theoretical results show that the optimal schedule for 2-VFSP need not have more than two in-process magazine setups, giving rise to the three possible scheduling configurations. Further, it is proven that obtaining the optimal schedule is an NP-complete problem. A heuristic is developed and tested on sets of random joblists, with different setup times corresponding to varying degrees of machine versatility. Results indicate that schedules which incorporate in-process magazine setup(s) may be more desirable when the setup time is small. Thus the use of concurrent scheduling approach which allows in-process magazine setups may be especially useful for systems with very versatile machines. >","PeriodicalId":370047,"journal":{"name":"IEEE J. Robotics Autom.","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"33","resultStr":"{\"title\":\"Concurrent routing, sequencing, and setups for a two-machine flexible manufacturing cell\",\"authors\":\"Eng-Joo Lee, P. Mirchandani\",\"doi\":\"10.1109/56.786\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An approach that allows in-process machine-loading through magazine setups, and concurrently routes and sequences the jobs on the versatile machines, is presented. To illustrate the concurrent approach, a specific two-versatile-machine flowshop scheduling problem, referred to as 2-VFSP, is defined and studied in detail. Theoretical results show that the optimal schedule for 2-VFSP need not have more than two in-process magazine setups, giving rise to the three possible scheduling configurations. Further, it is proven that obtaining the optimal schedule is an NP-complete problem. A heuristic is developed and tested on sets of random joblists, with different setup times corresponding to varying degrees of machine versatility. Results indicate that schedules which incorporate in-process magazine setup(s) may be more desirable when the setup time is small. Thus the use of concurrent scheduling approach which allows in-process magazine setups may be especially useful for systems with very versatile machines. >\",\"PeriodicalId\":370047,\"journal\":{\"name\":\"IEEE J. Robotics Autom.\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"33\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE J. Robotics Autom.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/56.786\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE J. Robotics Autom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/56.786","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Concurrent routing, sequencing, and setups for a two-machine flexible manufacturing cell
An approach that allows in-process machine-loading through magazine setups, and concurrently routes and sequences the jobs on the versatile machines, is presented. To illustrate the concurrent approach, a specific two-versatile-machine flowshop scheduling problem, referred to as 2-VFSP, is defined and studied in detail. Theoretical results show that the optimal schedule for 2-VFSP need not have more than two in-process magazine setups, giving rise to the three possible scheduling configurations. Further, it is proven that obtaining the optimal schedule is an NP-complete problem. A heuristic is developed and tested on sets of random joblists, with different setup times corresponding to varying degrees of machine versatility. Results indicate that schedules which incorporate in-process magazine setup(s) may be more desirable when the setup time is small. Thus the use of concurrent scheduling approach which allows in-process magazine setups may be especially useful for systems with very versatile machines. >