• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1987년도 한국자동제어학술회의논문집(한일합동학술편); 한국과학기술대학, 충남; 16-17 Oct. 1987
• /
• pp.857-862
• /
• 1987

Given a network with k specified vertices bi called centers, a cardinality constrained cover is a family {Bi} of k subsets covering the vertex set of a network, such that each subset Bi corresponds to and contains center bi, and satisfies a given cardinality constraint. A set of cardinality constrained overlapping territories is a cardinality constrained cover such that the total sum of T(B$_{i}$) for all subsets is minimum among all cardinality constrained covers, where T(B$_{i}$) is the summation of the shortest path lengths from center bi to every vertex in B$_{I}$. This paper considers a problem of finding a set of cardinality constrained overlapping territories. and proposes an algorithm for the Problem which has the time and space complexities are O(k$^{3}$$\mid$V$\mid$$^{2}$) and O(k$\mid$V$\mid$+$\mid$E$\mid$), respectively, where V and E are the sets of vertices and edges of a given network, respectively. The concept of overlapping territories has a possibility to be applied to a job assignment problem.oblem.

• 한국보건간호학회지
• /
• 제31권2호
• /
• pp.352-364
• /
• 2017

Purpose: The aim of this study was to explain the burnout among health teachers in elementary schools with large class sizes, and to explore the nature and meaning of those experiences. Methods: This study used the four steps of Giorgi's descriptive phenomenology. Data were collected through in-depth interviews regarding the experiences of burnout of 9 participants, which were recorded, transcribed, and analyzed. Results: The participants' experiences of teaching large classes were categorized into 4 themes and 9 domains. The themes were "difficult and lethargic," "gradual deterioration conditions," "losing work-life balance," and "enduring for a short time and leaving." Conclusion: Burnout not only affected the teachers at work but also had a negative impact on the teachers' personal and family lives outside of school. This study found that the current teacher assignment criteria were the strongest factors influencing burnout, which contribute to physical exhaustion. Health teachers are assigned based on different criteria that do not consider the number of students. Another factor contributing to burnout among health teachers is a work environment conducive to with emotional exhaustion. Health teachers and content teachers are not sufficiently knowledgeable regarding the specifics of each other's work.

• 한국철도학회논문집
• /
• 제13권5호
• /
• pp.535-540
• /
• 2010

본 연구는 철도물류터미널에서 작업선 배정 및 열차조성을 위한 최적화 모형을 제시한다. 본 연구에서는 하루 터미널 작업 종료시간을 최소화하며 처리 컨테이너수를 최대화하는 다기준 정수 계획 모형을 개발하였고, 의왕ICD로부터의 실제 데이터로부터 구성된 현실 문제에 대해 본 모형을 적용하여 실험하였다. 실험 결과 목적함수의 가중치에 따라 다양한 파레토 최적해를 산출할 수 있었으며, 기존의 해보다 전체 작업종료 시간을 약 6% 감소시켰으며 이러한 결과는 본 연구에서 개발한 최적화 모형을 적용할 경우 설비의 추가적인 확장 없이도, 철도 컨테이너 터미널의 처리효율 향상을 가져올 수 있음을 의미한다.

• 대한토목학회논문집
• /
• 제36권2호
• /
• pp.325-332
• /
• 2016

적합한 굴삭기 부착 작업 장치들과 엔진크기의 구성은 굴삭계획 전에 결정되어야한다. 기존의 경험에 근거하는 굴삭기 구성선택 관습은 다양한 변수들을(장비 동작데이터, 토사유형과 상태, 버킷 속성들, 작업조건 등) 동시에 그리고 시기적절하게 고려하지 못하기 때문에 과학적으로 타당한 근거가 부족하다. 따라서 본 논문은 이러한 기존의 방법을 보완하기 위해 가장 합리적인 굴삭기 구성을 판별하는 새로운 굴삭기 구성 탐색 방법을 제안한다. MATLAB을 사용하여 구현 된 본 방법은 생산성의 변동을 일으키는 변수들을 고려하여 최적 굴삭기 구성을 규명한다. 본 방법론을 검증하기 위해 사례연구를 수행하였다.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2005년도 춘계학술발표대회
• /
• pp.1505-1508
• /
• 2005

본 논문에서는 그리드 컴퓨팅 환경에서 연산자원의 성능지수를 사용한 작업할당 기법에 관해 연구하였다. 제안한 연산자원의 성능지수를 사용한 작업할당 기법은 작업을 할당하기 전에 작업을 할당하기 위한 연산자원(프로세서)의 성능지수를 구하고, 이를 바탕으로 작업할당을 수행한다. 연산자원의 성능지수를 사용한 작업 할당 기법은 동적으로 변화하는 그리드 컴퓨팅 환경에서 보다 더 효과적인 작업할당 방법이다. 성능지수를 고려한 작업할당 방법이 고려하지 않은 방법에 비해 3 차원 Euler 방정식을 이용한 CFD 연산 작업의 연산시간을 단축함을 $K{\ast}Grid$ 환경에서 실험으로 확인하였다.

• 한국통신학회논문지
• /
• 제31권10B호
• /
• pp.929-935
• /
• 2006

When the Internet phone service, generally PC-to-Phone, first entered into the telecommunications service market, no regulatory issues were arisen to manage the service within the regulatory framework because of it's low quality, no phone number assignment and etc. However, almost the same quality, more applications and cheaper price compared with the fixed telecommunications service, have changed the regulator's policy allowing Internet phone service within market mechanism. While incumbent fixed telecommunications service enterprises had given with tremendous duties to continue the job categorized 'facilities-based telecommunication service provider', and which can be unreasonable and unfair if Internet phone service enterprises are allowed to enter into the fixed telecommunications market without any regulation. Thus, new regulatory framework has worked for the Internet phone service named the VoIP service generally in the fixed telecommunications market. Recently, VoIP is provided not only in the fixed telecommunications market but also in the mobile market as Wi-Fi phone is feasible in the wireless LAN environment. Furthermore, bundled service of Wi-Fi and cellular phone service will be launched soon, and the next version will be the mobile VoIP service operating like a cellular phone service. Hence, we will meet similar situation when the VoIP sewice enters into the fixed telecommunications service market. And, in this paper, we prospect the regulatory issues arising when the wireless or mobile VoIP service enterprises enter the mobile market, by analyzing possible scenarios.

• Journal of Information Technology Applications and Management
• /
• 제18권1호
• /
• pp.125-141
• /
• 2011

As the sales volume of online shops increases, the job burden in the back-offices of the online shops also increases. Order picking is the most labor-intensive operation among the jobs in a back-office and mid-size pure click online shops are experiencing the time delay and complexity in order picking nowadays while fulfilling their customers' orders. Those warehouses of the mid-size shops are based on manual systems, and as order pickings are repeated, the warehouses get a mess and lots of products in those warehouses are getting missing, which results in severe delay in order picking. To overcome this kind of problem in online clothing shops, we research a methodology to locate warehousing products. When products arrive at a warehouse, they are packed into a box and located on a rack in the warehouse. At this point, the operator should determine the box to be put in and the location on the rack for the box to be put on. This problem could be formulated as an Integer Programming model, but the branch-and bound algorithm to solve the IP model requires enormous computation, and sometimes it is even impossible to get a solution in a proper time. So, we relaxed the problem, developed a set of heuristics as a methodology to get a semi-optimum in an acceptable time, and proved by an experiment that the solutions by our methodology are satisfactory and acceptable by field managers.

• Industrial Engineering and Management Systems
• /
• 제11권4호
• /
• pp.310-330
• /
• 2012

Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.

• 지능정보연구
• /
• 제6권2호
• /
• pp.99-110
• /
• 2000

오늘날의 기업은 상품을 판매하는 것 뿐만 아니라 기업의 신용과 이미지를 위해 그 상품에 대한 사후처리(After Service) 업무에 많은 투자를 하고 있다. 이러한 양질의 사후서비스를 고객에게 공급하기 위해서는 많은 인력을 합리적으로 관리해야 하며 요청되는 고장수리 서비스 업무의 신속한 해결을 위해 업무를 인력에게 합리적으로 배정을 해야 한다. 그러므로, 회사의 비용을 최소화하면서 정해진 시간에 요청된 작업을 처리하기 위해서는 인력들에게 작업을 배정하고 스케줄링하는 문제가 발생된다. 본 논문에서는 이러한 문제를 해결하기 위해서 화학계기의 A/S작업을 인력에게 합리적으로 배정 하는 스케줄링 시스템에 관한 연구이다. 먼저 스케줄링 모델을 HP사의 화학분석 및 시스템을 판매, 유지보수 해주는 Y사의 작업 스케줄을 분석하여 필요한 도메인과 고객서비스전략과 인력관리전략에서 제약조건을 추출하였고 여기에 스케줄링 문제를 해결하기 위한 방법으로 제약만족문제(CSP) 해결기법인 도메인 여과기법을 적용하였다. 도메인 여과기법은 제약조건에 의해 변수가 갖는 도메인의 불필요한 부분을 여과하는 것으로 제약조건과 관련되어 있는 변수의 도매인 크기가 축소되는 것이다. 또한, 스케줄링을 하는데에 있어서 비용적인 측면에서의 스케줄링방법과 고객만족도에서의 스케줄링 방법을 비교하여 가장 이상적인 해를 찾는데 트래이드오프(Trade-off)를 이용하여 최적의 해를 구했으며 실험을 통해 인력에게 더욱 효율적으로 작업들을 배정 할 수 있었고 또한, 정해진 시간에 많은 작업을 처리 할 수 있었으며 작업을 처리하는데 있어 소요되는 비용을 감소하는 결과를 얻을 수 있었다.

• 산업경영시스템학회지
• /
• 제47권2호
• /
• pp.48-56
• /
• 2024

We examine a single machine scheduling problem with step-improving jobs in which job processing times decrease step-wisely over time according to their starting times. The objective is to minimize total completion time which is defined as the sum of completion times of jobs. The total completion time is frequently considered as an objective because it is highly related to the total time spent by jobs in the system as well as work-in-progress. Many applications of this problem can be observed in the real world such as data gathering networks, system upgrades or technological shock, and production lines operated with part-time workers in each shift. Our goal is to develop a scheduling algorithm that can provide an optimal solution. For this, we present an efficient branch and bound algorithm with an assignment-based node design and tight lower bounds that can prune branch and bound nodes at early stages and accordingly reduce the computation time. In numerical experiments well designed to consider various scenarios, it is shown that the proposed algorithm outperforms the existing method and can solve practical problems within reasonable computation time.