Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korean Operations Research and Management Science Society
Journal Basic Information
Journal DOI :
The Korean Operations and Management Science Society
Editor in Chief :
Volume & Issues
Volume 30, Issue 4 - Dec 2005
Volume 30, Issue 3 - Sep 2005
Volume 30, Issue 2 - Jun 2005
Volume 30, Issue 1 - Mar 2005
Selecting the target year
A Cost Optimization Problem on a 2 Level Transportation Network
Jung, Jae-Heon ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 3, 2005, Pages 1~15
In our model, a fleet of vehicles start from docking point to collect loads at the terminals assigned to the point Then the docking points are connected to the hub by primary vehicle routes starting at the hub. This vehicle visit all the docking points to collect the loads which have been collected by the secondary vehicles. Our goal Is to minimize the long-run cost of setting up the docking Points and vehicle operation cost by deciding the location of the docking points and the routes optimally. We propose an heuristic algorithm to solve this and tested it though various experiments.
Coordination Under Price Protection, Mid/End Life Returns, and Quantity Discount for a Three-Level Supply Chain
Lee, Chang-Hwan ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 3, 2005, Pages 17~39
The coordination of a three-level supply chain consisting of a supplier, a retailer, and a discount outlet (DCO) is studied here. We assume that the product is sold in two consecutive periods a Normal Sales Period (NSP) and a subsequent Clearance Salvage Period (CSP). A benchmark case is studied Initially in which the supply chain is coordinated by a s1n91e agent. Thus, the supplier the retailer, and the discount outlet design a common system that allows centralized decision making about stocking quantities, markdown time schedules, and policies on disposing of leftovers to deliver the greatest possible expected supply chain profit. Next, we consider a decentralized supply chain. Here, decisions are made without coordination. The objective is to maximize an individual party's expected profits. The focus of the study is on the following questions: what factors make the coordination an effective approach for the supply chain? How do we coordinate the supply chain so as to maximize the supply chain Joint expected profit? These and other related study issues are explored in this paper.
A Look-ahead Heuristic Algorithm for Large-scale Part-Machine Grouping Problems
Baek Jong-Kwan ; Baek Jun-Geol ; Kim Chang Ouk ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 3, 2005, Pages 41~54
In this paper, we consider a multi-objective machine cell formation problem. This problem Is characterized as determining part route families and machine cells such that total sum of inter-ceil part movements and maximum machine workload imbalance are simultaneously minimized. Together with the objective function, alternative part routes and the machine sequences of part routes are considered In grouping Part route families. Due to the complexity of the problem, a two-phase heuristic algorithm is proposed. And we developed an n-stage look-ahead heuristic algorithm that generalizes the roll-out algorithm. Computational experiments were conducted to verify the performance of the algorithm
A Genetic Algorithm for Integration of Process Planning and Scheduling in a Job Shop
Park, Byung-Joo ; Choi, Hyung-Rim ; Kang, Moo-Hong ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 3, 2005, Pages 55~65
In recent manufacturing systems, most jobs may have several process plans, such as alternative sequence of operations, alternative machine etc. A few researches have addressed the necessity for the integration of process planning and scheduling function for efficient use of manufacturing resources. But the integration problem is very difficult and complex. Many prior researches considered them separately or sequentially. It introduces overlapping or partial duplications in solution efforts. In this paper, Integration problem of jobs with multiple process plans in a job shop environment Is addressed. In order to achieve an efficient integration between process planning and scheduling by taking advantage of the flexibility that alternative process plans offer, we designed GA(Genetic Algorithm)-based scheduling method. The performance of proposed GA is evaluated through comparing integrated scheduling with separated scheduling in real world company with alternative machines and sequences of operations. Also, a couple of benchmark problems are used to evaluate performance. The integrated scheduling method in this research can be effectively epplied to the real case.
A Vehicle Dispatching for Dynamic Freight Transportation in Container Terminals
Koo Pyung-Hoi ; Lee Woon-Seook ; Koh Shie-Gheun ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 3, 2005, Pages 67~80
This paper deals with a container terminal where containers are discharged by quay cranes from a ship and transported by a fleet of vehicles to the terminal yard. Since container terminals are fully utilized in general, It is important to increase terminal throughput by discharging the containers out of the ship without any delay, At the operational level, it should be decided which vehicle transports which container. The vehicle dispatching decision should be carefully made since the container discharging time increases when the quay cranes wait idle for the vehicles. This paper presents vehicle dispatching heuristics with the objective of minimizing the total container discharging time. The heuristics are based on a network flow model and a look-ahead concept. Through some experiments, the performance of the dispatching methods is evaluated.
Study on the Effects of the Interactions between Demand and Supply Uncertainties on Supply Chain Costs
Park Sangwook ; Kim Soo-Wook ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 3, 2005, Pages 81~93
This paper models supply chain uncertainties in the dynamic Newsboy Problem context. The system consists of one supplier and one retailer who place an order to the supplier every period. Demand uncertainty is modeled as stochastic period demand, and supply uncertainty as the uncertainty in quantities delivered by the supplier. The supplier delivers exactly the amount ordered by the retailer with probability of
and the amount minus K with probability of
We formulate the problem as a dynamic programming problem and derive the first-order optimality condition. Through a numerical study, we measure the extent to which the cost decrease due to the reduction in supply uncertainty depends on the level of demand uncertainty. One of the most important findings In this paper is that this cost decrease is relatively small if demand uncertainty is kept high, and vice versa. We also backup this numerical result by analyzing the distribution of ending Inventory under the supply and demand uncertainties.
The Determinants of Trust and Participation Intention in Internet Auction : Model Generating Strategy Approach
Kwahk Kee-Young ; Kim Hyo-Jung ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 3, 2005, Pages 95~117
This research Investigates the determinants of customer Intention to participate In Internet auction. Based on technology acceptance and trust related studies, our research proposes a theoretical model consisting of factors such as perceived usefulness, perceived ease of use, institution based trust, beliefs on sellers, trusting beliefs, and participation Intention. For examining the relationships implied by the research model, a field study using a survey methodology for data collection was conducted. The data were analyzed using AMOS based on the structural equation modeling, a second-generation multivariate technique, which has gained distinct advantages over other technique. After some model modification according to model generating strategy approach, this study shows that trusting beliefs have significant effects on the participating intention in Internet auction site. In conclusion, Implications are discussed along with limitations and further research direction.
Location Area Design of a Cellular Network with Time-dependent Mobile flow and Call Arrival Rate
Hong Jung-Sik ; Jang Jae-Song ; Kim Ji-Pyo ; Lie Chang-Hoon ; Lee Jin-Seung ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 3, 2005, Pages 119~135
Design of location erea(LA) in a cellular network is to partition the network into clusters of cells so as to minimize the cost of location updating and paging. Most research works dealing with the LA design problem assume that the call. arrival rate and mobile flow rate are fixed parameters which can be estimated independently. In this aspect, most Problems addressed so far are deterministic LA design problems(DLADP), known to be NP hard. The mobile flow and call arrival rate are, however, varying with time and should be treated simultaneously because the call arrival rate in a cell during a day is influenced by the change of a population size of the cell. This Paper Presents a new model on IA design problems considering the time-dependent call arrival and mobile flow rate. The new model becomes a stochastic LA design problem(SLADP) because It takes into account the possibility of paging waiting and blocking caused by the changing call arrival rate and finite paging capacity. Un order to obtain the optimal solution of the LA design problem, the SIADP is transformed Into the DLADP by introducing the utilization factor of paging channels and the problem is solved iteratively until the required paging quality is satisfied. Finally, an illustrative example reflecting the metropolitan area, Seoul, is provided and the optimal partitions of a cell structure are presented.
Project Duration Estimation and Risk Analysis Using Intra-and Inter-Project Learning for Partially Repetitive Projects
Cho, Sung-Bin ;
Journal of the Korean Operations Research and Management Science Society, volume 30, issue 3, 2005, Pages 137~149
This study proposes a framework enhancing the accuracy of estimation for project duration by combining linear Bayesian updating scheme with the learning curve effect. Activities in a particular project might share resources in various forms and might be affected by risk factors such as weather Statistical dependence stemming from such resource or risk sharing might help us learn about the duration of upcoming activities in the Bayesian model. We illustrate, using a Monte Carlo simulation, that for partially repetitive projects a higher degree of statistical dependence among activity duration results in more variation in estimating the project duration in total, although more accurate forecasting Is achievable for the duration of an individual activity.