• Industrial Engineering and Management Systems
• /
• v.10 no.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
• /
• v.17 no.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.

• Journal of The Korean Association For Science Education
• /
• v.24 no.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.

• Journal of The Korean Association of Information Education
• /
• v.21 no.6
• /
• pp.675-690
• /
• 2017

Preparing the 4th industrial revolution age, a diagnostic assessment management system which can collect nationwide data has been implemented and utilized for the development of the evidence-based educational policy. This study aims to develop heuristics to help to improve usability of such systems, which are utilized by primary and middle school community including teachers and students in the nationwide. To achieve the objective, previous studies related to the development of heuristics in the educational contexts as well as basic heuristics from Nielsen were reviewed, and usability problems of the web-based diagnostic-supplement system being currently utilized, as a sample system, were analyzed. Then, the first version of heuristics was developed. The developed heuristics were validated and revised through 2 rounds of the delphi methods with 15 experts. This study has an implication with preparing foundations on improving usability of such diagnostic assessment management system utilized by school community at the nationwide in educational contexts.

• Asia-Pacific Journal of Business
• /
• v.14 no.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.

• The KIPS Transactions:PartB
• /
• v.18B no.1
• /
• pp.29-38
• /
• 2011

In order to derive domain-independent heuristics from the specification of a planning problem, it is required to relax the given problem and then solve the relaxed one. In this paper, we present a new planning graph, Merged Planning Graph(MPG), and GD heuristics for solving contingent planning problems with both uncertainty about the initial state and non-deterministic action effects. The merged planning graph is an extended one to be applied to the contingent planning problems from the relaxed planning graph, which is a common means to get effective heuristics for solving the classical planning problems. In order to get heuristics for solving the contingent planning problems with sensing actions and non-deterministic actions, the new graph utilizes additionally the effect-merge relaxations of these actions as well as the traditional delete relaxations. Proceeding parallel to the forward expansion of the merged planning graph, the computation of GD heuristic excludes the unnecessary redundant cost from estimating the minimal reachability cost to achieve the overall set of goals by analyzing interdependencies among goals or subgoals. Therefore, GD heuristics have the advantage that they usually require less computation time than the overlap heuristics, but are more informative than the max and the additive heuristics. In this paper, we explain the experimental analysis to show the accuracy and the search efficiency of the GD heuristics.

• Management Science and Financial Engineering
• /
• v.13 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.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.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.163-170
• /
• 2008

Due to the proliferation of the Internet and intranet, a new application domain called stream data processing has emerged. Stream data is real-timely and continuously generated. In this paper, we focus on the processing of stream data whose characteristics vary unpredictably by over time. Particularly, we suggest a method which generates an efficient operator execution order called WT-Heuristics. WT-Heuristics efficiently determines the operator execution order since it considers only two adjacent operators in the operator execution order. Also, our method changes the execution order with respect to the change of data characteristics with minimum overheads.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.04b
• /
• 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.