• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.51-61
• /
• 1991

This paper presents a heuristic method for the Assembly Line Balancing(ALB) of the large-sized product. In the ALB problem of the large-sized product such as bus and truck, the assignments of the Related Task Groups(RTG), the same side tasks, and team tasks should be considered. In this paper, a new concept of the RTG and two kinds of assignment rules are proposed to resolve the above considerations. The first assignment rule allots the RTG with the constraint of the same side tasks to the station while the second allots the RTG to the station, relaxing the above constraint to increase the applicability of the method. An assignment rule for team tasks is also presented. The benefits of the method are to improve work methods, to give more job satisfaction to workers, and to allow greater flexibility in the design of assembly lines.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.59-65
• /
• 2010

This paper proposes a modified heuristic mixed model assembly line (MMAL) balancing algorithm that provides consistent station assignments on a model by model basis as well as on a station by station. Basically, some of single model line balancing techniques are modified and incorporated to be fit into the MMAL. The proposed algorithm is based on N.T. Thomopoulos' [8] method and supplemented with several well proven single model line balancing techniques proposed in the literature until recently. Hoffman's precedence matrix [2] is used to indicate the ordering relations among tasks. Arcus' Rule IX [1] is applied to generate rapidly a fairly large number of feasible solutions. Consequently, this proposed algorithm reduces the fluctuations in operation times among the models as well as the stations and the balance delays. A numerical example shows that the proposed algorithm can provide a good feasible solution in a relatively short time and generate relatively better solutions comparing to other three existing methods.

• Journal of Information Technology Applications and Management
• /
• v.9 no.3
• /
• pp.13-30
• /
• 2002

ebXML (Electronic Business using extensible Markup language), sponsored by UN/CEFACT and OASIS, is a modular suite of specifications that enables enterprises of any size and in any geographical location to conduct business over the Internet. Using ebXML, companies now have a standard method to exchange business messages, conduct trading relationships, communicate data In common terms and define and resistor business processes. It is the mission of ebXML that provides an open XML-based infrastructure enabling the global use of electronic business information in an interoperable, secure and consistent manner by all parties for creating a single e1ectronic electronic market. This paper briefly overviews the concept of core component, context, assembly rule and context rule. Then, It designs by standard specifications of ebXML core component commonly used in an industry and among industries, and assembles business messages by using XML schema. Therefore, it suggests the mechanism which effectively exchanges business messages among the trading partners. This paper designs core component by using only three business messages of retail industry : orders, dispatch report, sales report.

• Journal of Korean Institute of Industrial Engineers
• /
• v.41 no.4
• /
• pp.330-337
• /
• 2015

A bucket-brigade is a way of transporting items where items are passed from one person to the next. The operation of the bucket brigade imitates the cooperative behavior of ants when brood, food or other resources are moved. Koo (2009) presented a bucket brigade-based assembly cell where each worker follows a simple rule: perform assembly operations on a product until the next worker downstream takes it over; then go back to the previous worker upstream to take over a new assembly job. In this way, the flow line is self-balanced without any predetermined job assignment. However, there are some productivity losses related to hand-off and blocking. This paper examines the hand-off and blocking losses and presents a new bucket brigade-based assembly cell where working areas for each assembler is restricted with the help of buffer interfaces. Simulation experiments are used to validate the performance of the new assembly system.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.517-522
• /
• 2005

This paper addresses scheduling heuristics for an assembly job-shop that includes at least an assembly process throughout its processes. The assembly job shop has certain characteristics not only considering the precedence relationship between the processes but also considering the processing progress between the parts. In addition, it probably presents a different processing time for the same product according to the order of processes and the point of workable time, due to the difference in the availability of equipments. The paper proposes several priority-based dispatching rules that consider these characteristics of the assembly job-shop, aiming to minimize the total tardiness of products in the shop floor. Computational tests showed that job due date based priority rules significantly outperform existing priority rules in terms of total tardiness.

• Journal of KIBIM
• /
• v.12 no.1
• /
• pp.10-22
• /
• 2022

Prefabricated bridges require strict management of tolerance during fabrication and assembly. In this paper, digital engineering models for prefabricated bridge components such as deck, girder, pier, abutment are suggested to support information delivery through the life-cycle of the bridge. Rule-based modeling is used to define geometry of the members considering variable dimensions due to fabrication and assembly error. DfMA(design for manufacturing and assembly) provides the rules for ease of fabrication and assembly. The digital engineering model consists of geometry, constraints and corresponding parameters for each phase. Alignment and control points are defined to manage tolerances of the prefabricated bridge during fabrication and assembly. Quality control by digital measurement of dimensions was also considered in the model definition. A pilot bridge was defined virtually to validate the suggested digital engineering models. The digital engineering models for DfMA showed excellent potential to realize prefabricated bridges.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2007.06a
• /
• pp.433-434
• /
• 2007

• IE interfaces
• /
• v.12 no.4
• /
• pp.617-624
• /
• 1999

In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider a scheduling problem for assembly machine in ship engine assembly shop. This paper considers the parallel machine scheduling problem in which n jobs having different release times, due dates and space limits are to be scheduled on m parallel machines. The objective function is to minimize the sum of earliness and tardiness. To solve this problem, a heuristic is developed. The proposed heuristic is divided into three modules hierarchically: job selection, machine selection and job sequencing, solution improvement. To illustrate its effectiveness, a proposed heuristic is evaluated with a large number of randomly generated test problems based on the field situation. Through the computational experiment, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.10a
• /
• pp.307-309
• /
• 1996

This paper analyses a deterministic scheduling problem concerned with manufacturing two types of components at a pre-assembly stage which consists of two independent feeding machines each producing its own type of component. Each type represents a unique component which may have variations in its size or quality. Therefore, the completion time of each component depends on both its type and quality (size) variations. Such manufactured components are subsequently assembled into various component dependent products. The problem has the objective measure of minimizing the total weighted completion time of a finite number of jobs(products) where the completion time of each job is measured by the latest completion time of its two components at the pre-assembly stage. The problem is shown to be NP-complete in the strong sense. A WSPT rule coupled with a machine-aggregation idea is developed for good heuristics which show the error bound of 2.

• IE interfaces
• /
• v.4 no.2
• /
• pp.81-92
• /
• 1991

A study showed that the two most important obstacles to assembly automation were that product designs are generally not assembly oriented and that most components cannot be handled automatically without problems. In the view of the importance of well designed product with high assemblability, a tool must be developed to pre-evaluate a product during design phase whether it can be assembled with minimum efforts. In this research, a prototype expert system for DFA has been developed that can be used to advise the designer of difficulties that his/her design presents for automatic handling during manufacture. This rule-based system has been implemented on an IBM personal computer, using the Texas Instruments' Personal Consultant Plus.