• IE interfaces
• /
• v.21 no.1
• /
• pp.8-17
• /
• 2008

A new search procedure, VLT(Vertex Line Tracing) heuristic, for two dimensional irregular shapes nesting problem was suggested in this study. The VLT heuristic was suggested to the nesting problem to overcome disadvantages of the existing NFP(No-Fit-Polygon) method. This VLT heuristic was compared with the results of the existing benchmark problems suggested by Albano, Hopper, and Burke. The results of the VLT heuristic give efficient solutions in the point of the scrap ratio and computation time. A computer program, NestLogic, using C++ for VLT heuristic was also developed for this nesting problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.255-264
• /
• 1996

This Paper presents a heuristic algorithm for machine-part group formation considering part production information (Production volume, roution sequence, unit operation time, facility size) in cellular manufacturing logistics system. In general, factory space is restricted within limited size when cells are located. A twofold heuristic algorithm is developed for considering factory space restrictions of located cells. The first phase is a aggregation procedure to minimize inter cell movement for satisfactoring space restriction. The second phase is a rearrangement procedure to maximize line balancing efficiency between machines within the cell and non assigned machine during first phase. Numerical example is presented to verify the efficiency of proposed algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.12 no.2
• /
• pp.36-41
• /
• 1987

This paper presents a heuristic algorithm for solving the simple facility location problem. Its main procedure is essentially of 'add' type, which progressively selects facilities to open according to a certain criterion derived from the analysis of the linear programming dual. Computational experience with test problem from the literature is presented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.2
• /
• pp.215-215
• /
• 1988

This paper presents a fuzzy set theory based formulation and heuristic which will allow plant layout problems to be solved for more than two input goals with different weights. The heuristic combines a construction and improvement procedure to generate a good layout from the formulation. To test the effectiveness of the heuristic, a set of examples previously used by various authors is solved and the results are compared to those from other known heuristics. The comparison indicates that the proposed method performs well for each of seventeen classical test problems.

• Korean Management Science Review
• /
• v.13 no.2
• /
• pp.215-232
• /
• 1996

This paper presents a fuzzy set theory based formulation and heuristic which will allow plant layout problems to be solved for more than two input goals with different weights. The heuristic combines a construction and improvement procedure to generate a good layout from the formulation. To test the effectiveness of the heuristic, a set of examples previously used by various authors is solved and the results are compared to those from other known heuristics. The comparison indicates that the proposed method performs well for each of seventeen classical test problems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.199-207
• /
• 2010

In this paper considered is the provisioning quantity determination problem of consumable concurrent spare parts (CSP) of a new equipment system to minimize the procurement cost under the operational availability constraint. When a part fails, repair of the failed part is impossible and the part is replaced and cannibalization is allowed. The failure of a part is assumed to follow a Poisson process and the operational availability in CSP is defined. The solution procedure consists of two parts. Firstly, a heuristic algorithm is developed under the assumption that the failure rate is constant during the CSP period. Secondly, proposed is a simulation search procedure which improves the heuristic solution to the near optimal solution in a reasonable amount of time. An illustrative example is shown to explain the solution procedure.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.2
• /
• pp.74-79
• /
• 2012

An efficient separation heuristic for the rank-1 Chvatal-Gomory cuts for the binary knapsack problem is proposed. The proposed heuristic is based on the decomposition property of the separation problem for the fixedcharge 0-1 knapsack problem characterized by Park and Lee [14]. Computational tests on the benchmark instances of the generalized assignment problem show that the proposed heuristic procedure can generate strong rank-1 C-G cuts more efficiently than the exact rank-1 C-G cut separation and the exact knapsack facet generation.

• 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.

• Fashion & Textile Research Journal
• /
• v.18 no.2
• /
• pp.225-234
• /
• 2016

An online suit-customizing system for the special accessibility needs of wheelchair users should be developed because the demand for business suits by wheelchair users involved in economic activities has increased. This study develops a user interface an online customizing system for men's suits specialized for wheelchair users. This study used a five-step approach: (1) search for online men's suits customizing system in web porter sites, (2) select three sites based on three terms, (3) heuristic testing with five web specialists, (4) development of a system user interface based on suggestions for improvement from the heuristic test, (5) usability testing of the user interface prototype by 10 disabled men in wheelchairs. The interface of Company S had high ratings on interactivity, accessibility, informativeness, and consistency in the heuristic test results; subsequently, a user interface was developed based on suggestions for improvement from the heuristic test. This online user interface for customizing men's suits provides better usability to wheelchair users than existing online interfaces aimed at the non-disabled and disabled; consequently, this study contributes to the commercialization of an online customizing system for men's suits specializing in serving wheelchair users.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.44
• /
• pp.179-184
• /
• 1997

A solution procedure to minimize total carousel related costs has been developed under the carousel throughput rate and total storage capacity requirements. The carousel related costs include carousel facility costs which are proportional to the number of carousels and carousel operating costs which are directly related to the moving distances of carousels. The number of carousels is dependent upon the size of a carousel and the moving distances are determined by the size of a carousel, storage item assignment to each carousel, and the item positions in a carousel. When the storage/retrieval requirements for each storage item is equal, an optimal algorithm has been developed. When the storage/retrieval requirements is unequal, a heuristic solution procedure has been developed because of the complexity of the problem.