• Management Science and Financial Engineering
• /
• v.22 no.1
• /
• pp.5-12
• /
• 2016

We consider a time-cost tradeoff problem with multiple milestones under a chain precedence graph. In the problem, some penalty occurs unless a milestone is completed before its appointed date. This can be avoided through compressing the processing time of the jobs with additional costs. We describe the compression cost as the convex or the concave function. The objective is to minimize the sum of the total penalty cost and the total compression cost. It has been known that the problems with the concave and the convex cost functions for the compression are NP-hard and polynomially solvable, respectively. Thus, we consider the special cases such that the cost functions or maximal compression amounts of each job are identical. When the cost functions are convex, we show that the problem with the identical costs functions can be solved in strongly polynomial time. When the cost functions are concave, we show that the problem remains NP-hard even if the cost functions are identical, and develop the strongly polynomial approach for the case with the identical maximal compression amounts.

• Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.88-95
• /
• 2014

Because the cost of performance testing using actual products is expensive, manufacturers use lower-cost computer-aided design simulations for this function. In this paper, we propose using hexahedral meshes, which are more accurate than tetrahedral meshes, for finite element analysis. We propose automatic hexahedral mesh generation with sharp features to precisely represent the corresponding features of a target shape. Our hexahedral mesh is generated using a voxel-based algorithm. In our previous works, we fit the surface of the voxels to the target surface using Laplacian energy minimization. We used normal vectors in the fitting to preserve sharp features. However, this method could not represent concave sharp features precisely. In this proposal, we improve our previous Laplacian energy minimization by adding a term that depends on multi-normal vectors instead of using normal vectors. Furthermore, we accentuate a convex/concave surface subset to represent concave sharp features.

• Journal of Industrial Technology
• /
• v.29 no.A
• /
• pp.183-190
• /
• 2009

This study deals with the single-product production and transportation model with dynamic demand over finite time horizon, in which the optimal production(order) quantities, transportation modes and the number of each vehicles are determined simultaneously. The finite number of identical vehicles with capacity constraint is given to each mode. Production and transportation costs are assumed to be concave function for generality. For a relevant mathematical model formulated, the theorems and properties are discussed to present the efficient algorithm. A numerical example is solved to illustrate the algorithm developed.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.1
• /
• pp.110-117
• /
• 2018

Machines and facilities are physically or chemically degenerated by continuous usage. One of the results of this degeneration is the process mean shift. By the result of degeneration, non-conforming products and malfunction of machine occur. Therefore a periodic preventive resetting the process is necessary. This type of preventive action is called 'preventive maintenance policy.' Preventive maintenance presupposes that the preventive (resetting the process) cost is smaller than the cost of failure caused by the malfunction of machine. The process mean shift problem is a field of preventive maintenance. This field deals the interrelationship between the quality cost and the process resetting cost before machine breaks down. Quality cost is the sum of the non-conforming item cost and quality loss cost. Quality loss cost is due to the deviation between the quality characteristics from the target value. Under the process mean shift, the quality cost is increasing continuously whereas the process resetting cost is constant value. The objective function is total costs per unit wear, the decision variables are the wear limit (resetting period) and the initial process mean. Comparing the previous studies, we set the process variance as an increasing concave function and set the quality loss function as Cpm+ simultaneously. In the Cpm+, loss function has different cost coefficients according to the direction of the quality characteristics from target value. A numerical example is presented.

• Journal of the Korean housing association
• /
• v.22 no.6
• /
• pp.51-60
• /
• 2011

The maintenance cost depends on various factors such as building volume, floor area, number of household and so on. The maintenance cost of the apartment housing is affected by the maintenance type, building physical factor, sociogeographic aspects. Among these, the maintenance characteristics is represented and made up by the total floor area and number of household which means main factor to provide the building scale roughly. In this paper, it aimed at modelling the estimation function of the maintenance cost with the total floor area and number of household and analyzing the elasticity of the two factors. Although items of maintenance cost are various in general cost, repair cost and so on, we classified these items into the 5 categories. 5 categories are a general cost, a facility maintenance cost, a utilization cost, insurance and sanitary cost. The estimation function used a power function and it has better goodness-offitness than any other estimation methods in statistics. A power function has a three curve types with concave and convex and linear style to the origin.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.309-312
• /
• 2007

We consider a proportionate flow shop problem with controllable processing times. The objective is to minimize the sum of total completion time and total compression cost, in which the cost function of compressing the processing times is non-decreasing concave. We show that the problem can be solved in polynomial time by reducing it to a polynomially solvable 0-1 unconstrained quadratic program.

• Korean Management Science Review
• /
• v.10 no.1
• /
• pp.193-205
• /
• 1993

This paper presents a mathematical model for a class of vertical integration decisions. The problem structure of interest consists of raw material vendors, components suppliers, components processing plants, final product (assembly) plants and external components buyers. Economic feasibility of operating components plants instead of keeping outside suppliers is our major concern. The model also determines assignment of product lines and production volumes to each open plant considering the cost impacts of economies of scale and plant complexity. The problem formulation leads to a concave, mixed integer mathematical program. Given the state of the art of nonlinear programming techniques, it is often not possible to find global optima for reasonably sized such problems. We developed an optimization solution algorithm within the framework of Benders decomposition for the case of a piecewise linear concave cost function. It is shown that our algorithm generates optimal solutions efficiently.

• Korean Journal of Cognitive Science
• /
• v.1 no.2
• /
• pp.317-346
• /
• 1989

A congnitive shape decomposition method that agrees with human intuition is proposed for the conceptual recognition from sillouettes of objects. Descriptions specifying the structure of shape in terms of meaningful parts and relations have cognitive power and anthropomorphism. In general, man-made objects have a lot of collinear lines and regularity. For the cognitive decomposition of man-made objects, many heuristic rules based on the cognitive experimentation are applied on the context of collinerarity and regularity. The cognitive shape decomposition for the natural shape is carried out by analyzing the possible configuraitions of vertices and line segments for one concave vertex. A cost function for the configuation is designed by weighted sum of five criteria such as, the length of split line segment, the number of split line segments at concave vertex, the proximity of concave vertex, and the correspondence of vertices. These criteria are vased on the property of human perception such as proximtiy, symmetry, and simplicity. The most promising vertex os selected among three set of visible vertices by evaluating the cost function. A number of experiments conducted on the different types of shapes shows that the results correspond with human intuition.

• Journal of the Korea Safety Management & Science
• /
• v.15 no.1
• /
• pp.77-85
• /
• 2013

In the location science, environmental effect becomes a new main consideration for site selection. For the unwanted facility location selection, decision makers should consider the cost of resolving the environmental conflict. We introduced the negative influence cost for the facility which was inversely proportional to distance between the facility and residents. An unwanted facility location problem was suggested to minimize the sum of the negative influence cost and the transportation cost. The objective cost function was analyzed as nonlinear type and was neither convex nor concave. Three GRASP (Greedy Randomized adaptive Search Procedure) methods as like Random_GRASP, Epsilon_GRASP and GRID_GRASP were developed to solve the unwanted facility location problem. The Newton's method for nonlinear optimization problem was used for local search in GRASP. Experimental results showed that quality of solution of the GRID_GRASP was better than those of Random_GRASP and Epsilon_GRASP. The calculation time of Random_GRASP and Epsilon_GRASP were faster than that of Grid_GRASP.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.24-30
• /
• 1988

We study the optimal allocation of machines and pallets in a class of manufacturing systems. The FMS is modeled as a closed queueing network with balanced loading of the stations. An Algorithm is developed, which exploits the properties of the throughput function and solves the allocation problem for increasing concave profit and convex cost. We also study the more general case of allocating machines and pallets among a set of FMSs. A dynamic programming approach is developed, which solves the problem with O(M$^{3}$N$^{2}$) operations.