File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Scopus: eid_2-s2.0-0028317754
- WOS: WOS:A1994MU55300018
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A branch and bound algorithm for scheduling just-in-time mixed-model assembly lines
Title | A branch and bound algorithm for scheduling just-in-time mixed-model assembly lines |
---|---|
Authors | |
Issue Date | 1994 |
Publisher | Elsevier 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? |
Abstract | In 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 Identifier | http://hdl.handle.net/10722/155800 |
ISSN | 2023 Impact Factor: 9.8 2023 SCImago Journal Rankings: 3.074 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ng, WC | en_US |
dc.contributor.author | Mak, KL | en_US |
dc.date.accessioned | 2012-08-08T08:37:48Z | - |
dc.date.available | 2012-08-08T08:37:48Z | - |
dc.date.issued | 1994 | en_US |
dc.identifier.citation | International Journal Of Production Economics, 1994, v. 33 n. 1-3, p. 169-183 | en_US |
dc.identifier.issn | 0925-5273 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/155800 | - |
dc.description.abstract | In 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.language | eng | en_US |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ijpe | en_US |
dc.relation.ispartof | International Journal of Production Economics | en_US |
dc.title | A branch and bound algorithm for scheduling just-in-time mixed-model assembly lines | en_US |
dc.type | Article | en_US |
dc.identifier.email | Ng, WC:ngwc@hkucc.hku.hk | en_US |
dc.identifier.email | Mak, KL:makkl@hkucc.hku.hk | en_US |
dc.identifier.authority | Ng, WC=rp00160 | en_US |
dc.identifier.authority | Mak, KL=rp00154 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-0028317754 | en_US |
dc.identifier.volume | 33 | en_US |
dc.identifier.issue | 1-3 | en_US |
dc.identifier.spage | 169 | en_US |
dc.identifier.epage | 183 | en_US |
dc.identifier.isi | WOS:A1994MU55300018 | - |
dc.publisher.place | Netherlands | en_US |
dc.identifier.scopusauthorid | Ng, WC=7401613494 | en_US |
dc.identifier.scopusauthorid | Mak, KL=7102680226 | en_US |
dc.identifier.issnl | 0925-5273 | - |