• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.3
• /
• pp.203-217
• /
• 1994

In this paper we develop an exponentialization procedure for the modelling of open FMS networks with general processing time at each station and limited buffer size. By imposing a reasonable assumption on the solution set, the nonlinear equation system for the exponentialization procedure is formulated as a variational inequality problem and the solution existence is examined. The efficient algorithm for the nonlinear equation system is developed using linearized Jacobi approximation method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.177-198
• /
• 1994

We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.147-158
• /
• 1995

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solution of a bicriterion linear program. We show that problem (P) can arise in a variety of practical situations. Since the efficient set is in general a nonoconvex set, problem (P) can be classified as a global optimization problem. The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations. The algorithm can be easily implemented using only linear programming method.

• Industrial Engineering and Management Systems
• /
• v.4 no.2
• /
• pp.123-128
• /
• 2005

The author derives a general explicit formula and presents an heuristic algorithm for solving Baker’s model. The examples show that this new approximate solution procedure for determining near optimum inspection intervals is more accurate than the ones suggested by Chung (1993) and Vaurio (1994), and is more efficient computationally than the one suggested by Hariga (1996). The construction and solution of the simplest profit model for an exponential failure distribution were presented in Baker (1990), and approximate analytical results were obtained by Chung (1993) and Vaurio (1994). The author will therefore mainly devote the following discussion to the problem of further approximating optimum inspection intervals.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.3
• /
• pp.101-111
• /
• 1993

The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.1-12
• /
• 1996

This paper deals with production scheduling of block assembly shop in shipbuilding company. The Objectives of the schedule are leveling of daily total workload and fair assignment of workload to each department of the shop. Optimizing the objectives, we consider some restrictions which consisit of block due dates, workability of each department, and space restriction. We formulate the problem in mathematical form. But the model is too complex to find the optimal solution (the problem is NP-complete) and we use the genetic algorithm to find a good solution.

• Management Science and Financial Engineering
• /
• v.21 no.2
• /
• pp.25-30
• /
• 2015

This short article compares different solution methods for a basic RBC model (Hansen, 1985). We solve and simulate the model using two main algorithms: the methods of perturbation and projection, respectively. One novelty is that we offer a type of the hybrid method: we compute easily a second-order approximation to decision rules and use that approximation as an initial guess for finding Chebyshev polynomials. We also find that the second-order perturbation method is most competitive in terms of accuracy for standard RBC model.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.7 no.1
• /
• pp.11-16
• /
• 1982

A method is described for the solution of a linearly constrained program with parametric nonlinear objective function. The algorithm proposed in this paper may be regarded as an extension of the simplex method for parametric linear programming. Namely, it specifies the basis at each stage such that feasibility ana optimality of the original problem are satisfied by the optimal solution of the reduced parametric problem involving only nonbasic variables. It is shown that under appropriate assumptions the algorithm is finite. Parametric procedures are also indicated for solving each reduced parametric problem by maintaining the Kuhn-Tucker conditions as the parameter value varies.

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

• Proceedings of the Safety Management and Science Conference
• /
• 2002.05a
• /
• pp.237-241
• /
• 2002

This paper deals with the problem of determining the buyer's economic lot sizing policy for exponentially deteriorating products under trade credit. It is also assumed that the ordering cost consists of a fixed set-up cost and a freight cost, where the freight cost has a quantity discount offered due to the economies of scale. We formulate the mathematical model and the solution algorithm is developed based on the properties of an optimal solution.