Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Management Science and Financial Engineering
Journal Basic Information
Journal DOI :
The Korean Operations and Management Science Society
Editor in Chief :
Volume & Issues
Volume 11, Issue 3 - Dec 2005
Volume 11, Issue 2 - Nov 2005
Volume 11, Issue 1 - May 2005
Selecting the target year
Designing a Supply Chain Coordinating Returns Policies for a Risk Sensitive Manufacturer
Lee, Chang-Hwan ; Lim, Jay-Ick ;
Management Science and Financial Engineering, volume 11, issue 2, 2005, Pages 1~17
In this article we consider a supply chain consisting of a risk-sensitive manufacturer and a riskneutral retailer. The manufacturer maximizes her individual expected profit by designing a supply chain coordinating returns contract (SCRC) that consists of (i) a channel coordinating returns policy that maximizes the supply chain joint expected profit, and (ii) a profit sharing arrangement that gives the retailer an expected profit only slightly higher than that in the no returns case so that it is just enough to induce the retailer to accept the SCRC. Thus, the manufacturer captures as high a percentage as possible of the jointly maximum supply chain profit. However, this contract can sometimes lead to the manufacturer's resulting realized profit being lower than that in the no returns case when demand is lower than expected. In this context, even though profit is sufficiently attractive on average, will the risk-sensitive manufacturer ever consider applying a SCRC? Our research raises this question and focuses on designing a SCRC that can significantly increase the probability of the manufacturer's resulting realized profit being at least higher than that in the no returns case.
Customer Order Scheduling Problems with a Fixed Machine-Job Assignment
Yang, Jae-Hwan ; Rho, Yoo-Mi ;
Management Science and Financial Engineering, volume 11, issue 2, 2005, Pages 19~43
This paper considers a variation of the customer order scheduling problem, and the variation is the case where the machine-job assignment is fixed. We examine the parallel machine environment, and the objective is to minimize the sum of the completion times of the batches. While a machine can process only one job at a time, different machines can simultaneously process different jobs in a batch. The recognition version of this problem is known to be NP-complete in the strong sense even if there exist only two parallel machines. When there are an arbitrary number of parallel machines, we establish three lower bounds and develop a dynamic programming (DP) algorithm which runs in exponential time on the number of batches. We present two simple but intuitive heuristics, SB and GR, and find some special cases where SB and GR generate an optimal schedule. We also find worst case upper bounds on the relative error. For the case of the two parallel machines, we show that GR generates an optimal schedule when processing times of all batches are equal. Finally, the heuristics and the lower bounds are empirically evaluated.
Bi-Criteria Process Routing Based on COMSOAL Approach
Lee Sung-Youl ;
Management Science and Financial Engineering, volume 11, issue 2, 2005, Pages 45~60
This paper investigates the application of the computer method COMSOAL (Computer Method of Sequencing Operations for Assembly Lines) to the process routing (PR) problem with multiple objectives. In any computer aided process planning (CAPP) system, one of the most critical activities for manufacturing a part could be to generate the sequence that optimizes production time, production cost, machine utilization or with multiple these criteria. The COMSOAL has been adopted to find the optimum sequence of operations that optimizes two major conflicting criteria : production cost and production quality. The COMSOAL is here slightly modified to simultaneously generate and evaluate a set of possible solutions (called as population) instead of processing a solution stepwise in each iteration. The significant features of the COMSOAL include : no parameters settings needed, and a guarantee of feasible solutions. Experimental results show that COMSOAL is a simple but powerful method to quickly generate multiple feasible solutions which are as good as the ones obtained from several other well-known process routing algorithms.
A Heuristic Approach for Arrangement of Footwear Boxes to Maximize Space Utilization and Related Business Issues
Das Prasun ;
Management Science and Financial Engineering, volume 11, issue 2, 2005, Pages 61~84
This paper considers a special case of the two-dimensional bin-packing problem for identical items. The objective of this work is to maximize the space utilization. The main contribution of the paper is to suggest a new heuristic algorithm keeping in view the existing complexity of racking system for the footwear boxes in the compartments of different sizes for a warehouse. The results show that a significant improvement can be obtained. An economic choice of compartments is also estimated using the criteria for maximizing space utilization. A non-linear mathematical model was presented based on the constraints of racking dynamics.
Routing and Wavelength Assignment in Survivable WDM Networks without Wavelength Conversion
Lee, Tae-Han ; Park, Sung-Soo ; Lee, Kyung-Sik ;
Management Science and Financial Engineering, volume 11, issue 2, 2005, Pages 85~103
In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.