• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.3
• /
• pp.87-101
• /
• 2013

The purpose of this paper is to analyze supplier's optimal decision of the buyback price facing irrational retailers. It has been known that retailers show irrational ordering behaviors, such as pull-to-center effect. We model the retailer's pull-to-center behavior and derive the supplier's optimal buyback price considering the retailer's bounded rationality. The result shows that the supplier's profit can be significantly improved exploiting the retailer's irrationality in the ordering behavior.

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

In this paper we study bounds for characteristics of stationary waiting times in (max, +)-linear systems with a Poisson arrival process. which are prevalent in manufacturing systems, kanban systems, cyclic and acyclic fork-and-join type systems, finite or infinite capacity tandem queues with various kinds of blocking, transportation systems, and telecommunication networks, and so on. Recently, some results on series expansion for characteristics, such as higher moments, Laplace transform, and tail probability, of transient and stationary waiting times in a class of (max, +)-linear systems via Taylor series expansions have been studied. In order to overcome the computational complexity in those results, we consider bounds for characteristics of stationary waiting times using valuable stochastic ordering results. Some numerical examples are also provided.

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

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands and the product is provided to the warehouse via procurement ordering from any manufacturing plant or market The Problem is formulated as an Mixed Integer Programming with the objective function of minimizing the sum of inventory holding cost (at the warehouse and retailers), and transportation cost and procurement ordering cost at the warehouse, subject to inventory-balancing constraints, ordering constraints, vehicle capacity constraints and transportation time constraints. The problem is Proven to be NP-hard. Accordingly, a Lagrangean heuristic procedure is derived and tested for its effectiveness through computational experiments with some numerical instances.

• Journal of the Korea Society for Simulation
• /
• v.5 no.1
• /
• pp.81-90
• /
• 1996

In this paper, we propose a new events ordering mechanism for the optimistic distributed simulation of DEVS models. To simulate DEVS models in a distributed environment, a synchronization protocol is required for correct simulation. Time Warp is the most well-known optimistic synchronization protocol for distributed simulation. However, employing the Time Warp protocol in distributed simulation of DEVS models incurs events ordering problem due to the semantic difference between Time Warp and DEVS, Thus, to resolve such semantic difference, we devise the time-and-priority-stamp and $\varepsilon$ -delay schemes. The proposed schemes can order simultaneous events correctly in Time Warp-based distributed simulation of DEVS models.Time Warp and DEVS, Thus, to resolve such semantic difference, we devise the time-and-priority-stamp and $\varepsilon$ -delay schemes. The proposed schemes can order simultaneous events correctly in Time Warp-based distributed simulation of DEVS models.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.118-126
• /
• 2009

This research investigates the problem of minimizing setup costs in resequencing jobs having first-in, first-out(FIFO) constraints at conveyorized production or assembly systems. Sequence changing at conveyor junctions in these systems is limited due to FIFO restriction. We first define the general problem of resequencing jobs to workstations satisfying precedence relationships between jobs(Generalized Sequential Ordering Problem, GSOP). Then we limit our scope to FIFO precedence relationships which is the conveyor selection problem at a diverging junction(Diverging Sequential Ordering Problem, DSOP), modeling it as a 0-1 integer program. With the capacity constraint removed, we show that the problem can be modeled as an assignment problem. In addition, we proposed and evaluated the heuristic algorithm for the case where the capacity constraint cannot be removed. Finally, we discuss the case study which motivated this research and numerical results.

• Proceedings of the Polymer Society of Korea Conference
• /
• 2006.10a
• /
• pp.207-208
• /
• 2006

Here, we discuss various thermodynamic factors that affect the design of nanomaterials based on block copolymers. It is well known that the ordering behavior is determined by composition, chain size N, and the ubiquitous Flory. However, the recent discovery of ordering upon heating, immisibility loops, and baroplasticity addresses a clear need for further microscopic interpretation of such. in order to help to design nanomaterials at aimed purposes. Employing a perturbed hard sphere chain model, the molecular factors such as self and cross-interactions, free space distribution, and directional interactions are incorporated in. It is shown that not only typical ordering phenomena, but also the recent observations just mentioned are all described through this unified way.

• Journal of Information Display
• /
• v.11 no.4
• /
• pp.144-148
• /
• 2010

In this paper, vertically aligned (VA) liquid crystal (LC) modes were investigated using the alkyl chain ordering effect of self-assembled monolayers (SAMs) prepared on the anisotropic inorganic surface. On the anisotropic surface prepared through oblique ion beam irradiations, the SAM molecules are adsorbed, producing macroscopic alkyl chain ordering, which can determine the pretilt direction of the vertically aligned LC molecules through the intermolecular interactions on the surface.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.11
• /
• pp.1449-1457
• /
• 1997

Since a non-nulling method of five-hole probes is valid only when the flow angle is within the calibrated angle range, it can not be used in a complex flow field. Full angle range pressure coefficient maps show that widely used nulling methods do not guarantee correct alignment of the probe with the flow direction in the unknown complex flow field. Zone decision method and features of zone map were studied by investigating the full angle range pressure coefficient maps. A reliable and efficient new nulling algorithm using zone decision by pressure ordering is proposed and verified. Since the zone decision method by pressure ordering can decide whether the flow is within the calibration angle range or not, it is useful in wide angle nonnulling methods, too.

• Language and Information
• /
• v.13 no.1
• /
• pp.39-56
• /
• 2009

This paper investigates ordering alternation phenomena in Korean using the dative construction data from Sejong Corpus of Modern Korean (Kim, 2000). The paper first shows that syntactic weight and information structure are distinct and independent factors that influence word order in Korean. Moreover, it reveals that heaviness and givenness compete each other and exert diverging effects on word order, which contrasts the converging effects of these factors shown in word orders of right-branching languages like English. The typological variation of syntactic weight effect poses interesting theoretical and empirical questions, which are discussed in relation to processing efficiency in ordering.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.227-234
• /
• 2001

In this paper we propose a block-type parallel preconditioner for solving large sparse nonsymmetric linear systems, which we expect to be scalable. It is Multi-Color Block SOR preconditioner, combined with direct sparse matrix solver. For the Laplacian matrix the SOR method is known to have a nondeteriorating rate of convergence when used with Multi-Color ordering. Since most of the time is spent on the diagonal inversion, which is done on each processor, we expect it to be a good scalable preconditioner. We compared it with four other preconditioners, which are ILU(0)-wavefront ordering, ILU(0)-Multi-Color ordering, SPAI(SParse Approximate Inverse), and SSOR preconditiner. Experiments were conducted for the Finite Difference discretizations of two problems with various meshsizes varying up to $1025{\times}1024$. CRAY-T3E with 128 nodes was used. MPI library was used for interprocess communications, The results show that Multi-Color Block SOR is scalabl and gives the best performances.