• The Journal of Asian Finance, Economics and Business
• /
• 제9권5호
• /
• pp.239-250
• /
• 2022

A business's Enterprise Resource Planning (ERP) solution is software that fully integrates the services that businesses require, continuously updates business processes and department operations in real-time, and so aids in the successful management of enterprise resources. Previously, ERP solutions were often deployed for large enterprises, but along with the strong digital transformation process, many small and medium enterprises have been deploying Cloud ERP (CERP) solutions. The objective of the study is to measure the factors affecting the successful implementation of CERP solutions at small and medium enterprises and the impact of successful implementation of CERP solutions on business process re-engineering and enterprise performance. Using a quantitative method based on data collected from 230 small and medium enterprises in Vietnam that have been implementing CERP solutions, the results show that there are 5 factors affecting, which are Organizational ERP Strategic, Top management Commitment, Data Security, Training in ERP Projects, Organizational Culture. Research results also show that Successful implementation of CERP has a direct impact on business process re-engineering and business performance. Based on the results, the study has made a number of policy implications in the successful implementation of CERP towards re-engineering business processes to improve the performance of small and medium enterprises.

• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.43-58
• /
• 1998

Packet switch is a key component in high speed digital networks. This paper investigates congestion phenomena in the packet switching with input buffers. For large value of switch size N, mathematical models have been developed to analyze asymptotic maximum switch throughput under nonuniform traffic. Simulation study has also been done for small values of finite N. The rapid convergence of the switch performance with finite switch size to asymptotic solutions implies that asymptotic analytical solutions approximate very closely to maximum throughputs for reasonably large but finite N. Numerical examples show that non-uniformity in traffic pattern could result in serious degradation in packet switch performance, while the maximum switch throughput is 0.586 when the traffic load is uniform over the output trunks. Window scheduling policy seems to work only when the traffic is relatively uniformly distributed. As traffic non-uniformity increases, the effect of window size on throughput is getting mediocre.

• Industrial Engineering and Management Systems
• /
• 제14권1호
• /
• pp.11-21
• /
• 2015

The purpose of this research is to develop algorithms using the Differential Evolution Algorithm (DE) to solve a multi-objective, sources and stages location-allocation problem. The development process starts from the design of a standard DE, then modifies the recombination process of the DE in order improve the efficiency of the standard DE. The modified algorithm is called modified DE. The proposed algorithms have been tested with one real case study (large size problem) and 2 randomly selected data sets (small and medium size problems). The computational results show that the modified DE gives better solutions and uses less computational time than the standard DE. The proposed heuristics can find solutions 0 to 3.56% different from the optimal solution in small test instances, while differences are 1.4-3.5% higher than that of the lower bound generated by optimization software in medium and large test instances, while using more than 99% less computational time than the optimization software.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 한국전산구조공학회 1999년도 봄 학술발표회 논문집
• /
• pp.42-49
• /
• 1999

Because the linear elastic tincture analysis has been proved to be insufficient in predicting the failure of cracked bodies, in recent years, a number of fracture concepts have been studied which remain applicable in the presence of large-scale plasticity near a crack tip. This work thereby presents a new finite element model, as accurate as possible, to analyze plane problems of ductile fracture under large-scale yielding conditions. Based on the incremental theory of plasticity, the p-version finite element analysis is employed to account for the values of J-integral, the most dominant fracture parameter, and the shape of plastic zone near a crack tip by using the J-integral method and equivalent domain integral method. The numerical results by the proposed model are compared with the theoretical solutions in literatures and the numerical solutions by the i,-version of F.E.M.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• 제30권8호
• /
• pp.1008-1015
• /
• 2006

Based on three-dimensional (3-D) FE limit analyses, this paper provides plastic limit, collapse and instability load solutions for pipe bends under combined pressure and in-plane bending. The plastic limit loads are determined from FE limit analyses based on elastic-perfectly plastic materials using the small geometry change option, and the FE limit analyses using the large geometry change option provide plastic collapse loads (using the twice-elastic-slope method) and instability loads. For the bending mode, both closing bending and opening bending are considered, and a wide range of parameters related to the bend geometry is considered. Based on the FE results, closed-form approximations of plastic limit and collapse load solutions for pipe bends under combined pressure and bending are proposed.

• Journal of the Korea Society of Computer and Information
• /
• 제23권3호
• /
• pp.49-54
• /
• 2018

A data warehouse is a system that collectively manages and integrates data of a company. And provides the basis for decision making for management strategy. Nowadays, analysis data volumes are reaching critical size challenging traditional data ware housing approaches. Current implemented solutions are mainly based on relational database that are no longer adapted to these data volume. NoSQL solutions allow us to consider new approaches for data warehousing, especially from the multidimensional data management point of view. In this paper, we extend the data warehouse design methodology based on relational database using star schema, and have developed a consistent design methodology from information requirement analysis to data warehouse construction for large scale data warehouse construction based on MongoDB, one of NoSQL.

• Journal of Korean Institute of Industrial Engineers
• /
• 제9권1호
• /
• pp.23-31
• /
• 1983

A group scheduling problem, which is production scheduling problem associated with the concept of group technology, is studied under due date constraints in multi-stage manufacturing systems. The purpose of this paper is to develop and evaluate a practical heuristic procedure for determining group sequence and job sequence within each group to minimize total tardiness in multi-stage manufacturing systems. A heuristic algorithm has been developed by introducing the concept of relative measures of job tardiness and group tardiness for job sequencing and group sequencing, respectively. A numerical example is shown to illustrate the proposed procedure. The heuristic algoirthm is tested by comparisons with problems with known optimal solutions and also with random group schedules for a set of large-size problems. Results indicate that the proposed heuristic algorithm provides good solutions with small computational requirements, and thus is viable for large size problems in practice.

• Journal of Korean Institute of Industrial Engineers
• /
• 제24권3호
• /
• pp.417-429
• /
• 1998

This paper considers two-sided (left and right side) assembly lines which are often used, especially in assembling large-sized products such as trucks and buses. A large number of exact algorithms and heuristics have been proposed to balance one-sided lines. However, little attention has been paid to balancing two-sided assembly lines. We present an efficient algorithm based on a branch and bound for balancing two-sided assembly lines. The algorithm involves a procedure for generating an enumeration tree. To efficiently search for the near optimal solutions to the problem, assignment rules are used in the method. New and existing bound strategies and dominance rules are else employed. The proposed algorithm can find a near optimal solution by enumerating feasible solutions partially. Extensive computational experiments are carried out to make the performance comparison between the proposed algorithm and existing ones. The computational results show that our algorithm is promising and robust in solution quality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권10호
• /
• pp.4054-4071
• /
• 2015

Named-Data Networking (NDN) is one of the promising approaches for the Future Internet to cope with the explosion and current usage pattern of Internet traffic. Content provider mobility in the NDN allows users to receive real-time traffic when the content providers are on the move. However, the current solutions for managing these mobile content providers suffer several issues such as long handover latency, high cost, and non-optimal routing path. In this paper, we survey main approaches for provider mobility in NDN and propose an optimal scheme to support the mobile content providers in the large-scale NDN domain. Our scheme predicts the movement of the provider and uses state information in the NDN forwarding plane to set up an optimal new routing path for mobile providers. By numerical analysis, our approach provides NDN users with better service access delay and lower total handover cost compared with the current solutions.

• Journal of Korea Multimedia Society
• /
• 제11권12호
• /
• pp.1688-1696
• /
• 2008

We propose a hierarchical service management method using Bloom filters for large MANETs. In this paper, a MANET is comprised of logical grid hierarchy, and each mobile node within the lowest service region multicasts the Attenuated Bloom Filter (ABF) for services itself to other nodes within the region. To advertise and discovery a service efficiently, the server node of the lowest server region sends the Summary Bloom Filter (SBF) for the ABFs to the server node of upper server region. Each upper server has the set of SBFs for lower vicinity service regions. The traffic load of the proposed method is evaluated by an analytical model, and is compared with that of two alternative advertisement solutions: complete advertisement and no advertisement. As a result, we identify that the traffic load of the proposed method is much lower than that of two alternative advertisement solutions.