{"title":"装配线平衡与工作区域和工位负载时间窗口的限制","authors":"R. Pastor, A. Corominas","doi":"10.1109/ISATP.1999.782999","DOIUrl":null,"url":null,"abstract":"This paper presents the solution of a real problem concerning assembly line balancing with several types of incompatibility, and with the constraint that, for a given number of stations, the load of the stations must be located within a time window that is predetermined according to the average load time. The problem is solved by a two-phase heuristic solution procedure: a truncated dynamic programming procedure and an improvement phase, which involves local optimization and tabu search procedures.","PeriodicalId":326575,"journal":{"name":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Assembly line balancing with work zone and station load time windows constraints\",\"authors\":\"R. Pastor, A. Corominas\",\"doi\":\"10.1109/ISATP.1999.782999\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents the solution of a real problem concerning assembly line balancing with several types of incompatibility, and with the constraint that, for a given number of stations, the load of the stations must be located within a time window that is predetermined according to the average load time. The problem is solved by a two-phase heuristic solution procedure: a truncated dynamic programming procedure and an improvement phase, which involves local optimization and tabu search procedures.\",\"PeriodicalId\":326575,\"journal\":{\"name\":\"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISATP.1999.782999\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISATP.1999.782999","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Assembly line balancing with work zone and station load time windows constraints
This paper presents the solution of a real problem concerning assembly line balancing with several types of incompatibility, and with the constraint that, for a given number of stations, the load of the stations must be located within a time window that is predetermined according to the average load time. The problem is solved by a two-phase heuristic solution procedure: a truncated dynamic programming procedure and an improvement phase, which involves local optimization and tabu search procedures.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
