Yun Fong Lim
Singapore Management University
41 Papers
97 Citations
Yun Fong Lim is an academic researcher from Singapore Management University. The author has contributed to research in topics: Computer science & Robust optimization. The author has an hindex of 14, co-authored 34 publications. Previous affiliations of Yun Fong Lim include National University of Singapore & Georgia Institute of Technology.
Chat about Author
Papers
Dynamic pricing for hotel rooms when customers request multiple-day stays
TL;DR: In this article, the authors study the dynamic pricing problem faced by a hotel that maximizes expected revenue from a single type of rooms, where demand for the rooms is stochastic and non-stationary.
12
Asymmetric Information of Product Authenticity on C2C E-Commerce Platforms: How Can Inspection Services Help?
Linqiu Li,Xin Fang,Yun Fong Lim +2 more
TL;DR: Fang et al. as discussed by the authors considered a C2C platform that provides an inspection service, and they developed a two-stage game-theoretical model to evaluate the effect of inspection on the signaling game.
12
A Rolling Horizon Auction Mechanism and Virtual Pricing of Shipping Capacity for Urban Consolidation Centers
Chen Wang,Hoong Chuin Lau,Yun Fong Lim +2 more
- 23 Sep 2015
TL;DR: A virtual pricing mechanism which makes use of Target-oriented Robust Optimization techniques is proposed which addresses the needs of many shippers/carriers to be able both plan deliveries weeks ahead and at the same time bid for the UCC’s service at the last minute.
•Dissertation
Some Generalizations of Bucket Brigade Assembly Lines
Yun Fong Lim
- 27 Apr 2005
TL;DR: This thesis aims to demonstrate the efforts towards in-situ applicability of EMMARM, which aims to provide real-time information about the response of the immune system to EMTs.
9
Managing Stochastic Bucket Brigades on Discrete Work Stations
Abstract: Bucket brigades are notably used to coordinate workers in production systems. We study a J‐station, I‐worker bucket brigade system. The time duration for each worker to serve a job at a station is exponentially distributed with a rate that depends on the station's expected work content and the worker's work speed. Our goal is to maximize the system's productivity or to minimize its inter‐completion time variability. We analytically derive the throughput and the coefficient of variation (CV) of the inter‐completion time. We study the system under two cases. (i) If the work speeds depend only on the workers, the throughput gap between the stochastic and the deterministic systems can be up to 47 % when the number of stations is small. Either maximizing the throughput or minimizing the CV of the inter‐completion time, the slowest‐to‐fastest worker sequence always outperforms the reverse sequence for the stochastic bucket brigade. To maximize the throughput, more work content should be assigned to the stations near the faster workers. In contrast, to minimize the CV of the inter‐completion time, more work content should be allocated to the stations near the slower workers. (ii) If the work speeds depend on the workers and the stations such that the workers may not dominate each other at every station, the asymptotic throughput can be expressed as a function of the average work speeds and the asymptotic expected blocked times of the workers, and can be interpreted as the sum of the effective production rates of all the workers.
6