• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.507-512
• /
• 1992

This paper presents a method for the automatic generation of assembly sequences based on the recursive extraction of a preferred part along with the verification of its disassemblability. To verify the disassemblability of the part we inference the geometric precedence constraints using a method of extracting separable directions for the part and determine the disassemblability cost by the separability and stability cost. The proosed method provides a local optimal solution of finding a cost effective assembly plan, and the feasibility of calculating robot motion programs by evaluating separable directions in flexible manufacturing application. A case study is given to illustrate the concepts and procedure of the proposed scheme.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.22
• /
• pp.35-42
• /
• 1990

This paper deals with a single machine scheduling problem with a quadratic penalty function of completion times. The objective is to find a optimal sequence which minimizes the total penalty. A new type of node elimination procedure and precedence relation is developed that determines the ordering between adjacent jobs and is incorporated into a branch and bound algorithm. In addition, modified penalty function is considered and numerical examples are provided to test the effectiveness of the optimum algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3046-3070
• /
• 2017

Nowadays, the utilization of multiprocessor environments has been increased due to the increase in time complexity of application programs and decrease in hardware costs. In such architectures during the compilation step, each program is decomposed into the smaller and maybe dependent segments so-called tasks. Precedence constraints, required execution times of the tasks, and communication costs among them are modeled using a directed acyclic graph (DAG) named task-graph. All the tasks in the task-graph must be assigned to a predefined number of processors in such a way that the precedence constraints are preserved, and the program's completion time is minimized, and this is an NP-hard problem from the time-complexity point of view. The results obtained by different approaches are dominated by two major factors; first, which order of tasks should be selected (sequence subproblem), and second, how the selected sequence should be assigned to the processors (assigning subproblem). In this paper, a hybrid proposed approach has been presented, in which two different artificial ant colonies cooperate to solve the multiprocessor task-scheduling problem; one colony to tackle the sequence subproblem, and another to cope with assigning subproblem. The utilization of background knowledge about the problem (different priority measurements of the tasks) has made the proposed approach very robust and efficient. 125 different task-graphs with various shape parameters such as size, communication-to-computation ratio and parallelism have been utilized for a comprehensive evaluation of the proposed approach, and the results show its superiority versus the other conventional methods from the performance point of view.

• The Journal of Information Systems
• /
• v.22 no.3
• /
• pp.25-42
• /
• 2013

Recently various kinds of Information Technology services are created and the quantities of the data flow are increase rapidly. Not only that, but the data patterns that we deal with also slowly becoming diversity. As a result, the demand of discover the meaningful knowledge/information through the various mining analysis such as linkage analysis, sequencing analysis, classification and prediction, has been steadily increasing. However, solving the business problems using data mining analysis does not always concerning, one of the major causes of these limitations is there are some analyzed data can't accurately reflect the real world phenomenon. For example, although the time gap of purchasing the two products is very short, by using the traditional sequencing analysis, the precedence relationship of the two products is clearly reflected. But in the real world, with the very short time interval, the precedence relationship of the two purchases might not be defined. What was worse, the sequence of the purchase intention and the sequence of the purchase realization of the two products might be mutually be reversed. Therefore, in this study, an expanded sequencing analysis methodology has been proposed in order to reflect this situation. In this proposed methodology, the purchases that being made in a very short time interval among the purchase order which might not important will be notice, and the analysis which included the original sequence and reversed sequence will be used to extend the analysis of the data. Also, to some extent a very short time interval can be defined as the time interval, so an experiment were carried out to determine the varying based on the time interval for the actual data.

• Industrial Engineering and Management Systems
• /
• v.13 no.1
• /
• pp.52-66
• /
• 2014

Promotion of a closed-loop supply chain requires disassembly systems that recycle end-of-life (EOL) assembled products. To operate the recycling disassembly system, parts selection is environmentally and economically carried out with non-destructive or destructive disassembly, and the recycling rate of the whole EOL product is determined. As the number of disassembled parts increases, the recycling rate basically increases. However, the labor cost also increases and brings lower profit, which is the difference between the recovered material prices and the disassembly costs. On the other hand, since the precedence relationships among disassembly tasks of the product also change with the parts selections, it is also required to optimize allocation of the tasks in designing a disassembly line. In addition, because information is required for such a design, the recycling rate, profit of each part and disassembly task times take precedence among the disassembly tasks. However, it is difficult to obtain that information in advance before collecting the actual EOL product. This study proposes and analyzes an optimal disassembly system design using integer programming with the environmental and economic parts selection (Igarashi et al., 2013), which harmonizes the recycling rate and profit using recyclability evaluation method (REM) developed by Hitachi, Ltd. The first stage involves optimization of environmental and economic parts selection with integer programming with ${\varepsilon}$ constraint, and the second stage involves optimization of the line balancing with integer programming in terms of minimizing the number of stations. The first and second stages are generally and mathematically formulized, and the relationships between them are analyzed in the cases of cell phones, computers and cleaners.

• The Journal of Industrial Distribution & Business
• /
• v.8 no.6
• /
• pp.61-73
• /
• 2017

Purpose - Aviation control, navigation, and aircraft control in the air transportation area are very specialized. Each part is in progress for safety, efficiency, automation, and further. On the other hand co-work among each part including knowledge sharing has been inattentive for many reasons. The purpose of this research is to show how practicians and professionals in the air transportation area perceive the issue of knowledge sharing and to recall the necessity of knowledge sharing in the area. And we try to find ways to activate the knowledge sharing in the area. Research design, data, methodology - For the research, we inquired into whether practicians and professionals think knowledge sharing can effect safe aviation positively or not and what steps are necessary to activate knowledge sharing in the area. We adopted survey method using questionnaires for current practicians and interview for specialists. The survey and interview results were analyzed using regression analysis and AHP method. The interview for specialists and analyzing the results using AHP was to investigate what are the precedence factors to activate the knowledge sharing. Results - First, practicians perceive that knowledge sharing will affect aviation safe positively. Second objective knowledges such as, tower air traffic control procedure of aviation control area, flight principle and structure of aircraft control area, instrument landing system of navigation area, for knowledge sharing of each area were identified. Also the precedence factors such as, knowledge absorbability of personal factor, personal expectation of result of expectation factor, leadership of management of Structure factor, method of knowledge spread of application factor for knowledge sharing were found. Conclusions - Knowledge sharing for practicians and professionals in the aviation area is very important especially from the perspective of safety. However, for various many reasons including the environment of each special area that focusing on their own area, knowledge sharing has not been emphasized. We found that practicians in the area feel that knowledge sharing is necessary and helpful. For it, each practician's active participation is the most important and many ways such as chatting room to share knowledge are to be developed. And the organization culture should be changed to encourage knowledge sharing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.2
• /
• pp.59-68
• /
• 2002

In this paper, we compared and analyzed two new models of cyclic packet dropping algorithm, Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) with RIO. The ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. We modelled two cyclic packet drop algorithms and executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying the strict drop precedence policy, we get better performance on priority levels. The results show that two new algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than other algorithms.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.2
• /
• pp.642-648
• /
• 2016

As 3D solid modeling prevails, a range of applications have become possible and intensive research on the integration of CAD/CAM has been conducted. As a consequence, methods to recognize the machining features from CAD models have been developed. On the other hand, generating a machining sequence using the machining features is still a problem due to a combinatorial problem with a large number of machining features. This paper proposes a new method that utilizes the precedence constraints through which the number of the combinations is reduced drastically. This method can automatically generate machining sequences requiring the lowest amount of machining time. An airplane part was used to test the usefulness of the proposed method.

• Korean Journal of Construction Engineering and Management
• /
• v.13 no.5
• /
• pp.144-152
• /
• 2012

The reason why most scheduling softwares currently using at construction projects adopt PDM (Precedence Diagramming Method) is that it can express an overlapping relationship between activities. However, the overlapping relationships in PDM are represented only by combinations of four overlapping types that connect the start and finish points of two activities, therefore, PDM cannot express efficiently the relationships between any middle points of two activities if they should be represented. This research proposes the method of transforming the four overlapping types of PDM to the overlapping relationships of BDM(Beeline Diagramming Method), new networking technique, that can connect the inter-relationships at any middle points of two activities as well as express multiple overlapping relationships. The proposed method will help not only to improve an efficiency of scheduling but also to upgrade the scheduling technique because BDM technique has a lot of unique advantages in scheduling.

• Journal of Korea Port Economic Association
• /
• v.25 no.1
• /
• pp.169-190
• /
• 2009

In order to establish whether any charterparty terms are incorporated into the bill of lading, the first necessity is to specify the charterparty alluded to the incorporation clause in the bill of lading. However, this becomes a potential problem where the date of a charterparty is not inserted on the face of the bill of lading in case a vessel is in operation under a number of charterparties. Over many years this issue has frequently been raised before the English courts, but it is still causing problems. The purpose of this study is to examines the several English authorities which dealt with the issue relating to the specification of charterparty incorporated into the bill of lading and to present some interpretation rules and the order of priority. As a result, the comparative analysis of English authorities shows that they failed to give dear guidance on this issue. This article therefore suggests four interpretation rules such as the precedence of a B/L's face, the rule of appositeness, surrounding circumstances, the contra proferentem rule and shows that the precedence of a B/L's face is most applicable for all parties.