• Title/Summary/Keyword: work sequence

Search Result 651, Processing Time 0.042 seconds

Optimization of Robot Welding Process of Subassembly Using Genetic Algorithm in the Shipbuilding (유전자 알고리즘을 이용한 조선 소조립 로봇용접공정의 최적화)

  • Park, Ju-Yong;Seo, Jeong-Jin;Kang, Hyun-Jin
    • Journal of Welding and Joining
    • /
    • v.27 no.2
    • /
    • pp.57-62
    • /
    • 2009
  • This research was carried out to improve the productivity in the subassembly process of shipbuilding through optimal work planning for the shortest work time. The work time consist of welding time, moving time of gantry, teaching time of robot and robot motion time. The shortest work time is accomplished by even distribution of work and the shortest welding sequence. Even distribution of work was done by appling the simple algorithm. The shortest work sequence was determined by using GA. The optimal work planning decreased the total work time of the subassembly process by 4.1%. The result showed the effectiveness of the suggested simple algorithm for even distribution of work and GA for the shortest welding sequence.

A Study on Determining of Job Sequence by Work Sampling(I) (W.S법에 의한 JOB SEQUENCE의 결정(I))

  • 강성수;노인규
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.11 no.18
    • /
    • pp.59-69
    • /
    • 1988
  • This study represents the method of application of W.S(Work Sampling) to determine job sequence. The result shows job sequence which has the came performance measure of optimal job sequence is selected by average number of 199 sampling. In the case, the optimal job sequence is not selected within the sampling number of 921 which satisfy the reliability of 99.5% and precision of 99%, the deviation is very little which 0.73%. This improves the possibility of application of W.S method to select optimal job sequence is very high.

  • PDF

Relation between the Irreducible Polynomials that Generates the Same Binary Sequence Over Odd Characteristic Field

  • Ali, Md. Arshad;Kodera, Yuta;Park, Taehwan;Kusaka, Takuya;Nogmi, Yasuyuki;Kim, Howon
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.3
    • /
    • pp.166-172
    • /
    • 2018
  • A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

Work Planning Using Genetic Algorithm and 3-D Simulation at a Subassembly Line of Shipyard (유전자 알고리즘을 이용한 조선 소조립 로봇용접 공정 작업 계획 및 3-D 시뮬레이션)

  • 강현진;박주용;박현철
    • Proceedings of the KWS Conference
    • /
    • 2004.05a
    • /
    • pp.18-20
    • /
    • 2004
  • This study is to find the optimal work plan of robot welding in the subassembly process of shipbuilding and to verify the found solution through 3-D simulation. The optimal work plan was established by evenly distributing the work amount to each stage and finding the shortest work sequence. The shortest work sequence was found by using the genetic algorithm. The result was compared with the practically adopted case and verified through the 3-D simulation.

  • PDF

Line Balanced Assembly Sequence Generation Based on a Verification of Disassemblability and Work Time (분해도 및 작업시간 산정을 통한 균형잡힌 조립공정계획에 관한 연구)

  • Shin, Chul-Kyun
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.24 no.7 s.196
    • /
    • pp.39-48
    • /
    • 2007
  • This paper presents a method of a line balanced assembly sequence generation based on the verification of a disassemblability and a work time. To derive the disassemblability for a part to be disassembled, first we inference collision free assembly directions by extracting separable directions fur the part. And we determine the disassemblability defined by the separability and stability cost. The separability cost represents a facility of the part disassembly operation, and the stability cost which represents a degree of the stability for the base assembly motion. Based upon the results, we propose a new approach of evaluating work time using neural networks. The proposed assembly sequence generation provides an effective means of solving the line balancing problem and gives a design guidance of planning assembly lay-out in flexible manufacturing application. Example study is given to illustrate the concepts and procedure of the proposed schemes.

A Study on Determining Job Sequence of Job Shop by Sampling Method (샘플링 기법(技法)에 의한 잡. 샵(Job Shop)의 작업순서(作業順序) 결정(決定))

  • Gang, Seong-Su;No, In-Gyu
    • Journal of Korean Society for Quality Management
    • /
    • v.17 no.1
    • /
    • pp.69-81
    • /
    • 1989
  • This study is concerned with a job sequencing method using the concept of sampling technique in the case of Job Shop. This is the follow study of Kang and Ro (1988) which examined the possibility of application of sampling technique to determine the Job Sequence in the case of Flow Shop. Not only it is very difficult, but also it takes too much time to develop the appropriate job schedules that satisfy the complex work conditions. The most job sequencing algorithms have been developed to determine the best or good solution under the special conditions or assumptions. The application areas of these algorithms are also very narrow, so it is very hard to find the appropriate algorithm which satisfy the complex work conditions. In this case it is very desirable to develop a simple job sequencing method which can select the optimal job sequence or near optimal job sequence with a little effort. This study is to examine the effect of sampling job sequencing which can select the good job of 0.01%~5% upper good group. The result shows that there is the sets of 0.05%~23% job sequence group which has the same amount of performance measure with the optimal job sequence in the case of experiment of N/M/G/$F_{max}$. This indicates that the sampling job sequencing method is a useful job sequencing method to find the optimal or good job sequence with consuming a small amount of time. The results of ANOVA show that the only one factor, number of machines is the significant factor for determining the job sequence at ${\alpha}=0.01$. It takes about 10 minutes to compare the number of 10,000 samples of job sequence by personal computer and it is proved that the selection rate of the same job sequence with optimal job sequence is 23.0%, 3.9% and 0.065% in the case of 2 machines, 3 machines and 4 machines, respectively. The area of application can readily be extended to the other work condition.

  • PDF

MAYER-VIETORIS SEQUENCE AND TORSION THEORY

  • Payrovi, Sh.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.37 no.3
    • /
    • pp.419-428
    • /
    • 2000
  • This work presents a new construction of Mayer-Vietoris sequence using techniques from torsion theory and including the classical case as an example.

  • PDF

컨베이어 벨트를 이용한 혼합 모델 조립 라인에서의 미완료 작업량을 최소화하기 위한 제품 투입 순서 결정

  • 김시원;정봉주
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.10a
    • /
    • pp.157-160
    • /
    • 2000
  • This study is concerned with how to optimize the Input sequence of product models with sequence -dependent setup time in Mixed-Model Assembly Line (MMAL) using conveyor system. Usually MMAL consists of a number of stations linked by conveyor belt and each station has a work zone limited by upstream and downstream boundaries. To avoid improper interference between operators in the adjacent stations and excess of machine moving range, operators are forced to complete their operations within their predetermined work zone. In this study, our goal is to determine sequence of models for minimizing the total work unfinished within their work zone. A generalized formulation of the product sequencing problem in MMAL is presented and we developed an optimal procedure using Branch & Bound. Also we developed a heuristic procedure using local search.

  • PDF

Determination of Mode I Fracture Toughness of Fiber Reinforced Composites by the Elastic Work Factor (섬유강화 복합재의 $G_ {IC}$ 결정을 위한 일인자방법)

  • Lee, Gyeong-Yeop;Go, Seung-Gi
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.20 no.11
    • /
    • pp.3491-3497
    • /
    • 1996
  • The work factor approach was applied to determine $G_ {IC}$ of fiber reinforced composites (AS4/3501) from a single unidirectional (0-deg) DCB specimen. Elastic work factors of DCB specimen for three different symmetrical staking sequences were derived from a simple bending theory and a finite element method. The results showed that elastic work factors calculated from both methods were comparable each other. In particular, the elastic work factor of DCB specimen with symmetrical stacking sequence is independent of stacking sequence. The $G_ {IC}$ determined from the work factor approach was compared with that determined by the compliance method. The results showed that the work factor approach and the compliance method produce comparable results of $G_ {IC}$. Thus, $G_ {IC}$ can be determined from a single DCB specimen using the work factor approach.

Load Redistribution of Prestressed Concrete Girder Bridges during the Bearing Replacement

  • Park, Sun-Kyu;Kim, Hyeong-Yeol;Kim, Jung-Hyuk
    • KCI Concrete Journal
    • /
    • v.11 no.3
    • /
    • pp.141-151
    • /
    • 1999
  • In the replacement of bearing system of bridges, the jacking work to secure work spaces may cause damage of the superstructure, hence the behavior of superstructure by the jacking force must be considered. Especially, in prestressed concrete I-type girder bridges, considering the stress concentration at the girder and the load redistribution of superstructure, the allowable jacking force and jacking sequence have to be determined. In this study, an analytical method is proposed to calculate the jacking force and overall jacking sequence for the replacement of bearing system without any damage to the superstructure. The stress concentration at the girder and load redistribution of the deck due to jacking force are considered to compute the allowable jacking force for each girder and overall jacking sequence for girders in the deck. Using the solution algorithm developed in this study, the optimum jacking sequence and required jacking force for the prestressed concrete I-type gilder bridge having the standard sections are calculated.

  • PDF