Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach

Janny M. Y. Leung (), Guoqing Zhang (), Xiaoguang Yang (), Raymond Mak () and Kokin Lam ()
Additional contact information
Janny M. Y. Leung: Systems Engineering and Engineering Management Department, The Chinese University of Hong Kong, Shatin, Hong Kong
Guoqing Zhang: Industrial and Manufacturing Systems Engineering Department, University of Windsor, Windsor, Ontario, Canada N9B 3P4
Xiaoguang Yang: Key Laboratory of Management, Decision, and Information Systems, Institute of Systems Science, The Chinese Academy of Sciences, Beijing, China
Raymond Mak: Planning and Engineering Department, Asia Pacific Division, FedEx Express, Hong Kong
Kokin Lam: Division of Commerce, City University of Hong Kong, Kowloon, Hong Kong

Operations Research, 2004, vol. 52, issue 6, 965-976

Abstract: 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.

Keywords: mixed integer programming; applications; formulation; production/scheduling; applications; cyclic scheduling; industries; chemical; electric; hoist scheduling (search for similar items in EconPapers)
Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1040.0144 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:52:y:2004:i:6:p:965-976

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().