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 4, Issue 2 - Nov 1998
Selecting the target year
MODELS AND SOLUTION METHODS FOR SHORTEST PATHS IN A NETWORK WITH TIME-DEPENDENT FLOW SPEEDS
Sung, Ki-Seok ; Bell, Michael G-H ;
Management Science and Financial Engineering, volume 4, issue 2, 1998, Pages 1~13
The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.
SYNCHRONIZING INDIVIDUALLY OPTIMAL CYCLE TIMES ACROSS MULITI-BUYERS AND MULTI-PRODUCTS
Lee, Chang-Hwan ;
Management Science and Financial Engineering, volume 4, issue 2, 1998, Pages 15~42
A joint problem of order delivery, setup reduction, and cost-sharing in a two-echelon inventory system in which a vendor supplies multiple products to a group of buyers is studied here. The basic premise is that buyers have independently implemented setup reduction programs to acquire benefits from small order sizes. Doing so, however, causes the buyers' individually optimal order cycles to be differ from that of the vendor. In conjunction with this, two models are considered. In the first model, a multi-buyers single product situation is considered in which the vendor implements a joint supply cycle policy. However, buyers, as the dominant party, insist after implementing the individually optimal setup reduction that the vendor accept their individually optimal order schedules. In the second model. a multi-products, single buyer situation is considered in which the buyer implements a joint order policy. Here, the vendor, as the dominant party, refuses to cooperate fully with the buyer's individually reduced joint order schedule, and designs his own individually optimal setup reduction mix for each product under a given budget constraint. This led to a study of an integrated Setup Reduction/Break-even Pricing Policy for each situation to eliminate mismatches in individually optimal cycle times.
ASYMPTOTIC MAXIMUM PACKET SWITCH THROUGHPUT UNDER NONUNIFORM TRAFFIC
JEONG-HUN PARK ;
Management Science and Financial Engineering, volume 4, issue 2, 1998, Pages 43~58
Packet switch is a key component in high speed digital networks. This paper investigates congestion phenomena in the packet switching with input buffers. For large value of switch size N, mathematical models have been developed to analyze asymptotic maximum switch throughput under nonuniform traffic. Simulation study has also been done for small values of finite N. The rapid convergence of the switch performance with finite switch size to asymptotic solutions implies that asymptotic analytical solutions approximate very closely to maximum throughputs for reasonably large but finite N. Numerical examples show that non-uniformity in traffic pattern could result in serious degradation in packet switch performance, while the maximum switch throughput is 0.586 when the traffic load is uniform over the output trunks. Window scheduling policy seems to work only when the traffic is relatively uniformly distributed. As traffic non-uniformity increases, the effect of window size on throughput is getting mediocre.
RESPONSE TIME, INCENTIVE SYSTEM, AND LONG-TERM RELATIONSHIP
Rhim, Ho-Sun ;
Management Science and Financial Engineering, volume 4, issue 2, 1998, Pages 59~75
This paper presents an incentive system to reduce response time from a supplier. The incentive system is expressed as a contract between an assembler and a supplier who have a long-term relationship. We produce the optimal payment scheme and expected total cost, when the assembler is farsighted. We show that the farsighted assembler obtains higher effort level from the supplier than the myopic assembler. We also show that the expected total cost of the farsighted assembler is smaller in the long run, although it is initially higher than that of the myopic assembler.