{"title":"Optimal cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence","authors":"J. Leung, Guoqing Zhang","doi":"10.1109/TRA.2003.810240","DOIUrl":null,"url":null,"abstract":"We introduce a mixed-integer programming formulation for finding optimal cyclic schedules for printed circuit board lines with multiple hoists on a shared track, where the processing sequence may be different than the location sequence of the tanks. Computational results on some benchmark problems indicate that optimal cyclic schedules for problems of realistic size can be found in a reasonable time.","PeriodicalId":161449,"journal":{"name":"IEEE Trans. Robotics Autom.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2003-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Trans. Robotics Autom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TRA.2003.810240","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 60
Abstract
We introduce a mixed-integer programming formulation for finding optimal cyclic schedules for printed circuit board lines with multiple hoists on a shared track, where the processing sequence may be different than the location sequence of the tanks. Computational results on some benchmark problems indicate that optimal cyclic schedules for problems of realistic size can be found in a reasonable time.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
