Optimal cyclic multi-hoist scheduling: A mixed integer programming approach | |
Leung, JMY; Zhang, GQ; Yang, XG![]() | |
刊名 | OPERATIONS RESEARCH
![]() |
2004-11-01 | |
卷号 | 52期号:6页码:965-976 |
ISSN号 | 0030-364X |
DOI | 10.1287/opre.1040.0144 |
英文摘要 | In the manufacture of circuit boards, panels are immersed sequentially in a series of tanks, with upper and lower bounds on the processing time within each tank. The panels are mounted on carriers that are lowered into and raised from the tanks, and transported from tank to tank by programmable hoists. The sequence of hoist moves does not have to follow the sequence of processing stages for the circuit boards. By optimising the sequence of hoist moves, we can maximise the production throughput. We consider simple cyclic schedules, where the hoist move sequence repeats every cycle and one panel is completed per cycle. Phillips and Unger (1976) developed the first mixed integer programming model for finding the hoist move schedule to minimise the cycle time for lines with only one hoist. We discuss how their formulation can be tightened, and introduce new valid inequalities. We present the first mixed integer programming formulation for finding the minimum-time cycle for lines with multiple hoists and present valid inequalities for this problem. Some preliminary computational results are also presented. |
WOS研究方向 | Business & Economics ; Operations Research & Management Science |
语种 | 英语 |
出版者 | INST OPERATIONS RESEARCH MANAGEMENT SCIENCES |
WOS记录号 | WOS:000225623500012 |
内容类型 | 期刊论文 |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/19426] ![]() |
专题 | 系统科学研究所 |
通讯作者 | Leung, JMY |
作者单位 | 1.Chinese Univ Hong Kong, Syst Engn & Engn Management Dept, Shatin, Hong Kong, Peoples R China 2.Univ Windsor, Dept Ind & Mfg Syst Engn, Windsor, ON N9B 3P4, Canada 3.Chinese Acad Sci, Inst Syst Sci, Key Lab Management Decis & Informat Syst, Beijing, Peoples R China 4.FedEx Express, Asia Pacific Div, Planning & Engn Dept, Hong Kong, Hong Kong, Peoples R China 5.City Univ Hong Kong, Div Commerce, Kowloon, Hong Kong, Peoples R China |
推荐引用方式 GB/T 7714 | Leung, JMY,Zhang, GQ,Yang, XG,et al. Optimal cyclic multi-hoist scheduling: A mixed integer programming approach[J]. OPERATIONS RESEARCH,2004,52(6):965-976. |
APA | Leung, JMY,Zhang, GQ,Yang, XG,Mak, R,&Lam, K.(2004).Optimal cyclic multi-hoist scheduling: A mixed integer programming approach.OPERATIONS RESEARCH,52(6),965-976. |
MLA | Leung, JMY,et al."Optimal cyclic multi-hoist scheduling: A mixed integer programming approach".OPERATIONS RESEARCH 52.6(2004):965-976. |
个性服务 |
查看访问统计 |
相关权益政策 |
暂无数据 |
收藏/分享 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论