• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.75-88
• /
• 1996

This paper presents an efficient heuristic technique for minimizing the objectives related to tardiness such as total tardiness, maximum tardiness and root mean of tardiness in the job shop scheduling. The heuristic technique iteratively improves an active schedule through exploring the schedule's neighborrhood, using operation move methods. The move operatio is defined on an active chain of tardy jobs in the active schedule. To find the move operations which have a high probability of reducing tardiness, we develop move methods by exploiting the properties of active chains. Our technique is compared with the two existing heuristic techniques, that is, MEHA(Modified Exchange Heuristic Algorithm) and GSP(Global Scheduling Procedure) under the various environmental with the three levels of due date tightness and several sized problems. The experimental results show that the proposed technique outperforms the two exissting techiques in terms of solution quality and computation time.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.46-49
• /
• 1996

This paper presents a multi-pass heuristic for job shop scheduling with due dates. The proposed heuristic iteratively improves solutions based on operation due dates. To find a good solution efficiently, a method for searching the neighborhood of current schedule is developed. The heuristic is compared with two existing heuristics as well as several dispatching rules in terms of solution quality and computation time. The experimental results show that the proposed approach is promising.

• Journal of Korean Institute of Industrial Engineers
• /
• v.23 no.1
• /
• pp.55-76
• /
• 1997

This paper presents a heuristic solution for the three dimensional container loading problem with boxes which are different in size. The container loading problem is formulated as a zero-one mixed integer programming model whose objective is to maximize the container utilization. Due to its problem complexity, we propose a heuristic based on layered loading technique. Also, presented is a way to achieve the weighting balance of the stacked boxes. A micro-computer based program is developed which generates container loading pattern provided by the proposed heuristic. The results are displayed by computer-graphic. To evaluate the performance of the proposed heuristic, computational experiments are performed. The results indicate that in most of the cases the proposed heuristic performs better than an existing heuristic in terms of the container utilization.

• Korean Management Science Review
• /
• v.10 no.2
• /
• pp.79-91
• /
• 1993

Strategic decisions related to the design of a physical distribution system can be classified into three basic components : facility location, transportation, inventory decisions. In this research the interdependence of those decisions are expressed in a mathematical model such that the total relevant cost of the system is minimized. We suggested a heuristic technique for solving the model. In broad terms, our solution technique combines a heuristic method for determining which candidate DCs to open and an exact method for minimizing costs given a set of open DCs. And we also developed a decision supporting package for the design of a physical distribution system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.2
• /
• pp.92-101
• /
• 2002

The Job Shop Scheduling Problem(JSSP) is concerned with schedule of m different machines and n jobs where each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine. The purpose of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the large scale job shop scheduling. The proposed heuristic method is based on a Tabu Search(TS) and on a Constraint Satisfaction Technique(CST). In this paper, ILOG libraries is used to embody the job shop model, and a CST is developed for this model to generate the increased solution. Then, TS is employed to overcome the increased search time of CST on the increased problem size md to refine the next-current solution. Also, this paper presents the new way of finding neighbourhood solution using TS. On applying TS, a new way of finding neighbourhood solution is presented. Computational experiments on well known sets of MT and LA problem instances show that, in several cases, our approach yields better results than the other heuristic procedures discussed In literature.

• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.91-97
• /
• 2002

This paper describes a heuristic search technique carrying out collision avoidance for Autonomous Underwater Vehicles(AUVs). Fuzzy relational products are used as the mathematical implement for the analysis and synthesis of relations between obstacles that are met in the navigation environment and available candidate nodes. In this paper, we propose a more effective evaluation function that reflects the heuristic information of domain experts on obstacle clearance, and an advanced heuristic search method performing collision avoidance for AUVs. The search technique adopts fuzzy relational products to conduct path-planning of intelligent navigation system. In order to verify the performance of proposed heuristic search, it is compared with $A^*$ search method through simulation in view of the CPU time, the optimization of path and the amount of memory usage.

• Journal of the military operations research society of Korea
• /
• v.13 no.1
• /
• pp.101-115
• /
• 1987

This paper presents an optimization based heuristic algorithm for a tour bus scheduling problem where buses consist of various kinds of sightseeing and commutation services. First, this algorithm transforms the prolem into a vehicle routing problem on whose nodes denote trips and arcs denote connections between trips. Second, a greedy heuritic routing technique is applied to find a good feasible bus-route set. Then the greedy feasible solution is improved by the simplex method using column generation technique. The algorithm provides a better near-optimal solution which gives much reductions in the total tour distance and the number of tour buses.

• Korean Management Science Review
• /
• v.11 no.1
• /
• pp.91-106
• /
• 1994

In mixed model assembly lines, products are assembled seqeuntially that have different combination of options specified by customers. In just in time (JIT) environment, production smoothing becomes an important issue for sub-lines which supply the necessary parts to each workstation of the assembly line. Another important issue is to avoid line stopping caused by work overload in workstations. To find a sequence which minimizes the costs associated with line stoppage and the option parts inventory level, a nonlinear mixed integer programming is formulated. Recognizing the limit of the Branch and Bound technique in large sized problems, a heuristic solution procedure is proposed. The performance of the heuristic is compared with the Branch and Bound technique through randomly generated test problems. The computational results indicate that on the average the heuristic solutions deviate approximately 3.6% from the optimal solutions.

• Journal of information and communication convergence engineering
• /
• v.16 no.4
• /
• pp.264-270
• /
• 2018

In our research study, we aim at optimizing multiple load in cloud, effective resource allocation and lesser response time for the job assigned. Using Hadoop on datacenter is the best and most efficient analytical service for any corporates. To provide effective and reliable performance analytical computing interface to the client, various cloud service providers host Hadoop clusters. The previous works done by many scholars were aimed at execution of workflows on Hadoop platform which also minimizes the cost of virtual machines and other computing resources. Earlier stochastic hill climbing technique was applied for single parameter and now we are working to optimize multiple parameters in the cloud data centers with proposed heuristic hill climbing. As many users try to priorities their job simultaneously in the cluster, resource optimized workflow scheduling technique should be very reliable to complete the task assigned before the deadlines and also to optimize the usage of the resources in cloud.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.54 no.9
• /
• pp.531-538
• /
• 2005

This paper proposes an expert system which is able to enhance the accuracy and productivity by determining the test strategy based on heuristic rules for test of the hybrid electronic circuit board producted massively in production line. The test heuristic rules are obtained from test system designer, test experts and experimental results. The guarding method separating the tested device with circumference circuit of the device is adopted to enhance the accuracy of measurements in the test of analog devices. This guarding method can reduce the error occurring due to the voltage drop in both the signal input line and the measuring line by utilizing heuristic rules considering the device impedance and the parallel impedance. Also, PSA(Parallel Signature Analysis) technique Is applied for test of the digital devices and circuits. In the PSA technique, the real-time test of the high integrated device is possible by minimizing the test time forcing n bit output stream from the tested device to LFSR continuously. It is implemented in Visual C++ computer language for the purpose of the implementation of the inference engine using the dynamic memory allocation technique, the interface with the electronic circuit database and the hardware direct control. Finally, the effectiveness of the builded expert system is proved by simulating the several faults occurring in the mounting process the electronic devices to the surface of PCB for a typical hybrid electronic board and by identifying the results.