This study attempts to analyze the economic impact of the service robot industry using Input-Output analysis, which is conducted based on Demand-driven model, the Leontief price model, the Backward and Forward Linkage Effects, and the Exogenous Methods. In a Demand-driven model analysis, we can conclude that the service robot industry contains characteristics of both the manufacturing industry and the service industry, which causes a positive impact on the overall industry by compensating for the weaknesses of the two industries. The Leontief price analysis indicates when wages in the service robot industry increase, prices related to robot manufacturing also increase. Also, when profits in the service robot industry increase, prices related to service provision increase, too. The Backward and Forward Linkage Effects analysis shows that the service robot industry is highly sensitive to the current economic condition and has a great influence on the service industry. The service robot industry can highlight the aspect of service characteristics when the manufacturing industry is in recession and vice versa. In addition, the service robot industry can be regarded as a value-adding and domestic economy promoting industry which utilizes knowledge of information and communication technologies. It is important to foster the service robot industry in South Korea, which is in economic recession to provide an opportunity to stimulate the growth of both service and robot industries.

The Dynamic Vehicle Routing Problem (DVRP) involves a combinatorial optimization problem where new customer demands become known over time, and old routes must be reconfigured to generate new routes while executing the current solution. We consider the high level of dynamism problem. An application of highly dynamic DVRP is the ambulance service where a patient contacts the service center, followed by an evaluation of case severity, and a visit by a practitioner/ ambulance is scheduled accordingly. This paper considers a variant of the DVRP and proposes a decentralized algorithm in which collaborators (Depot and Vehicle), both have only partial information about the entire system. The DVRP is modeled as a periodic re optimization of VRP using the proposed decentralized algorithm where collaborators exchange local information to achieve the best global objective for the current state of the system. We assume the existence of a dispatcher e.g., headquarter of the company who can communicate to vehicles in order to gather information and assigns the new visits to them. The effectiveness of the proposed decentralized coordination algorithm is further evaluated using benchmark data given in literature. The results show that the proposed method performed better than the compared algorithms which utilize the centralized coordination in 12 out of 21 benchmark problems.

본 연구는 케이지와 평사 사육환경이 산란종계의 생산성에 미치는 영향을 알아보고자 실시하였다. 케 이지 또는 평사 사육환경을 제외한 모든 환경 조건은 동일한 산란종계 무창 계사를 선정하여 진행하였 다. 총 48주간 산란 종계의 산란율, 폐사율, 수정율 및 부화율을 측정하였다. 산란초기 산란율은 케이 지 사육 환경에서 높았으나, 전 구간을 보았을 때 37주 이후부터는 평사 사육이 월등히 높게 나타났다. 폐사율은 암컷 종계의 누적 폐사율에는 유의한 차이가 없었지만, 수컷의 폐사율은 케이지 사육환경에서 유의적으로 높게 조사되었다. 수정율은 전 구간 평사 사육이 월등히 높게 나타났다. 부화율에서도 평사 사육이 케이지 사육보다 높게 나타났다. 본 연구결과 평사 사육방식이 케이지 사육방법보다 산란종계의 수정율, 부화율 및 폐사율에서 우수한 것으로 조사되었다.

이 논문은 병렬 설비로 이루어진 다수의 단계를 포함하는 재방문이 있는 혼합흐름공정의 계획 문제를 다룬다. 재방문작업에서 제품은 몇몇 공정을 여러 번 방문하게 되고 이로 인하여 재공의 혼잡과 장비의 유휴의 원인이 된다. 이 상황에서는 생산성과 고객 만족도를 향상 시키는 것이 중요한 이슈이다. 따라서 본 논문은 혼합흐름공정에서 스루풋을 최대화하고 지연된 고객 수요를 최소화하기 위해 우선순위 목표계획법 기반의 휴리스틱 방법들을 제안한다. 그리고 이 휴리스틱

This paper deals with a planning problem for reentrant hybrid flow shop with serial stages consisted of parallel machines. In a reentrant operation, a product may revisit some stages several times and then it may cause the congestion of work in process (WIP) or equipment idleness. Preemptive goal programming based heuristics are proposed to maximize of throughput and to minimize of delayed customer demands in the hybrid flow shop.

This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem.

  This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled a

  In this paper, we study flowshop scheduling problems with availability constraints. In such problems, n jobs have to be scheduled on m machines sequentially under assumption that the machines are unavailable during some periods of planning horizon. The

In this paper, we consider the problem of regrouping a number of service sites into a smaller number of service sites called centers. Each service site is represented as a point in the plane and has an associated value of service demand. We aim to group the sites so that each group has the balanced service demand and the sum of distances from the sites in the group to their corresponding center is minimized. To solve this problem, we propose a hybrid genetic algorithm that is combined with Voronoi diagrams. We provide a variety of experimental results by changing the weights of the two factors: service demands and distances. Our hybrid algorithm finds good approximate solutions in a shorter computation time in comparison with optimal solution by integer programming.

The need for accurate yield prediction is increasing for estimating productivity and production costs to secure high revenues in the semiconductor industry. Corresponding to this end, we introduce new spatial modeling approaches for spatially clustered defects on an integrated circuit (IC) wafer map. We use spatial location of an IC chip on the wafer as a covariate on corresponding defects count listed in a wafer map. Analysis results indicate that yield prediction can be greatly improved by capturing spatial features of defects. Tyagi and Bayoumi's (1994) wafer map data are used to illustrate the procedure.

In this paper, we propose a systematic procedure to determine standard time and cycle time in a TFT-LCD factory. The proposed procedure mainly consists of data preprocessing, hypothesis testing and Group technology. Data preprocessing extracts relevant da