File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A branch and bound algorithm for hoist scheduling of a circuit board production line

TitleA branch and bound algorithm for hoist scheduling of a circuit board production line
Authors
KeywordsBranch And Bound Algorithm
Cyclic Hoist Scheduling
Time Window Constraints
Issue Date1996
PublisherSpringer 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?
AbstractThe 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 Identifierhttp://hdl.handle.net/10722/155810
ISSN
2009 Impact Factor: 0.903
References

 

DC FieldValueLanguage
dc.contributor.authorNg, WCen_US
dc.date.accessioned2012-08-08T08:37:51Z-
dc.date.available2012-08-08T08:37:51Z-
dc.date.issued1996en_US
dc.identifier.citationInternational Journal Of Flexible Manufacturing Systems, 1996, v. 8 n. 1, p. 45-65en_US
dc.identifier.issn0920-6299en_US
dc.identifier.urihttp://hdl.handle.net/10722/155810-
dc.description.abstractThe 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.languageengen_US
dc.publisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0920-6299en_US
dc.relation.ispartofInternational Journal of Flexible Manufacturing Systemsen_US
dc.subjectBranch And Bound Algorithmen_US
dc.subjectCyclic Hoist Schedulingen_US
dc.subjectTime Window Constraintsen_US
dc.titleA branch and bound algorithm for hoist scheduling of a circuit board production lineen_US
dc.typeArticleen_US
dc.identifier.emailNg, WC:ngwc@hkucc.hku.hken_US
dc.identifier.authorityNg, WC=rp00160en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0029770852en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0029770852&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume8en_US
dc.identifier.issue1en_US
dc.identifier.spage45en_US
dc.identifier.epage65en_US
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridNg, WC=7401613494en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats