• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.51-61
• /
• 2002

By using the arrival time approach of Chae et at. [6], we derive various performance measures including the queue length distributions (in PGFs) and the waiting time distributions (in LST and PGF) for both M$^{x}$ /G/1 and Geo$^{x}$ /G/1 queueing systems, both under the assumption that the server, when it becomes idle, takes multiple vacations up to a random maximum number. This is an extension of both Choudhury[7] and Zhang and Tian [11]. A few mistakes in Zhang and Tian are corrected and meaningful interpretations are supplemented.

• International conference on construction engineering and project management
• /
• 2013.01a
• /
• pp.509-512
• /
• 2013

An inappropriate space zoning plan causes the unnecessary transportation of construction material and equipment among work areas and increases the disorder of work space. Space zoning is an essential operation management technique which contributes to reduce the process and/or operation idle-time. This paper introduces a method that computes the idle-times between construction operations (or processes) by using Web-CYCLONE. It allows computing with idle-times that affect the construction productivity. Using the idle time between operations and between processes, it computes the optimal number of zones and finds the optimal combination of zones that minimize the idle times. The method contributes to minimize the idle times relative to the operation schedule using complete enumeration. This paper presents the system prototype in detail. A case study is presented to demonstrate the system and verifies the validity of the model. It allows a project manager to establish space zoning plan that effectively segregates a project into optimal number of construction zones and to assign the constrained resources (e.g., laborer, equipment).

• Research in Mathematical Education
• /
• v.14 no.3
• /
• pp.195-209
• /
• 2010

Utilizing a structure of operations known as Dissection-Motion-Operations (DMO), a set of mathematics propositions or area-formulas in school mathematics will be introduced through shape-to-shape transforms. The underlying theme for DMO is problem-solving through visual reasoning and proving manipulatively or electronically vs. rote learning and memorization. Visual reasoning is the focus here where two operations that constitute DMO are utilized. One operation is known as Dissection (or Decomposition) operation that operates on a given region in 2D or 3D and dissects it into a number of subregions. The second operation is known as Motion (or Composition) operation applied on the resultant sub-regions to form a distinct area (or volume)-equivalent region. In 2D for example, DMO can transform a given polygon into a variety of new and distinct polygons each of which is area-equivalent to the original polygon (cf [Rahim, M. H. & Sawada, D. (1986). Revitalizing school geometry through Dissection-Motion Operations. Sch. Sci. Math. 86(3), 235-246] and [Rahim, M. H. & Sawada, D. (1990). The duality of qualitative and quantitative knowing in school geometry, International Journal of Mathematical Education in Science and Technology 21(2), 303-308]).

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.2
• /
• pp.31-39
• /
• 1999

A new approximation method for finding the steady-state probabilities of the number of customers present in queueing systems with Poisson arrivals and two servers with different deterministic service times with infinite waiting room capacity is developed. The major assumption made for the approximation is that the residual service times of the servers have mutually independent uniform distributions with densities equal to the reciprocals of the respective service times. The method reflects the heterogeneity of the servers only through the ratio of their service times, irrespective of the actual magnitudes and difference. The transition probability matrix is established and the steady-state probabilities are found for a variety of traffic intensities and ratios of the two service times; also the mean number of customers present in the system and in the queue, and server utilizations are found and tabulated. The method was validated by simulation and turned out to be very sharp.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.1-7
• /
• 2004

We demonstrate in this paper that the level crossing technique can be applied to such a system that not only the state vector is two-dimensional but Its two components are heterogeneous. As an example system, we use the GI-G/c/K queue whose state vector consists of the number of customers in the system and the total unfinished work.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.281-283
• /
• 2006

In this paper, we consider the problem of batch processing of orders, where either a single order or a pair of orders which satisfies specific conditions may be grouped in the same batch. The objective of the problem is to minimize the number of batches formed to accommodate all orders. We prose an approach based on a Known algorithm proven to be optimal for special class of problems with tree structure and show the approach to have the worst case ratio of $2-{\frac{2}{n}}$

• Journal of the military operations research society of Korea
• /
• v.9 no.1
• /
• pp.75-85
• /
• 1983

This study is concerned with the problem of routing vehicles stationed at a central depot to supply customers with known demands, in such a way as to minimize the total distance travelled. The problem is referred to as the vehicle routing problem and is a generalization of the multiple traveling salesmen problem that has many practical applications. A branch-and-bound algorithm for the exact solution of the vehicle routing problem is presented. The algorithm finds the optimal number of vehicles as well as the minimum distance routes. A numerical example is given.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.193-196
• /
• 2000

In the turbine-blade manufacturing industry, turbine-blades are machined and then are assembled to form a circular roll of blades. The roll of blades should be balanced as much as possible, since otherwise the efficiency of the turbine generator might degrade. We propose a heuristic method for balancing blades based on the number partitioning algorithm. The proposed method outperformed existing methods remarkably in terms of the accuracy with a negligible increase in the running time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.17 no.1
• /
• pp.113-126
• /
• 1992

It is discussed how a supplier should design a quantity discount pricing schedule for multiple buyers. It is emphasized that nor only the supplier's surplus but also each buyer's surplus resultant from quantity discount should be considered in designing price schedule. It is shown that if the supplier's quantity pricing schedule is based on his/her profit function, each buyer's surplus may be maximized. And it is also shown that when the supplier's main benefit comes from the reduced number of setups, the incremental discount schedule satisfies the requirement. Formulas to determine values of parameters of the incremental discount schedule are provided.

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

This paper studies to develop the procedure which is combined by the progressive goals and progressive weights generation method. This procedure minimizes the number of questions the decision maker has to make, and also satisfies the generated minimum goal of each objective function. With the procedure developed, we are able to improve the previous multiple objective linear programming techniques in two points.