File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A branch and bound algorithm for scheduling just-in-time mixed-model assembly lines

TitleA branch and bound algorithm for scheduling just-in-time mixed-model assembly lines
Authors
Ng, WCMak, KL
Issue Date1994
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ijpe
Citation
International Journal Of Production Economics, 1994, v. 33 n. 1-3, p. 169-183 How to Cite?
AbstractIn this paper, an efficient branch and bound algorithm is developed for determining effective assembly sequences for mixed-model assembly lines that produce products with similar part requirements in a just-in-time production environment. The objective is to maintain a constant usage rate for every part used by the lines. A numerical example is used to illustrate the procedure of the algorithm. The performance of the algorithm is then evaluated by using randomly generated test problems. © 1994.
Persistent Identifierhttp://hdl.handle.net/10722/155800
ISSN
0925-5273
2021 Impact Factor: 11.251
2020 SCImago Journal Rankings: 2.406

 

DC FieldValueLanguage
dc.contributor.authorNg, WCen_US
dc.contributor.authorMak, KLen_US
dc.date.accessioned2012-08-08T08:37:48Z-
dc.date.available2012-08-08T08:37:48Z-
dc.date.issued1994en_US
dc.identifier.citationInternational Journal Of Production Economics, 1994, v. 33 n. 1-3, p. 169-183en_US
dc.identifier.issn0925-5273en_US
dc.identifier.urihttp://hdl.handle.net/10722/155800-
dc.description.abstractIn this paper, an efficient branch and bound algorithm is developed for determining effective assembly sequences for mixed-model assembly lines that produce products with similar part requirements in a just-in-time production environment. The objective is to maintain a constant usage rate for every part used by the lines. A numerical example is used to illustrate the procedure of the algorithm. The performance of the algorithm is then evaluated by using randomly generated test problems. © 1994.en_US
dc.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ijpeen_US
dc.relation.ispartofInternational Journal of Production Economicsen_US
dc.titleA branch and bound algorithm for scheduling just-in-time mixed-model assembly linesen_US
dc.typeArticleen_US
dc.identifier.emailNg, WC:ngwc@hkucc.hku.hken_US
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_US
dc.identifier.authorityNg, WC=rp00160en_US
dc.identifier.authorityMak, KL=rp00154en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0028317754en_US
dc.identifier.volume33en_US
dc.identifier.issue1-3en_US
dc.identifier.spage169en_US
dc.identifier.epage183en_US
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridNg, WC=7401613494en_US
dc.identifier.scopusauthoridMak, KL=7102680226en_US
dc.identifier.issnl0925-5273-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats