CSpace  > 系统科学研究所
Optimal cyclic multi-hoist scheduling: A mixed integer programming approach
Leung, JMY; Zhang, GQ; Yang, XG; Mak, R; Lam, K
2004-11-01
Source PublicationOPERATIONS RESEARCH
ISSN0030-364X
Volume52Issue:6Pages:965-976
AbstractIn 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.
DOI10.1287/opre.1040.0144
Language英语
WOS Research AreaBusiness & Economics ; Operations Research & Management Science
WOS SubjectManagement ; Operations Research & Management Science
WOS IDWOS:000225623500012
PublisherINST OPERATIONS RESEARCH MANAGEMENT SCIENCES
Citation statistics
Cited Times:58[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/19427
Collection系统科学研究所
Affiliation1.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
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Leung, JMY]'s Articles
[Zhang, GQ]'s Articles
[Yang, XG]'s Articles
Baidu academic
Similar articles in Baidu academic
[Leung, JMY]'s Articles
[Zhang, GQ]'s Articles
[Yang, XG]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Leung, JMY]'s Articles
[Zhang, GQ]'s Articles
[Yang, XG]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.