Allocation of work to the stations of an assembly line with buffers between stations and three general learning patterns Online publication date: Sat, 22-Dec-2007
by Yuval Cohen, Ezey M. Dar-El, Gad Vitner, Subhash C. Sarin
International Journal of Intelligent Systems Technologies and Applications (IJISTA), Vol. 4, No. 1/2, 2008
Abstract: This paper addresses the problem of allocating work to the stations of an assembly line for minimising the makespan required to process a lot of products with a low overall demand. This environment is characterised by different learning slopes in the various stations (due to the nature of work). We assume small (e.g. a laser pen) to medium size products (e.g. a pilot helmet) so buffer space, for temporary purposes, is typically not a problem. Three general patterns of stations' learning are considered, namely, decreasing, increasing and constant. Methodologies are presented for the optimal allocation of work to the stations for each of these cases. Some numerical results are also presented to show a significant impact of buffer capacity on makespan reduction as well as to reveal significant improvement in the makespan value due to unequal (but optimal) work allocation.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Systems Technologies and Applications (IJISTA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook