File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-0029770852
- WOS: WOS:A1996UG41400003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A branch and bound algorithm for hoist scheduling of a circuit board production line
Title | A branch and bound algorithm for hoist scheduling of a circuit board production line |
---|---|
Authors | |
Keywords | Branch And Bound Algorithm Cyclic Hoist Scheduling Time Window Constraints |
Issue Date | 1996 |
Publisher | Springer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0920-6299 |
Citation | International Journal Of Flexible Manufacturing Systems, 1996, v. 8 n. 1, p. 45-65 How to Cite? |
Abstract | The article studies the scheduling problem of a material handling hoist in a circuit board production line. The existing models for the problem assume that the times required to perform inter-tank moves are given constants. However, as shown in a simple example, the optimal solutions obtained under this assumption may not be the actual optimal solutions. In this article the times for inter-tank moves are decision variables of a mixed integer program proposed for the problem. An efficient branch and bound algorithm is developed for solving the problem optimally. A numerical example is used to illustrate the algorithm. Computational experience with benchmark problems and randomly generated test problems is discussed. © 1996 Kluwer Academic Publishers. |
Persistent Identifier | http://hdl.handle.net/10722/155810 |
ISSN | |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ng, WC | en_US |
dc.date.accessioned | 2012-08-08T08:37:51Z | - |
dc.date.available | 2012-08-08T08:37:51Z | - |
dc.date.issued | 1996 | en_US |
dc.identifier.citation | International Journal Of Flexible Manufacturing Systems, 1996, v. 8 n. 1, p. 45-65 | en_US |
dc.identifier.issn | 0920-6299 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155810 | - |
dc.description.abstract | The article studies the scheduling problem of a material handling hoist in a circuit board production line. The existing models for the problem assume that the times required to perform inter-tank moves are given constants. However, as shown in a simple example, the optimal solutions obtained under this assumption may not be the actual optimal solutions. In this article the times for inter-tank moves are decision variables of a mixed integer program proposed for the problem. An efficient branch and bound algorithm is developed for solving the problem optimally. A numerical example is used to illustrate the algorithm. Computational experience with benchmark problems and randomly generated test problems is discussed. © 1996 Kluwer Academic Publishers. | en_US |
dc.language | eng | en_US |
dc.publisher | Springer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0920-6299 | en_US |
dc.relation.ispartof | International Journal of Flexible Manufacturing Systems | en_US |
dc.subject | Branch And Bound Algorithm | en_US |
dc.subject | Cyclic Hoist Scheduling | en_US |
dc.subject | Time Window Constraints | en_US |
dc.title | A branch and bound algorithm for hoist scheduling of a circuit board production line | en_US |
dc.type | Article | en_US |
dc.identifier.email | Ng, WC:ngwc@hkucc.hku.hk | en_US |
dc.identifier.authority | Ng, WC=rp00160 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0029770852 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0029770852&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 8 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.spage | 45 | en_US |
dc.identifier.epage | 65 | en_US |
dc.identifier.isi | WOS:A1996UG41400003 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Ng, WC=7401613494 | en_US |
dc.identifier.issnl | 0920-6299 | - |