• The Journal of Fisheries Business Administration
• /
• v.46 no.3
• /
• pp.129-141
• /
• 2015

Because land based aquaculture is restricted by high investment per rearing volume and control cost, good management planning is important in Land-based aquaculture system case. In this paper master production planning was made to decide the number of rearing, production schedule and efficient allocation of water resources considering biological and economic condition. The purpose of this article is to build the mathematical decision making model that finds the value of decision variable to maximize profit under the constraints. Stocking and harvesting decisions that are made by master production planning are affected by the price system, feed cost, labour cost, power cost and investment cost. To solve the proposed mathematical model, heuristic search algorithm is proposed. The model Input variables are (1) the fish price (2) the fish growth rate (3) critical standing corp (4) labour cost (5) power cost (6) feed coefficient (7) fixed cost. The model outputs are (1) number of rearing fish (2) sales price (3) efficient allocation of water pool.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.1373-1376
• /
• 2000

외판원 문제(Traveling Salesman Problem)는 주어진 n개의 도시들과 그 도시들간의 거리 비용이 주어졌을 매, 처음 출발도시에서부터 정확히 한 도시는 한 번씩만 방문하여 다시 출발도시로 돌아오면서 방문한 도시들을 연결하는 최소의 비용이 드는 경로를 찾는 문제로 최적해(optimal value)를 구하는 것은 전형적인 NP-완전 문제중의 하나이다[2,4,5, 8]. 따라서 이들의 수행시간을 줄이고자 하는 연구가 많이 진행된다. 본 논문에서는 외판원 문제의 최적의 해를 구하는데. 휴리스틱 알고리즘인 최근접 휴리스틱을 이용한다. 물론 수행 시간을 줄이고자 최적화 문제에서 좋은 성능을 보이는 유전 알고리즘 (Genetic Algorithm)으로 얻은 근사해(near optimal)를 초기 분기 함수로 사용하고, 근거리 통신망(Local Area Network)에 기반한 분산 처리 환경에서 여러 프로세서에 분산시켜 병렬성을 살린다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.92-96
• /
• 2005

This paper deals with a batch processor model in which the batch processing times depend on the jobs assigned to the batch. Each job has a distinct processing time which is determined as not the exact value but the range from the lower limit to the upper, which makes it possible to group several jobs into the same batch. In point of this flexibility our model can be referred to as the generalization of the bum-in model in which the upper limit of each job is unbounded. The jobs to be scheduled may be available nonsimultaneously. Therefore they have different ready times. We develop the model to describe the problem situation and the heuristic methods to minimize the total tardiness. And our batching rule is compared with other dispatching ones.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.10 no.16
• /
• pp.133-141
• /
• 1987

Man-machine assignment problem with random service and processing times is considered in this paper. Assuming heterogeneous semi-automatic machines, the problem is dealt with as follow; 1. For the different type of machines that have probabilistics distribution of processing time and nan service time, man·machine assignment problem is solved by heuristic method using expected time value if machine. 2. Since each related time is a random variable, the performance of the optimal assignment obtained from the above method is verified through monte carlo simulation method. 3. The above procedures are programed by BASIC language to use easily and rapidly in the personal computer. The result of this study can contribute to productivity enhancement by increasing the efficiencies of both operators and machines.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.3
• /
• pp.329-338
• /
• 2007

This paper presents a dispatching algorithm for nonidentical parallel machines problem considering rework, sequence dependent setup times and release times. For each pair of a machine and a job type, rework probability of each job on a machine can be known through historical data acquisition. The heuristic scheduling scheme named by EDDR (Earliest Due Date with Rework probability) algorithm is proposed in this paper making use of the rework probability. The proposed dispatching algorithm is measured by two objective function value: 1) total tardiness and 2) the number of reworked jobs, respectively. The extensive computational results show that the proposed algorithm gives very efficient schedules superior to the existing dispatching algorithms.

• Asia pacific journal of information systems
• /
• v.1 no.1
• /
• pp.117-145
• /
• 1991

IS changeback is regarded as an offective way to control the usage of computers and communication systems which are very much limited resources and whose costs are very high, In this paper, the problem of combining the optimal chargeback system which guarantees the efficiency with the Rawls'(1971) concept of fairness. Primary conclusion of this paper is that if the value function which represents the contributions of IS user to the firm's profit is evidit and there is no uncertainty about this contribution information, optimality can be achived without any loss of fairness using full cost allocation pricing. But if there is no significant differences among contribution of each user and there is no significant differences among users because of the managerial arbitrariness, From this point of view contingent chargeback system with which manager can find the golden middle between optimality and fairness by adjusting the 'efficiency coefficient' according to his/her organizational characterisics and environments is proposed. A heuristic of finding the appropriate efficiency coefficient is also suggested.

• International Journal of Computer Science & Network Security
• /
• v.23 no.1
• /
• pp.25-32
• /
• 2023

Decision-making refers to identifying the best alternative among a set of alternatives. When a set of criteria are involved, the decision-making is called multi-criteria decision-making (MCDM). In some cases, the involved criteria may be prioritized by the human decision-maker, which determines the importance degree for each criterion; hence, the decision-making becomes prioritized multi-criteria decision-making. The essence of prioritized MCDM is raking the different alternatives concerning the criteria and selecting best one(s) from the ranked list. This paper introduces a generic multi-level algorithm for ranking multiple alternatives in prioritized MCDM problems. The proposed algorithm is implemented by a decision support system for selecting the most critical short-road requests presented to the transportation ministry in the Kingdom of Saudi Arabia. The ranking results show that the proposed ranking algorithm achieves a good balance between the importance degrees determined by the human decision maker and the score value of the alternatives concerning the different criteria.

• Advances in nano research
• /
• v.12 no.3
• /
• pp.263-279
• /
• 2022

In this research, the physical education training quality was investigated using the entropy model to compute variance associated with a random value (a strong tool). The entropy and undefined estimation principles are used to extract the greatest entropy of information dependent on the index system. In the study of tennis motion tracking from a dynamic viewpoint, such stages are utilized to improve the perception of the players' achievement (Lv et al. 2020). Six female tennis players served on the right side (50 cm from the T point). The initial flat serve from T point was the movement under consideration, and the entropy was utilized to weigh all indications. As a result, a multi-index measurement vector is stabilized, followed by the confidence level to determine the structural plane establishment range. As a result, the use of the unascertained measuring technique of information entropy showed an excellent approach to assessing athlete performance more accurately than traditional ways, enabling coaches and athletes to enhance their movements successfully.

• The Journal of the Korea Contents Association
• /
• v.16 no.10
• /
• pp.1-17
• /
• 2016

Recently, although many government agencies, including the Korea Tourism Organization, have been operating two-way interactive online idea proposal communities in order to reflect the various ideas of citizens in business, the utilization rate is still extremely low due to the lack of public's understandings and management's commitments. Therefore, based on previous studies on the characteristics of information quality, this research (1) derives key factors constituting idea quality in the context of online idea proposal communities, (2) classifies them into the content cues (value-added, relevancy, originality, and completeness) and the non-content cue (amount of writing) according to the heuristic-systematic model, and (3) finally validates how these content/non-content cues influence the knowledge adoption of administrators in an online idea proposal community. The findings of the structural equation modeling analysis with all of the 240 completed idea proposals in the 'Tourism Idea Bank' of Korea Tourism Organization reveal that, among content cues, value-added, relevancy, and originality have a significant effect on knowledge adoption. Moreover, it is also found that amount of writing as a non-content cue has a positive moderation effect on the relationships between originality and knowledge adoption.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.5
• /
• pp.1233-1246
• /
• 2018

With the proliferation of smart mobiles, disassembly techniques for position-independent code (PIC) composed of ARM architecture instructions in computer security are becoming more important. However, existing techniques have been studied on x86 architecture and are focused on solving problems of non-PIC and generality. Therefore, the accuracy of the collected address information is low to apply to advanced security technologies such as binary measurement. In this paper, we propose a disassembly technique that reflects the characteristics of PIC composed of ARM instructions. For accuratly collecting traceable addresses, we designed value-set analysis having symbol-form domain. To solve the main problem of disassembly, we devised a heuristic using the characteristics of the code generated by the compiler. To verify the accuracy and effectiveness of our technique, we tested 669 shared libraries and executables in the Android 8.1 build, resulting in a total disassembly rate of 91.47%.