書誌事項
- タイトル別名
-
- An Allocation Problem of Workers in a U-shaped Line-Separate Allocation vs. Carousel Allocation
- Uジ セイサン ライン ニ オケル タノウコウ ハイチ モンダイ ブンカツ ホウシキ ト ジュンカイ ホウシキ
- Separate Allocation vs. Carousel Allocation
- 分割方式と巡回方式
この論文をさがす
抄録
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.
収録刊行物
-
- システム制御情報学会論文誌
-
システム制御情報学会論文誌 17 (6), 230-240, 2004
一般社団法人 システム制御情報学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390282680143484288
-
- NII論文ID
- 10013169788
-
- NII書誌ID
- AN1013280X
-
- ISSN
- 2185811X
- 13425668
-
- NDL書誌ID
- 6966642
-
- 本文言語コード
- ja
-
- データソース種別
-
- JaLC
- NDL
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可