• Management Science and Financial Engineering
• /
• v.1 no.1
• /
• pp.67-90
• /
• 1995

In planning an assembly system, choosing the proper assembly sequence is one of the most important decisions because it significantly affects the costs associated with the assembly process. This paper deals with the selection of assembly sequences in flexible assembly systems. The selection criterion is the minimization of makespan to complete all assembly products. This problem is formulated as a "modified FAS scheduling problem" (MFASSP) and its scheduling procedure is described. The experimental results show that the procedure is very efficient for both quality of solution and computation time.

• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.25-34
• /
• 2007

This paper is concerned with proving a conjecture that the two stage assembly system is reversible in deterministic makespan scheduling context. The reversibility means that a job sequence in the assembly system has the same makespan as that of its reverse sequence in the disassembly system which is the reversal of the assembly system. The proposed conjecture shows that the reversibility of serial flowshops can be extended to non-serial and synchronized shops.

• Genomics & Informatics
• /
• v.7 no.1
• /
• pp.46-48
• /
• 2009

Finishing is the most time-consuming step in sequencing, and many genome projects are left unfinished due to complex repeat regions. Here, we have developed BACContigEditor, a prototype shotgun sequence finishing tool. It is essentially an editor that visualizes assemblies of shotgun sequence fragment reads as gapped multiple alignments. The program offers some flexibility that is needed to rapidly resolve complex regions within a working session. The sole purpose of the release is to promote collaborative creation of extensible software for fragment assembly editors, foster collaborative development, and reduce barriers to initial tool development effort. We describe our software architecture and identify current challenges. The program is available under an Open Source license.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.1
• /
• pp.35-41
• /
• 2010

In order to improve the productivity and the yield at assembling line of finished goods' manufacturers, it is necessary that the fabricated parts are supplied to the assembly line not only just in time (JIT) but also just in sequence (JIS). Parts that are not delivered just in time can cause assembly line to be delayed, and parts that are not delivered just in sequence can cause assembly line to be halted or defected products. For JIT and JIS implementation, in the paper we propose the smart pallet based just-in-sequence parts delivery system in which RFID and USN technologies are converged. Compared with the bar-code based just-in-sequence parts delivery system, the proposed system can reduce unnecessary time for confirming parts' type and sequence and unnecessary cost by bar-code labeling and sequence data' documenting. The proposed system also can overcome the drawbacks of the RFID based just-in-sequence parts delivery system such as transmission range limit and difficulties of confirming parts' type and sequence in real time. Finally, we show the implementation of the proposed system, and its practicality.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.13-27
• /
• 1996

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.175-178
• /
• 2000

BOM has been widely used to manufacturing, product design and scheduling. There are several bug differences between Manufacturing BOM and Engineering BOM, which cause a lot of problems. A study to integrate both manufacturing BOM and Engineering BOM is researching to solve those problems. This thesis presents a extended Engineering BOM concepts considering assembly sequence model.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2450-2452
• /
• 2003

We present a method to increase the productivity of multihead-gantry chip mounters for PCB assembly lines. To minimize the assembly time, we generate the mount sequence using the genetic algorithm. The chromosome, fitness function, and operators are newly defined to apply the algorithm. Simulation results are presented to verified the usefulness of the method.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.15 no.1
• /
• pp.70-75
• /
• 2006

This paper represents a study on disassembly sequence generation system for automobile parts. This system is practically very useful because proper disassembly sequence of end-of-life product becomes crucial as take-back obligations are imposed for environmental reasons. Therefore a disassembly sequence generation system is suggested to automatically derive all the feasible disassembly sequences from the assembly modeling files. As a result, in consideration of the all parts and subassemblies the optimum disassembly sequence is generated. And the optimum disassembly sequence for a certain part or subassembly can be also suggested.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.6
• /
• pp.506-513
• /
• 2000

This paper proposes a path planning algorithm for dispensers to increase the productivity in printed circuit board assembly lines. We analyze the assembly sequence of the dispenser, and formulate it as an integer programming problem. The mathematical formulation can accomodate multiple heads and different types of heads through extended cost matrix. The TSP algorithms are then applied to the formulated problem to find the near-optimal solution. Simulation results are presented to verify the usefulness of the proposed scheme.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.192-199
• /
• 2007

This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.