A new model and an efficient branch-and-bound solution for cyclic multi-hoist scheduling

Yun Jiang and Jiyin Liu

IISE Transactions, 2014, vol. 46, issue 3, 249-262

Abstract: This article studies the multi-hoist cyclic scheduling problem in electroplating lines where the processing time of parts in each tank must be within given lower and upper limits and part moves between tanks are allowed in both directions along the line. The problem arises in electroplating lines such as those used in the production of printed circuit boards and has previously been modeled as a mixed-integer linear program. The possible relative positions of any pair of moves are analyzed and a set of linear constraints is derived that expresses the no-collision requirements for hoists. Based on the analysis, a new mixed-integer linear programming model is formulated for the multi-hoist scheduling problem. An efficient branch-and-bound strategy is proposed to solve the problem. Computational results show that the new model can be solved much more quickly than an existing model in the literature and that the proposed solution method is more efficient in solving the problem than a commercial software package.

Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1080/0740817X.2012.762485 (text/html)
Access to full text is restricted to subscribers.

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:taf:uiiexx:v:46:y:2014:i:3:p:249-262

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/0740817X.2012.762485

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().