Transactions of the Institute of Systems, Control and Information Engineers
Online ISSN : 2185-811X
Print ISSN : 1342-5668
ISSN-L : 1342-5668
An Allocation Problem of Workers in a U-shaped Line
Separate Allocation vs. Carousel Allocation
Shuhei HIRAOTakahiro ITOKoichi NAKADEMitsutoshi KOJIMAKatsuhisa OHNO
Author information
JOURNALS FREE ACCESS

2004 Volume 17 Issue 6 Pages 230-240

Details
Abstract

In this paper, we deal with a U-shaped production line with multiple multi-function workers. Each worker takes charge of multiple machines. We consider two types of allocations of workers to machines, a separate allocation and a carousal allocation. In the separate allocation, each worker takes charge of a unique set of machines and therefore at each machine the same worker operates items in every cycle. In the carousel allocation, all workers take charge of all machines in the same order. The processing times of the machines, and the operation and walking times of the workers are assumed to be independent and identically distributed random variables. We examine the influence of the variances of these processing, operation and walking times upon the cycle times of these allocation models by simulation and experimental design. We also examine the influences of the buffer sizes and the number of items in these buffers upon the cycle time, if the U-shaped line has some buffers and some items in them.

Information related to the author
© The Institute of Systems, Control and Information Engineers
Previous article Next article
feedback
Top