• Industrial Engineering and Management Systems
• /
• 제10권2호
• /
• pp.134-139
• /
• 2011

The problem of scheduling in permutation flowshops has been extensively investigated by many researchers. Recently, attempts are being made to consider more than one objective simultaneously and develop algorithms to obtain a set of Pareto-optimal solutions. Varadharajan et al. (2005) presented a multi-objective simulated-annealing algorithm (MOSA) for the problem of permutation-flowshop scheduling with the objectives of minimizing the makespan and the total flowtime of jobs. The MOSA uses two initial sequences obtained using heuristics, and seeks to obtain non-dominated solutions through the implementation of a probability function, which probabilistically selects the objective of minimizing either the makespan or the total flowtime of jobs. In this paper, the same problem of heuristically developing non-dominated sequences is considered. We propose an effective heuristics based on simulated annealing (SA), in which the weighted sum of the makespan and the total flowtime is used. The essences of the heuristics are in selecting the initial sequence, setting the weight and generating a solution in the search process. Using a benchmark problem provided by Taillard (1993), which was used in the MOSA, these conditions are extracted in a large-scale experiment. The non-dominated sets obtained from the existing algorithms and the proposed heuristics are compared. It was found that the proposed heuristics drastically improved the performance of finding the non-dominated frontier.

• Management Science and Financial Engineering
• /
• 제17권1호
• /
• pp.79-94
• /
• 2011

Team orienteering, an extension of single-competitor orienteering, is the problem of determining multiple paths from a starting node to a finishing node for a given allowed time or distance limit fixed for each of the paths with the objective of maximizing the total collected score. Each path is through a subset of nodes, each of which has an associated score. The team orienteering problem has many applications such as home fuel delivery, college football players recruiting, service technicians scheduling, military operations, etc. Unlike existing optimal and heuristic algorithms often leading to heavy computation, this paper suggests two types of priority rule based heuristics-serial and parallel ones-that are especially suitable for practically large-sized problems. In the proposed heuristics, all nodes are listed in an order using a priority rule and then the paths are constructed according to this order. To show the performances of the heuristics, computational experiments were done on the small-to-medium sized benchmark instances and randomly generated large sized test instances, and the results show that some of the heuristics give reasonable quality solutions within very short computation time.

• 한국과학교육학회지
• /
• 제24권1호
• /
• pp.146-156
• /
• 2004

The purpose of this study is to look at the use of heuristics when a sixth grader solves a problem. Two research questions have been formulated: The similarities and differences in the use of heuristics when a student solves two problems that are science-knowledge-based and not science-knowledge-based, and the different types of prompts. A male sixth grade student participated in this study. All of the information for the study was collected in three interviews. The interviews began with observing the student's solving problems. The student was asked how and why he solved problem that way. There were some interactions between the researcher and the student during the interview procedures. As results of this study, eight general heuristics were used in both solutions: Check examples for support of an idea: check examples for exceptions to an idea: restate the problem: compare to known examples or patterns: make a hypothesis; check the relevance of other information present; use analogy: and recognize patterns/similarity. There seemed to be more similarities than differences in the type of general heuristic that were used in the two problem solutions. The student was systematic and consistent in his use of the general use of heuristics. Five types of interviewer prompts were detected in the two problem solutions, directional cues, modeling, clarity, problem posing, metacognition and validation.

• 정보교육학회논문지
• /
• 제21권6호
• /
• pp.675-690
• /
• 2017

4차 산업혁명 시대를 맞이하여 증거기반의 교육정책을 위해, 전국단위의 진단평가 데이터를 수집하기 위한 시스템을 구축 활용하고 있다. 본 연구는 이러한 전국 단위 초 중생이 활용하고 있는 진단평가관리시스템의 사용성 개선을 도울 수 있는 휴리스틱스 개발을 목적으로 하였다. 이를 위해 Nielsen의 기본 휴리스틱스를 비롯하여 교육적 목적에 종속적으로 개발된 휴리스틱스에 대한 선행연구를 기반으로 유사시스템인 진단 보정학습시스템의 사용성 문제를 분석함으로써 휴리스틱스 초안을 개발하였다. 이는 델파이 방법을 통해 15명의 전문가에 의해 2회의 타당화 과정을 수행함으로써 수정 보완되었고 최종안이 도출되었다. 본 연구는 교육 맥락에서 사용성 평가도구를 제공함으로써 전국단위의 관계자(교사 등)와 학생들이 활용하는 시스템의 사용성 개선을 위한 기반을 마련하였다는데 의의가 있다.

• 아태비즈니스연구
• /
• 제14권1호
• /
• pp.265-279
• /
• 2023

Purpose - The purpose of this paper is to compare and review behavioral economics models that explain stock price changes after large-scale price shocks in the Korean stock market and to find a suitable model. In this paper, among the theories reviewed, it was confirmed that the anchoring heuristics theory has high explanatory power for stock prices after large-scale stock price fluctuations. Design/methodology/approach - This paper conducts an event study on stock price shocks in which the individual stocks that make up the KOSPI200 index show more than 10% fluctuation on a daily basis. In order to materialize the abstract predictions of heuristics theories in a varifiable form, this paper uses the daily stock price index change as a reference point for availability heuristics, and uses the 52-week highest and lowest price as reference point for anchoring heuristics. Research implications or Originality - As a result of the empirical analysis, the stock price reversals did not consistently appear for changes in the daily index. On the other hand, the stock price drifts consistently appeared around the 52-week highest and the 52-week lowest price. And in the multiple regression analysis that controlled for company-specific and event-specific variables, the results that supported the anchoring heuristics were more evident. These results suggest that it is possible to establish an investment strategy using large-scale price change in Korean stock market.

• 정보처리학회논문지B
• /
• 제18B권1호
• /
• pp.29-38
• /
• 2011

계획 문제 명세로부터 영역-독립적인 휴리스틱을 유도해내기 위해서는 주어진 계획문제에 대한 간략화와 간략화된 계획문제에 대한 해 도출 과정이 요구된다. 본 논문에서는 초기 상태의 불확실성과 비결정적 동작 효과를 모두 포함한 조건부 계획문제를 풀기 위한 새로운 융합 계획그래프와 이것을 이용한 GD 휴리스틱 계산법을 소개한다. 융합 계획그래프는 고전적 계획 문제 풀이를 위한 휴리스틱 계산에 이용되는 간략화된 계획그래프를 조건부 계획문제에 적용할 수 있도록 확장한 자료구조이다. 융합 계획그래프에서는 감지 동작과 비결정적 동작들을 포함한 조건부 계획 문제에 대한 휴리스틱을 얻기 위해, 전통적인 삭제 간략화외에도 감지 동작과 비결정적 동작들에 대한 효과-융합 간략화를 추가로 이용한다. 융합 계획 그래프의 전향 확장과 병행적으로 진행되는 GD 휴리스틱 계산에서는 목표조건들 간의 상호 의존성을 분석하여 전체 목표 집합에 대한 최소 도달비용을 추정할 때 불필요한 중복성을 배제한다. 따라서 GD 휴리스틱은 기존의 겹침 휴리스틱보다 더 적은 계산시간 을 요구하면서도, 최대 휴리스틱이나 합산 휴리스틱보다 더 높은 정보력을 가진다는 장점이 있다. 본 논문에서는 GD 휴리스틱의 정확성과 탐색 효율성을 확인하기 위한 실험적 분석에 대해 설명한다.

• Management Science and Financial Engineering
• /
• 제13권2호
• /
• pp.47-77
• /
• 2007

This paper considers a scheduling problem where a customer orders multiple products(jobs) from a production facility. The objective is to minimize the sum of the order(batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers. We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.

• 대한산업공학회지
• /
• 제35권4호
• /
• pp.257-265
• /
• 2009

This paper considers the hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. In hybrid flow shops, each job is processed through multiple production stages in series, each of which has multiple identical parallel machines. The problem is to determine the allocation of jobs to the parallel machines at each stage as well as the sequence of the jobs assigned to each machine. Due to the complexity of the problem, we suggest search heuristics, tabu search and simulated annealing algorithms with a new method to generate neighborhood solutions. In particular, to evaluate and select neighborhood solutions, three surrogate objectives are additionally suggested because not much difference in the number of tardy jobs can be found among the neighborhoods. To test the performances of the surrogate objective based search heuristics, computational experiments were performed on a number of test instances and the results show that the surrogate objective based search heuristics were better than the original ones. Also, they gave the optimal solutions for most small-size test instances.

• 정보처리학회논문지D
• /
• 제15D권2호
• /
• pp.163-170
• /
• 2008

인터넷과 인트라넷의 확산에 따라, 스트림 데이터 처리 (stream data processing) 와 같은 새로운 분야가 등장하게 되었다. 스트림 데이터는 실시간적이고 연속적으로 생성된다. 본 논문에서는 시간에 따라서 예측할 수 없게 특성이 바뀌는 데이터 스트림에 대한 처리에 대하여 다룬다. 특별히, 본 논문에서는 스트림 데이터에 대한 질의문을 구성하는 연산자들 간의 효율적인 수행 순서 생성 기법인 WT-Heuristics를 제안한다. WT-Heuristics 기법은 연산 실행 순서에서 인접한 두 연산자들의 연산 순서만을 고려함으로써 효율적으로 연산자 순서를 결정할 수 있다. 또한 본 논문에서 제안하는 방법은 시스템의 부담을 적게 주면서도 데이터의 변화에 따라 수행 순서를 변화시킨다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1993년도 춘계학술대회 논문집
• /
• pp.262-266
• /
• 1993

The development of COPS(Computer aided Operation Planning System) needs data mapping paradigm which provides intelligent determonation of cutting conditions from the requirements of process planning side. We proposed the idea of multi-level mapping by the combination of heuristics of domain experts and mathematical abstraction of cutting condition and requirements. Mathematical mathods for the generalization of heuristics were constructed by multi-layer perceptron. DBMS for determination of cutting conditions was constructed by classification and combination of best fitted models. Triangular fuzzy number was used to process the uncertainties in heuristics of experts.