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

Parcel delivery services are a bit different from general vehicle routing problems since the services require a deliver’s walking time to give the parcel to the customer. This time takes more than 1/4 of total delivery time, but it is ignored for the conv

The restrictions and conditions of parcel delivery services are different from other delivery services. There is WTD in the parcel delivery service. WTDs are various along the types of buildings and delivery points. To make the problem solving method simple and efficient using the WTD, the values are observed and grouped based on the type of buildings in this research. Efficient VRP heuristic design could be possible with introduction of WTD concept as well as the delivery time forecasting.

In this paper, we raised the performance of heuristic algorithm to assign job to workers in parallel line inspection process without sequence. In previous research, we developed the heuristic algorithm. But the heuristic algorithm can't find optimal solution perfectly. In order to solve this problem, we proposed new method to make initial solution called FN(First Next) method and combined the new FN method and old FE method using previous heuristic algorithm. Experiments of assigning job are performed to evaluate performance of this FE+FN heuristic algorithm. The result shows that the FE+FN heuristic algorithm can find the optimal solution to assign job to workers evenly in many type of cases. Especially, in case there are optimal solutions, this heuristic algorithm can find the optimal solution perfectly.

Vehicle routing problem is one of the traveling salesman problems with various conditions such as vehicle capacity limits, delivery time windows, as well as time dependent speeds in metropolitan area. In this research hourly vehicle moving speeds informat

The operation of vending machine system presents a decision-making problem which consists of determining the product allocation to vending-machine storage compartments, replenishment intervals of vending machines, and vehicle routes, all of which have cri

To date, facility layout problems has been solved and applied for job shop situations. Since flow shop has more restrictions, the solution space is much smaller than job shop. An efficient heuristic algorithm for facility layout problems for flow shop lay

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr’s length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-

This paper considers a 2-stage assembly flowshop scheduling problem where each job is completed by assembling multiple components. The problem has the objective measure of minimizing total completion time. The problem is shown to be NP-complete in the str

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret and the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret and the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

We developed two heuristic methods to solve the problem considering a fleet of ships delivering chemical products from terminals We need to decide how much of each product to carry, on which ship, subject to the conditions that all terminals must have suf

In this study, we developed a heuristic algorithm to get better efficiency of clustering than conventional algorithms. Conventional clustering algorithm had lower efficiency of clustering as there were no solid method for selecting initial center of cluster and as they had difficulty in search solution for clustering. EMC(Expanded Moving Center) heuristic algorithm was suggested to clear the problem of low efficiency in clustering. We developed algorithm to select initial center of cluster and search solution systematically in clustering. Experiments of clustering are performed to evaluate performance of EMC heuristic algorithm. Squared-error of EMC heuristic algorithm showed better performance for real case study and improved greatly with increase of cluster number than the other ones.

바둑에 있어 사활 문제는 컴퓨터 바둑을 구현하기 위하여 반드시 극복되어져야 하는 기본적인 문제이다. 사활 문제와 같은 국부적인 문제를 풀기 위하여, 중요하게 고려되어야 할 사항은 어떻게 하면 게임 트리의 분기수와 그 깊이를 줄일 수 있느냐는 것이다. 본 논문에서는 게임 트리를 위한 첫 수들을 생성하기 위하여 휴리스틱 세력 함수로 눈 모양 분석이라는 초유의 방법을 적용하였다. 휴리스틱 세력 함수로 둘러싸인 돌들의 눈 모양을 분석하는 주요 목적은 아주 짧은 시간내에 둘러싸인 돌들이 살았는지, 미생(未生)인지 아니면 죽었는지를 판단하는 것이다. 만약 둘러싸인 돌들이 죽거나 미생일 경우가 높으면, 완전 게임 트리 내에서 최선의 수순을 찾아내기 위해 소요되는 엄청난 계산 시간을 절약할 수 있는 가능한 급소 점(첫 수)들로 사용될 수가 있다. 비록 눈 모양 분석기는 40% 미만의 정확도를 보였지만, 단순한 휴리스틱 세력함수로 된 눈 모양 분석기는 짧은 시간 내에 둘러싸인 돌들의 생사 여부를 판단하는 데 상당한 도움이 됨을 발견했다.

National technical qualification does not recognised degree of working-career in labor market and an industrial field situation. National qualification is supply to nurture expert manpower and accomplish of self-development and a duty accomplishment ability improvement at a side of personal. So, This study is purposed to find that a method for recognition of working-career on the national technical qualification system. According to, this study is designed to questionnaire with BSC(Balaced ScoreCard), SEM(Structure Equation Model) with the delphi method, and is analysed using the AMOS 7.0 program package. Finally, This study is suggested growing to qualification standard for an examination a degree of master craftsman only under the change of national qualification systematization as a standard to operation and control.

This paper considers the sequencing of products in mixed model assembly lines. The sequence which minimizes overall utility work in car assembly lines reduce the cycle time, the number of utility workers, and the risk of conveyor stopping. The sequencing problem is solved using Tabu Search. Tabu Search is a heuristic method which can provide a near optimal solution in real time. Various examples are presented and experimental results are reported to demonstrate the efficiency of the technique.

In this paper, we developed a heuristic algorithm to assign job to workers in parallel line inspection process without sequence. Objective of assigning job in inspection process is only to assign job to workers evenly. But this objective needs much time and effort since there are many cases in assigning job and cases increase geometrically if the number of job and worker increases. In order to solve this problem, we proposed heuristic algorithm to assign job to workers evenly. Experiments of assigning job are performed to evaluate performance of this heuristic algorithm. The result shows that heuristic algorithm can find the optimal solution to assign job to workers evenly in many type of cases. Especially, in case there are more than two optimal solutions, this heuristic algorithm can find the optimal solution with 98% accuracy.

  This paper considers an integrated decision for scheduling and outsourcing(or, subcontracting) of a finite number of jobs(or, orders) in a time-sensitive make-to-order manufacturing environment. The jobs can be either processed in a parallel in-house fa

  기간차량경로 문제는 차량용량제약을 고려한 차량경로문제를 다 기간으로 확장한 형태의 문제로 역방향 로지스틱스의 폐기물 혹은 재활용품 수거에 관련된 주요한 운영 문제들 중의 하나로 각 고객에 대해서는 계획기간 중에 방문해야 하는 횟수가 정해져 있어 방문날짜 조합을 결정해야 하며 주어진 방문날짜 조합 하에 각 기간의 차량경로도 결정해야 한다. 주요한 제약조건으로는 차량의 용량제약과 각 기간의 가용 시간제약이 있으며 소요차량의 대수를 최소화하는 것을 목적으

  This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent