• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.1
• /
• pp.15-39
• /
• 2009

Advanced planning and scheduling (APS) refers to a manufacturing management process by which raw materials and production capacity are optimally allocated to meet demand. APS is especially well-suited to environments where simpler planning methods cannot adequately address complex trade-offs between competing priorities. However, most scheduling problems of APS in the real world face both inevitable constraints such as due date, capability, transportation cost, set up cost and available resources. In this survey paper, we address three crucial issues in APS, including basic scheduling model, job-shop scheduling (JSP), assembly line balancing (ALB) model, and integrated scheduling models for manufacturing and logistics. Several evolutionary algorithms which adapt to the problems are surveyed and proposed; some test instances based on the practical problems demonstrate the effectiveness and efficiency of evolutionary approaches.

• Journal of the Society of Naval Architects of Korea
• /
• v.51 no.3
• /
• pp.239-245
• /
• 2014

This paper deal with the block storage planning problem of storing and retrieving assembly blocks in a temporary storage yard with limited capacity, which is one of the critical managerial problems in shipbuilding. The block storage planning problem is required to minimize the number of relocations of blocks while the constraints for storage and retrieval time windows are satisfied. We first show NP-hardness of the block storage planning problem. Next we propose a heuristic algorithm to generate good quality solutions for larger instances in very short computational time. The proposed heuristic algorithm was validated by comparing the results with the mathematical model presented in the previous study.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.55.6-55
• /
• 2002

Huafei Liao is a graduate student of the Automation department in Tsinghua University, China. His research involves computer-aided process planning, 3D CAD/CAM, virtual reality, and feature recognition.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2009.10a
• /
• pp.731-732
• /
• 2009

• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.1
• /
• pp.1-17
• /
• 1993

It is well known that an assembly operation is usually constrained by the geometric interference between parts. These constraints are normally presented as AND/OR precedence relationships. To find a feasible assembly sequence which satisfies the geometric constraints is not an easy task because of the TSP(Traveling Salesman Problem) nature with precedence constraints. In this paper, we developed an automated system based on Neural Network for generating feasible assembly sequences. Modified Hopfield and Tank network is used to solve the problem of AND/OR precedence-constrained assembly sequences. An economic assembly sequence can be also obtained by applying the cost matrix that contains cost-reducing factors. To evaluate the performance and effectiveness of the developed system, a case of automobile generator is tested. The results show that the developed system can provide a "good" planning tool for an assembly planner within a reasonable computation time period.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.223-223
• /
• 1998

• International conference on construction engineering and project management
• /
• 2020.12a
• /
• pp.63-74
• /
• 2020

The assembly of modular construction requires a series of thoroughly-considered decisions for crane lifting including the crane model selection, crane location planning, and lift path planning. Traditionally, this decision-making process is empirical and time-consuming, requiring significant human inputs. Recently, research efforts have been dedicated to improving lift planning practices by leveraging cutting-edge technologies such as automated data acquisition, Building Information Modelling (BIM) and computational algorithms. It has been demonstrated that these technologies have advanced lift planning to some degree. However, the advancements tend to be fragmented and isolated. There are two hurdles prevented a systematic improvement of lift planning practices. First, the lack of formalized lift planning workflow, outlining the procedure and necessary information. Secondly, there is also an absence of a shared information environment, enabling storages, updates and the distribution of information to stakeholders in a timely manner. Thus, this paper aims to overcome the hurdles. The study starts with a literature review in combination with document analysis, enabling the initial workflow and information flow. These were contextualised through a series of interviews with Australian practitioners in the crane-related industry, and systematically analysed and schematically validated through an expert panel. Findings included formalized workflow and corresponding information exchanges in a traditional lift planning practice via a Business Process Model and Notation (BPMN). The traditional practice is thus reviewed to identify opportunities for further enhancements. Finally, a BIM-based lift planning workflow is proposed, which integrates the scattered technologies (e.g. BIM and computational algorithms) with the aim of supporting lift planning automation. The resulting framework is setting out procedures that need to be developed and the potential obstacles towards automated lift planning are identified.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.133-149
• /
• 1997

The major two steps required to design a cellular layout are cell formation and cell layout. Because of the differences between manufacturing and assembly operations, the logic of cell formation and cell layout between an FMS and an FAS is not the same. Since the time for the assembly operations is usualaly relatively short, the transfer time is thus very crucial for the performance of assembly systems. Transfore in a cellular FAS it is more important to eliminate backtracking operations in assembly planning, not to allow intercellular movements in cell formation, and to arrange machines according to assembly sequence in cell layout. This study presents a method for the integrated layout design in cellular FASs considering the characteristics of FAS, layout, and production factors.