File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Synthesis of Kanban control policies for multi-stage just-in-time assembly systems

TitleSynthesis of Kanban control policies for multi-stage just-in-time assembly systems
Authors
KeywordsJust-In-Time Manufacturing
Kanban Control
Optimization
Issue Date1999
PublisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0305215x.asp
Citation
Engineering Optimization, 1999, v. 31 n. 2, p. 191-224 How to Cite?
AbstractThis paper studies the problem of determining the number of Kanbans that should be assigned to each production stage of a multi-stage assembly system in a just-in-time production environment. The objective is to minimize the inventory cost of the system. A new algorithm is developed as a means of solving such a problem. The approach is described in some detail and the theoretical results obtained are illustrated by using a numerical example. A set of randomly generated test problems are also included to illustrate the performance of the algorithm. The results show that the algorithm proposed in this paper is indeed superior both in terms of minimizing the required amount of computational effort and improving accuracy. © 1998 OPA (Overseas Publishers Association) N.V.
Persistent Identifierhttp://hdl.handle.net/10722/155878
ISSN
2015 Impact Factor: 1.38
2015 SCImago Journal Rankings: 0.866
References

 

DC FieldValueLanguage
dc.contributor.authorMak, KLen_US
dc.contributor.authorNg, WCen_US
dc.date.accessioned2012-08-08T08:38:09Z-
dc.date.available2012-08-08T08:38:09Z-
dc.date.issued1999en_US
dc.identifier.citationEngineering Optimization, 1999, v. 31 n. 2, p. 191-224en_US
dc.identifier.issn0305-215Xen_US
dc.identifier.urihttp://hdl.handle.net/10722/155878-
dc.description.abstractThis paper studies the problem of determining the number of Kanbans that should be assigned to each production stage of a multi-stage assembly system in a just-in-time production environment. The objective is to minimize the inventory cost of the system. A new algorithm is developed as a means of solving such a problem. The approach is described in some detail and the theoretical results obtained are illustrated by using a numerical example. A set of randomly generated test problems are also included to illustrate the performance of the algorithm. The results show that the algorithm proposed in this paper is indeed superior both in terms of minimizing the required amount of computational effort and improving accuracy. © 1998 OPA (Overseas Publishers Association) N.V.en_US
dc.languageengen_US
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/0305215x.aspen_US
dc.relation.ispartofEngineering Optimizationen_US
dc.subjectJust-In-Time Manufacturingen_US
dc.subjectKanban Controlen_US
dc.subjectOptimizationen_US
dc.titleSynthesis of Kanban control policies for multi-stage just-in-time assembly systemsen_US
dc.typeArticleen_US
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_US
dc.identifier.emailNg, WC:ngwc@hkucc.hku.hken_US
dc.identifier.authorityMak, KL=rp00154en_US
dc.identifier.authorityNg, WC=rp00160en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-25844475281en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-25844475281&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume31en_US
dc.identifier.issue2en_US
dc.identifier.spage191en_US
dc.identifier.epage224en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridMak, KL=7102680226en_US
dc.identifier.scopusauthoridNg, WC=7401613494en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats