• Journal of the Korea Society of Computer and Information
• /
• v.26 no.9
• /
• pp.143-153
• /
• 2021

In this paper, we propose "flexible routing with flex" to provide fast delivery by using the flexible routing for the delivery vehicle and crowd-shipper named flex. To this end, we have introduced an algorithm that can build the delivery plan for delivery vehicles and flexes. The introduced algorithm uses the 2-opt algorithm to construct routes with low complexity and acceptable quality, and the revised saving algorithm to assign customer orders to the flex. The algorithm allows the vehicle and the flex to function complement each other without separating the delivery vehicle from the flex. The experiments consider the 3 different instances named Random, Mixed, Cluster, and show that "the flexible routing with flex" has a better result than "vehicle only". The sensitivity analysis of the flex cost and time penalty shows "the flexible routing with flex" can provide better service not only to the customers who are serviced by flex but also to the customers who are serviced by the delivery vehicle.

• Journal of the Korean Society of Industry Convergence
• /
• v.4 no.3
• /
• pp.281-287
• /
• 2001

Traditional job shop scheduling is supposed that machine has a fixed processing job type. But actually the machine has a highly utilization or long processing time is occurred delay. Therefore product system is difficult to respond quickly to the change of products or loads or machine failure etc. Here we use flexible job shop which is supposed that a machine has several jobs by tool change. The heuristic for the flexible job shop scheduling has to solve two problems. One is a routing problem which is determine a machine to process job. The other is sequencing problem which is determine processing sequence. The approach to solve two problems arc a hierarchical approach which is determined routing and then schedule, and a concurrence approach which is solved concurrently two problems by considering routing when it is scheduled. In this study, we simulate for flexibility efficiency fo flexible job shop scheduling with machine failure using hierarchical approach.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.2
• /
• pp.140-150
• /
• 1995

A symbolic layout generator, called Flexible Module Generator (FMG), has been developed for transgorming a given CMOS circuit netlist into an optimized symbolic layout. Contrary to other conventional module generators which place transistors either in horizontal or in vertical direction, FMG places transittors in any hence can multiples of 90$^{\circ}$. This flexible layout style can maximize the diffusion sharing and hence can reduce the wire-length for both of area minimization and performance improvement. In FMG, transistors are initially randomly placed and then selected transistors are iteratively replaced using an optimization technique based on simulated evolution. Whenever a transistor is replaced, the affected nets are rerouted. Constraints on the shape, aspect ratio, and critical path delays are considered during the optimization process. Routing is performed by using a modified maze router on polysilicon, metal 1, and metal 2 interconnection layers. additional routing grids are added, if necessary, for complete routing. Unused rows or columns are removed after routing for area minimization. Experimental reasults show that FMG synthesizes satisfactory layouts.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.475-478
• /
• 2004

Tool costs can comprise a significant part of the total operating costs of Flexible Manufacturing Systems. We address the problem of determining the optimal processing times of individual operations and routing mix in FMSs with multiple routes for each part type in order to minimize tool cost, subject to meeting a throughput constraint for each part type. The problem is formulated as a nonlinear program superimposed on a closed queueing network of the FMSs under consideration. Numerical examples reveal the potential of our approach for significant saving in tool costs.

• Journal of Korean Institute of Industrial Engineers
• /
• v.30 no.4
• /
• pp.328-337
• /
• 2004

Tool costs can comprise a significant part of the total operating costs of Flexible Manufacturing Systems. We address the problem of determining the optimal processing times of individual operations and routing mix in FMSs with multiple routes for each part type in order to minimize tool cost, subject to meeting a throughput constraint for each part type. The problem is formulated as a nonlinear program superimposed on a closed queueing network of the FMSs under consideration. Numerical examples reveal the potential of our approach for significant saving in tool costs.

• Journal of Korean Institute of Industrial Engineers
• /
• v.15 no.1
• /
• pp.23-30
• /
• 1989

The routing flexibility in FMSs can be achieved through two levels : the parallel operations and the alternative stations. To accommodate this pertaining flexibility for part routing in FMSs, a hierarchical routing principle is developed which considers both the routing flexibility and the performance effectiveness, which can also be easily implemented. For the proper implementation of this routing algorithm, the required information flow is identified which turns out to be very simple.

• IE interfaces
• /
• v.17 no.2
• /
• pp.208-217
• /
• 2004

This paper deals with a process planning problem in the flexible assembly system (FAS). The problem is to assign assembly tasks to stations with limited working space and to determine assembly routing with the objective of minimizing transfer time of the products among stations, while satisfying precedence relations among the tasks and upper-bound workload constraints for each station. In the process planning of FAS, the optimality of assembly routing depends on tasks loading. The integration of tasks loading and assembly routing is therefore important for an efficient utilization of FAS. To solve the integrated problem at the same time, in this paper we propose a new method using an artificial intelligent search technique, named 2-leveled symbiotic evolutionary algorithm. Through computational experiments, the performance of the proposed algorithm is compared with those of a traditional evolutionary algorithm and a symbiotic evolutionary algorithm. The experimental results show that the proposed algorithm outperforms the algorithms compared.

• ETRI Journal
• /
• v.41 no.4
• /
• pp.452-464
• /
• 2019

The use of wireless body area networks (WBANs) in healthcare applications has made it convenient to monitor both health personnel and patient status continuously in real time through wearable wireless sensor nodes. However, the heterogeneous and complex network structure of WBANs has some disadvantages in terms of control and management. The software-defined network (SDN) approach is a promising technology that defines a new design and management approach for network communications. In order to create more flexible and dynamic network structures in WBANs, this study uses the SDN approach. For this, a WBAN architecture based on the SDN approach with a new energy-aware routing algorithm for healthcare architecture is proposed. To develop a more flexible architecture, a controller that manages all HUBs is designed. The proposed architecture is modeled using the Riverbed Modeler software for performance analysis. The simulation results show that the SDN-based structure meets the service quality requirements and shows superior performance in terms of energy consumption, throughput, successful transmission rate, and delay parameters according to the traditional routing approach.

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

With the advances in concurrent engineering, schedulability has become an important design issue in machine loading and routing procedure. In this paper, four rules to improve schedulability of loading and routing are formulated as a mixed-integer programming model based on machine, routing and tool flexibilities. In this model, these rules are represented as an objective function or constraints. The impact of rules on the quality of schedules for the result of loading and routing is measured with makespan, throughput and average machine utilization.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.6
• /
• pp.1034-1039
• /
• 1987

In this paper, an automatic routing algorithm using Fringe is described. The concept of the Fringe is very simple, but it provides a powerful and flexible tool for doing single layer routing. The automatic routing program is coded using C language, and implemented on a VAX11/750 and IBM -PC AT computer. The usefulness of the routing algorithms is shown by the execution of the program on some examples.