• 경영과학
• /
• 제16권1호
• /
• pp.101-113
• /
• 1999

The individual behavior on considering prior information when one assesses the probability of uncertain event by representativeness heuristic has been investigated. While prior researches proposed two contrasting behaviors on the employment, we tested the mixed hypothesis that individual ignores the prior information to some extents and begins to consider it above certain threshold when the evidence of representativeness is not salient. The threshold effect of prior probability is positively experimented and the results strongly support the discontinuity hypothesis of representativeness heuristic.

• 전자공학회논문지B
• /
• 제32B권1호
• /
• pp.11-20
• /
• 1995

A new graph problem is formulated to limit the maximum path length of a general directed graph when a minimal set of vertices together with their incident edges are removed from the graph. An optimal algorithm and a heuristic algorithm are proposed and the proposed heuristic algorithm is shown to be effective through experiments using a collection of graphs obtained from large sequential circuits. The heuristic algorithm is based on a feedback vertex set algorithm based on graph reduction.

• 한국전자거래학회:학술대회논문집
• /
• 한국전자거래학회 2005년도 e-Biz World Conference 2005
• /
• pp.195-200
• /
• 2005

As the workflow systems are becoming complex and obscure, there are discrepancies between actual workflow process and designed process. Therefore, we have developed techniques for discovering workflow models. The starting point for such techniques is a so-called 'workflow log' containing information about the workflow process as it is actually being executed. This paper presents an algorithm of workflow process mining based on heuristic approach from the workflow log, which can be happen to business process system.

• 경영과학
• /
• 제13권3호
• /
• pp.173-186
• /
• 1996

This paper presents an approach for classifying scheduling problems and selecting a heuristic rule to yield best solution in terms of certain performance measure(s). Classification parameters are employed from previous studies on job shop scheduling and project scheduling. Neural network is used for learning and estimating the performance of heuristic rules. In addition, multi-criteria decision making techniques are employed to combine the preferences for each performance measure and heuristic rule for the problems with multi-objectives.

• 산업경영시스템학회지
• /
• 제30권3호
• /
• pp.94-102
• /
• 2007

In this paper, we consider a line balancing problem in hybrid flowshops where each workstation has identical parallel machines. The number of machines in each workstation is determined in ways of satisfying pre-specified throughput rate of the system. To minimize the total number of machines in the systems, we propose five heuristic methods and one simulated annealing method. Extensive computational experiments found the superiorities of two heuristic methods and the meta-heuristic.

• 산업경영시스템학회지
• /
• 제22권51호
• /
• pp.21-28
• /
• 1999

The TSP(Traveling Salesman Problem) is one of the most widely studied problems in combinatorial optimization. The most common interpretation of TSP is finding a shortest Hamiltonian tour of all cities. The objective of this paper proposes a new heuristic algorithm MCH(Multi-Convex hulls Heuristic). MCH is a algorithm for finding good approximate solutions to practical TSP. The MCH algorithm is using the characteristics of the optimal tour. The performance results of MCH algorithm are superior to others algorithms (NNH, CCA) in CPU time.

• 산업경영시스템학회지
• /
• 제28권4호
• /
• pp.94-101
• /
• 2005

This paper presents a data-mining aided heuristic algorithm development. The developed algorithm includes three steps. The steps are a uniform selection, development of feature functions and clustering, and a decision tree making. The developed algorithm is employed in designing an optimal multi-station fixture layout. The objective is to minimize the sensitivity function subject to geometric constraints. Its benefit is presented by a comparison with currently available optimization methods.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.287-297
• /
• 1997

This research is concerned with operation control problem for an automated manufacturing system which consists of two machine centers and a single automatic guided vehicle. The objective is to develop and evaluate heuristic scheduling procedures that minimize maximum completion time to be included travel time of AGV. A new heuristic algorithm is proposed and a numerical example illustrates the proposed algorithm. The heuristic algorithm is implemented for various cases by SLAM II. The results show that the proposed algorithm provides better solutions than the previous algorithms.

• 산업경영시스템학회지
• /
• 제38권2호
• /
• pp.47-55
• /
• 2015

This paper deals with rescheduling on unrelated parallel-machines with compressible processing times, assuming that the arrival of a set of new jobs triggers rescheduling. It formulates this rescheduling problem as an assignment problem with a side constraint and proposes a heuristic to solve it. Computational tests evaluate the efficacy of the heuristic.

• 한국국방경영분석학회지
• /
• 제31권2호
• /
• pp.60-74
• /
• 2005

The main purpose of this study is to develop an watch duty scheduling focused on Korea Navy Ship, PCC class, in port. The watch duty scheduling is a type of a scheduling problem which both considers the readiness of the ship and fair duty for each person. In this study, we analyzed the personal ability and military occupational speciality and developed a manpower scheduling by using heuristic. We find an efficient and effective watch duty schedule which improved results.