文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > An Adjusted Recursive Operator Allocation Optimization Algorithm for Line Balancing Control
侵权投诉

An Adjusted Recursive Operator Allocation Optimization Algorithm for Line Balancing Control

Abstract—This paper aims to solve the operator allocation optimization problem for line balancing control under two unsatisfied conditions. An approach is proposed for combination condition adjustment. An adjusted recursive operator allocation optimizatio

IAENG International Journal of Applied Mathematics, 36:1, IJAM_36_1_5

______________________________________________________________________________________

An Adjusted Recursive Operator Allocation Optimization Algorithm for Line Balancing Control

B.L. Song, W.K. Wong, J. Fan, and S.F. Chan1

presents the approach of adjustment. Section 4 introduces briefly about the adjusted operator allocation optimization algorithm, which includes recursive combination algorithm, recursive operator allocation algorithm and optimization, under these two situations. Section 5 conducts an experiment and reports the results. A conclusion is made in Section 6.

Index Terms—Operator allocation, Optimization, Recursive

Abstract—This paper aims to solve the operator allocation

optimization problem for line balancing control under two unsatisfied conditions. An approach is proposed for combination condition adjustment. An adjusted recursive operator allocation optimization algorithm is developed for generating the optimal solution under these two conditions adjusted.

algorithm, Assembly line balancing, and Operator efficiency

II.

I. INTRODUCTION

In the apparel industry, the planning and line-balancing decisions are heavily relied on the production experts. However, industrial experience shows that it is difficult for them to achieve a perfectly balanced line so that each operation can keep the same production rate [1]. It is because experts make decisions on the basis of their experience. The decisions are thus not scientific or optimal [2]. The complexity of combinatorial optimization caused by operator's multiple skills and variant efficiency on different operations make the matter even worse for optimal production control [3].

The development of an operator allocation optimization algorithm in apparel manufacture based on operator efficiency prediction is therefore significant in achieving the optimal solution to support the expert's decision making on line-balancing control [4]. An operator efficiency prediction (OEP) approach has been proposed with the data collected by UPS system [5]. A recursive operator allocation optimization algorithm has been developed for the situation that the combination condition is satisfied [6].

This paper is dedicated to solve the operator allocation optimization problem for two other situations where combination condition is not satisfied. The adjustment of combination condition is presented and the adjusted operator allocation optimization algorithm is further developed.

This paper is organized as follows: following the introduction, section 2 demonstrates the flow of the adjusted recursive operator allocation optimization, and explains two combination conditions that need to be adjusted. Section 3

This work was fully supported by a grant from the Research Grant Council of the Hong Kong Special Administrative Region, China. (Project No. Polyu 5288/03E)

B.L Song, W.K. Wong, J. Fan, and S.F. Chan. are with the Institute of Textiles and Clothing, the Hong Kong Polytechnic University, Hong Kong. (corresponding author: B.L. Song; phone: 852-27666453; fax: 852-27731432; e-mail: tcsongbl@inet.polyu.edu.hk).

1

PROBLEM OF ADJUSTED OPERATOR ALLOCATION

OPTIMIZATION

A. Nomenclature

The nomenclature used in this paper is summarized as follows. Sopr = the set of all operators,

Sopt

= the set of all operations, = the total number of all operators, = the total number of all operations,

NsoprNsopt

= the total number of operators that are really needed, = the standard allowed minutes to finish a fixed quantity garments in the ithoperation (e.g. 100 pieces),

SAM[i]

TSAM

Nsnopr

= the total SAM of all operations,

= the set of all operators available for operation i, =the number of operators available for operation i,

Sopr[i]

Nsopr[i]Ssopr[i]

= the set of single-skilled operators available for operation i ,

= the number of single skilled operators available for

operation i,

= the set of multiple-skilled operators available for operation i,

NSmopr[i]=the number of multiple-skilled operators available for operation i,

= the set of operators really needed for operation i in a new production order,

NSnopr[i]

NSsopr[i]

Smopr[i]

Snopr[i]

= the number of operators really needed on operation i,

= the set of multiple-skilled operators really needed for

operation i,

= the number of multiple-skilled operators really

needed for operation i,

NSnmopr[i]

Snmopr[i]

(Advance online publication: 1 February 2007)

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email