• Title/Summary/Keyword: 작업 할당 문제

Search Result 106, Processing Time 0.017 seconds

Optimization of green closed loop supply chain network considering recycling express box (재활용 익스프레스 박스를 고려한 친환경 폐쇄 루프 공급망 네트워크 최적화)

  • Zhang, Jun-Hao;Che, Jin-Yao
    • Journal of Digital Convergence
    • /
    • v.20 no.5
    • /
    • pp.211-220
    • /
    • 2022
  • This paper proposes a green closed-loop supply chain network (GCSN) for optimizing closed-loop supply chains. The GCSN focuses on the application of the recycling express box in logistics circulation, accelerates the standardization of logistics operations and the use of express packaging in e-commerce companies, and promotes the reduction and greening of recycling express box in the e-commerce industry. The GCSN is represented as a mathematical formulation and implemented using LINGO. Greening, environmental protection, and wisdom are the general trends for promoting the growth of the e-commerce industry. Meanwhile, the price of raw materials has increased owing to a shortage of resources, which emphasizes the need for e-commerce enterprises to develop green packaging. Therefore, this study considers the shared circular packaging launched by e-commerce enterprises as the research object, and integrates the problem of facility positioning and path planning in the logistics system. The conclusion summarizes the significance of this study.

The Allocation Precedence of the Limited Same Resource to the Concurrent Activities under Multiple Criteria (다기준하 동일 한정 자원의 배당 우선순위 결정)

  • Hwang, Jin-Ha
    • Korean Journal of Construction Engineering and Management
    • /
    • v.9 no.5
    • /
    • pp.159-167
    • /
    • 2008
  • This study provides a effective approach to the construction management problem with the limited number or amount of available resources using the analytic hierarchy process. Construction management is a series of decision making processes for planning and controling of cost, time and quality as main objectives in construction works. When several activities need the limited same resource at the same time, it is very hard to decide the priority of the activities in the real situations. For that the scientific decision making method and procedure for resource allocation are required. This study solves the resource allocation problem by dealing with the decision making problem which the activities are distributed to multiple projects and under multiple criteria. The analytic hierarchy process is a method devised to solve complex multi-criteria decision problems. The result shows that this study can be effectively used to make decisions in situations involving multiple objectives by evaluating the prioritized ranking and degree of the activity alternatives based on the overall preferences.

Efficient Parallel Spatial Join Processing Method in a Shared-Nothing Database Cluster System (비공유 공간 클러스터 환경에서 효율적인 병렬 공간 조인 처리 기법)

  • Chung, Warn-Ill;Lee, Chung-Ho;Bae, Hae-Young
    • The KIPS Transactions:PartD
    • /
    • v.10D no.4
    • /
    • pp.591-602
    • /
    • 2003
  • Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

An Efficient Mobile Transaction Processing Scheme over Multiple Wireless Broadcast Channels (다중 무선 방송채널에서의 효과적인 모바일 트랜잭션 처리 기법)

  • Jeong, Ho-Ryun;Jung, Sung-Won;Park, Sung-Wook
    • Journal of KIISE:Databases
    • /
    • v.35 no.3
    • /
    • pp.257-271
    • /
    • 2008
  • Wireless broadcast environments has character that a number of mobile client can receive data streaming from central server no matter how they are so many. Because it is asymmetric bandwidth in that uplink and downlink bandwidth are different. This advantage helps wireless broadcast environments is used in many applications. These applications work almost read operation and need control concurrency using transaction unit. Previous concurrency control scheme in single channel is not adapted in multi channel environments because consistency of data are broken when a mobile client tunes in a broadcast cycle in a channel and then move into another channel and listen to different broadcast cycle with already accessed broadcast cycle. In this paper, we propose concurrency control for read-only mobile transactions in multiple wireless broadcast channel. First of all, we adapt index and data dedicated channel and propose LBCPC(Longest Broadcast Cycle Per Channel) as new unit of consistency. In index dedicated channel, it is repeatedly broadcasted data in same BCPC(Broadcast Cycle Per Channel) until LBCPC. And mobile transaction executes validation using control information every LBCPC. As a result, consistency of data is kept and average response time is shorter than one in single channel because waiting time for restart reduces. And as control information is broadcasted more frequently than in single channel, it is guaranteed currency about data accessed by transaction. Finally, according to the simulation result, we verify performance of our scheme in multi channel as comparing average response time with single channel.

Case Study of Establishing and Operating Maker Space in A Developing Country - Focusing on iTEC Tech-shop in Tanzania - (개발도상국 메이커 스페이스 구축 및 운영 사례 - 탄자니아 iTEC 테크샵을 중심으로 -)

  • Im, Hyuck-Soon;Jung, Woo-Kyun;Ngajilo, Tunu Y.;Meena, Okuli;Lee, Ahnna;Ahn, Sung-Hoon;Rhee, Hyop-Seung
    • Journal of Appropriate Technology
    • /
    • v.6 no.2
    • /
    • pp.126-135
    • /
    • 2020
  • Recently, with the development of the 4th Industrial Revolution era and the popularization of technologies the maker movement is spreading worldwide in various ways for education, entrepreneurship, and solving social problems. This paper introduces a case of establishing and operating a maker space in Tanzania, East Africa, one of the developing countries. iTEC Tech-shop was established in the first half of 2018 at the Nelson Mandela African Institution of Science and Technology (NM-AIST) in Arusha, Tanzania by Innovative Technology and Energy Center (iTEC), and has been operating for nearly two years. With the allocation of empty warehouse space from NM-AIST, physical facilities were established through the purchase and installation of equipment and hand tools. Based on the advice from Idea Factory of Seoul National University and Fab-Lab Seoul, iTEC Tech-shop operational system were established. Through a total of 7 technical workshops, iTEC Tech-shop provided training courses for about 180 local personnel. In addition, the smart Techshop test-bed project was promoted in order to improve the operation level along with securing sustainability of the Techshop. The case of the iTEC Tech-shop could be a useful case for institutions or organizations promoting the maker movement to developing countries.

Technique to Reduce Container Restart for Improving Execution Time of Container Workflow in Kubernetes Environments (쿠버네티스 환경에서 컨테이너 워크플로의 실행 시간 개선을 위한 컨테이너 재시작 감소 기법)

  • Taeshin Kang;Heonchang Yu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.13 no.3
    • /
    • pp.91-101
    • /
    • 2024
  • The utilization of container virtualization technology ensures the consistency and portability of data-intensive and memory volatile workflows. Kubernetes serves as the de facto standard for orchestrating these container applications. Cloud users often overprovision container applications to avoid container restarts caused by resource shortages. However, overprovisioning results in decreased CPU and memory resource utilization. To address this issue, oversubscription of container resources is commonly employed, although excessive oversubscription of memory resources can lead to a cascade of container restarts due to node memory scarcity. Container restarts can reset operations and impose substantial overhead on containers with high memory volatility that include numerous stateful applications. This paper proposes a technique to mitigate container restarts in a memory oversubscription environment based on Kubernetes. The proposed technique involves identifying containers that are likely to request memory allocation on nodes experiencing high memory usage and temporarily pausing these containers. By significantly reducing the CPU usage of containers, an effect similar to a paused state is achieved. The suspension of the identified containers is released once it is determined that the corresponding node's memory usage has been reduced. The average number of container restarts was reduced by an average of 40% and a maximum of 58% when executing a high memory volatile workflow in a Kubernetes environment with the proposed method compared to its absence. Furthermore, the total execution time of a container workflow is decreased by an average of 7% and a maximum of 13% due to the reduced frequency of container restarts.