• 한국경영과학회지
• /
• 제6권2호
• /
• pp.13-19
• /
• 1981

This paper developed 3 flow-shop sequencing heuristic methods: modified RA method, modified RACS method and modified RAES method. These methods modified RA method, RACS method and RAES method developed by D. G. Dannenbring. These methods can easily determine desirable sequence of orders and can improve nx3 flow-shop's productivity and efficiency. The maximum flow-time criterion is selected as the evaluation criterion of flow-shop's efficiency, We evaluated these 6 heuristic methods’ performance. By the evaluation of the result, we can see that the modified methods produce a shorter maximum flow-time than the original methods.

• 경영과학
• /
• 제18권1호
• /
• pp.155-164
• /
• 2001

The widespread diffusion of Internet has enables every college and education institute to develope cyber education systems to meet the multiple needs of students, but it is not true that the effectiveness of cyber education is fruitful in terms of evaluation systems. Most of the early developed web-based evaluation systems for cyber education require that all the students should solve uniformed test set which are included in the predetermined static HTML pages. Therefore, it is impossible to dynamically provide a test set with consistency and reliability. This paper purpose to describe the employment of simulated annealing in cyber testbank system for test set generation that satisfy all constraints. The constraints include number of items for each skill, method, domain, topic, and so on. This research developed two phase heuristic combining sequential test set generation algorithm with simulated annealing. As a result of computer simulations, it was found that the two phase heuristic outperforms the other algorithms.

• 한국과학예술포럼
• /
• 제20권
• /
• pp.409-419
• /
• 2015

서비스디자인 플랫폼(Service Design Platform)은 지식경제부에서 시행하고 있는 '서비스 융합형 디자인 컨설팅 지원기술 개발사업'의 일환으로 서비스디자인 기업들이 온라인에서 서비스디자인 과제를 원활하게 할 수 있도록 하기 위한 목적으로 개발되었다. 서비스디자인 플랫폼 개발과정에서 플랫폼의 사용성을 검증하고 개선시키기 위해서는 사용자의 참여에 의한 사용성 테스트(Usability Test)와 더불어 전문가에 의한 휴리스틱 평가(Heuristic Evaluation)가 요구된다. 본 연구는 전문가에 의한 휴리스틱 평가를 실시하기에 앞서 평가대상에 적합한 평가영역과 세부 평가항목을 도출하기 위한 목적으로 진행되었다. 연구를 위해서 내부 연구자들이 사용성 영역과 평가대상인 서비스디자인 플랫폼의 특징요소, 설계요소, 커뮤니티 요소 등을 설정하였고, 이를 세부항목에 반영해서 평가지표를 분류하고 도출하였다. 이어서 평가지표에 대한 타당성과 신뢰성 검증을 위해 전문가를 대상으로 델파이 조사를 실시해서 4개의 평가영역과 44개의 세부항목으로 구성된 평가지표를 도출하였다. 도출된 평가지표는 체크리스트로 활용해서 향후 전문가에 의한 휴리스틱 평가 시 활용될 계획이다.

• 한국IT서비스학회지
• /
• 제21권2호
• /
• pp.127-143
• /
• 2022

In this study, a usability evaluation tool was developed for "ICANDUINO", a VR-based mobile application for maker education, and usability evaluation was conducted with a heuristic survey method for experts. The usability evaluation tool was derived through literature review and validated by two experts. It consisted of seven domains (effectiveness, efficiency, satisfaction, learnability, memorability, error, and cognitive load) and twenty-five sub-items. As a result of the usability evaluation conducted for six experts, it received the highest score in the domain of efficiency and the lowest score in the domain of error. The improvements of ICANDUINO were derived by analyzing the qualitative opinions of experts in each of the four stages (training, coding, tinkering, and testing) of making. the results of this study can be used as a guideline when evaluating the usability of a mobile app for education.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.73-82
• /
• 1988

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.

• 한국해양공학회지
• /
• 제26권4호
• /
• pp.8-14
• /
• 2012

Two dimensional nesting is a common problem in industries such as the shipbuilding, automotive, clothing, shoe-making, and furniture industries, in which various parts are cut off from stock or packed in a flat space while minimizing waste or unoccupied space. Nesting is known as an NP-complete problem, which has a solution time proportional to the superpolynomial of the input size. It becomes practically impossible to find an optimal solution using algorithmic methods as the number of shapes to nest increases. Therefore, heuristic methods are commonly used to solve nesting problems. This paper presents an expert system that uses a heuristic search method based on an evaluation function for nesting problems, in which parts and stock are represented by pixels. The system is developed in CLIPS, an expert system shell, and is applied to four different kinds of example problems to verify its applicability in practical problems.

• 대한산업공학회지
• /
• 제11권2호
• /
• pp.75-85
• /
• 1985

The application of GT results in the mass production effect to multi-product, small lot-sized production. Group scheduling, which is operations scheduling based on the GT concept, is analyzed in a multistage manufacturing system. But the research has been limited in independent setup time models. A heuristic algorithm has been developed to minimize the mean flow time when setup times are dependent to sequence of group in multistage. For evaluation of the heuristic algorithm, the solution of heuristic algorithm is compared with that of random scheduling. The result of comparison indicates that the proposed heuristic algorithm provides good solutions with relatively fewer computational effort.

• 품질경영학회지
• /
• 제17권1호
• /
• pp.35-47
• /
• 1989

This paper is concerned with a development and evaluation of heuristic algorithms for the n-job, M-stage flowshop with sequence dependent setup times. Three heuristic algorithms, CAIDAN, DANNEN and PETROV, are proposed. The makespan is taken as a performance measure for the algorithms. The experiment for each algorithm is designed for a $4{\times}3{\times}3$ factorial design with 360 observations. The experimental factors are PS (ratio of processing times to setup times), M (number of machines), and N (number of jobs). The makespan of the proposed heuristic algorithms is compared with the optimal makespan obtained by the complete enumeration method. The result of comparision of performance measure is called a relative error. The mean relative errors of CAIDAN, DANNEN and PETROV algorithms are 4.488%. 6.712% and 7.282%, respectively. The computational results are analysed using SPSS. The experimental results show that the three factors are statistically signiticant at 5% level.

• 한국실천공학교육학회논문지
• /
• 제2권2호
• /
• pp.165-171
• /
• 2010

Usability heuristics는 사용자 인터페이스를 설계하는 과정에서 유용성 평가에 사용되는 일반적인 원칙이다. 유용성 평가 방법은 보통 Human Computer Interaction(HCI) 전문가들이 사용하는데, 이 연구의 최종적인 목적은 HCI 전문가들 뿐 만이 아니라 사용자 인터페이스를 제작하는 더 광범위한 많은 사람들(사용자 인터페이스 디자이너나 엔지니어들)에게 적용하는 것이다. 따라서 본 연구에서는 유용성 평가에서 대표적으로 사용되는 Jakob Nielsen의 10가지 usability heuristics가 HCI 전문가가 아닌 디자인과 컴퓨터 공학 교수 및 학생들이 얼마나 이해하기 쉬운지를 설문하였다. 또한 응답한 설문을 바탕으로 어떤 heuristics들이 이해하기 쉬었으며, 이해하기 어려운 것들은 어떠한 이유로 이해하기가 어려웠는지, 또 교수들과 학생들과의 이해정도의 차이나 응답반응의 차이 등을 분석하였다. 본 연구를 통하여 얻게 된 가장 큰 성과는 응답자들이 좀 더 사용자 입장에서 어플리케이션들을 바라볼 수 있게 되었다는 점이었으며, 본 연구의 결과들은 usability heuristics를 좀 더 많은 사람들이 쉽게 이해할 수 있도록 만들어서 인터페이스를 설계하고 구현하는데 도움이 될 것이다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제29권1_2호
• /
• pp.91-97
• /
• 2002

본 논문에서는 자율수중운동체(AUVs, Autonomous Underwater Vehicles)의 실시간 충돌회피를 위한 휴리스틱 탐색기법을 논한다. 퍼지관계곱(fuzzy relational products)은 항행 환경에서 발생하는 장애물과 다음으로 이동 가능한 후보노드들과의 관계를 분석, 종합하는 수학적 도구로 사용된다. 본 논문은 영역전문가 보유한 장애물회피 관련 경험적 정보(heuristic information)를 반영하여 보다 효율적인 평가함수(evaluation function)를 고안하며 지능항행시스템의 상세경로설정(local path-planning)에 퍼지관계곱을 적용하여 보다 개선된 휴리스틱 탐색기법을 제안한다. 제안된 탐색기법의 성능검증을 위해 수행시간(cpu time), 경로의 최적화(optimization) 정도, 그리고 사용 메모리 관점에서 시뮬레이션을 통해 $A^{*}$ 탐색기법과 비교한다.