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)
2000), `A fast recursive algorithm for constructing matrices with prescribed eigenvalues an Abstract. The Weyl-Horn theorem characterizes a relationship ...
An Adjusted Recursive Op... 暂无评价 6页 免费 E cient dynamic optimiza....the performance of the LI optimization algorithm for online control allocation...
Robust recursive least squares learning algorithm for principal component ...The dual learning rate parameters are adjusted adaptively to make the ...
The algorithm consists of two major steps. The first step is an extended Kalm...更多>>A recursive two-step method to recover structure and motion from...
Finally, we outline pure recursive algorithms for all problems considered. A FASTER AND SIMPLER RECURSIVE ALGORITHM 949 REFERENCES 1. B. S. Andersen, F....
The algorithm combines concepts of 1-D robust regression with the recursive least squares lattice algorithm. The philosophy of using different optimization ...
21, NO. 1, JANUARY 2006 15 Recursive Algorithm for Real-Time Measurement of Electrical Variables in Power Systems Tao Lin and Alexander Domijan, Jr. ...
RECURSIVE ALGORITHM FOR THE GENERATION OF RELATIVISTIC KINEMATICS FOR COLLISIONS AND DECAYS We describe an algorithm for the generation of relativistic ...
A recursive algorithm for Markov random fields_...(1970). We outline some extensions to more ... Exact optimization for... 暂无评价 17页 免费 ...
A NEW RECURSIVE ALGORITHMFORMULTIUSERDETECTIONlZhengBaoyuLiLeiChenChao’andTele...(1inear dH≤Gi From an optimizationpointofview complexity)detectors.Theco— ...
热门文档