Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Adaptive large neighborhood search (1)
- Bucket brigade (1)
- Call center (1)
- Capacity pooling (1)
- Choice models (1)
-
- Concave-identification (1)
- Coordinated delivery (1)
- Crowdsourced Delivery (1)
- Cutting plane (1)
- Docking capacity (1)
- Drivers' Autonomy (1)
- Endogenous time window (1)
- Joint chance constraint (1)
- Last-mile Logistics (1)
- Persistency value (1)
- Productivity (1)
- Resource allocation (1)
- Service level (1)
- Staffing optimization (1)
- Stochastic knapsack (1)
- Stochastic service time (1)
- Stochastic travel and service times (1)
- Variability (1)
Articles 1 - 5 of 5
Full-Text Articles in Business
Choice-Based Crowdshipping: A Dynamic Task Display Problem, Alp Arslan, Firat Kilci, Shih-Fen Cheng, Archan Misra
Choice-Based Crowdshipping: A Dynamic Task Display Problem, Alp Arslan, Firat Kilci, Shih-Fen Cheng, Archan Misra
Research Collection School Of Computing and Information Systems
This paper studies the integration of the crowd workforce into a generic last-mile delivery setting in which a set of known delivery requests should be fulfilled at a minimum cost. In this setting, the crowd drivers are able to choose to perform a parcel delivery among the available and displayed requests. We specifically investigate the question: what tasks should be displayed to an individual driver, so as to minimize the overall delivery expenses? In contrast to past approaches, where drivers are either (a) given the choice of a single task chosen so as to optimize the platform’s profit, or (b) …
Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Joint Chance-Constrained Staffing Optimization In Multi-Skill Call Centers, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
This paper concerns the staffing optimization problem in multi-skill call centers. The objective is to find a minimal cost staffing solution while meeting a target level for the quality of service (QoS) to customers. We consider a staffing problem in which joint chance constraints are imposed on the QoS of the day. Our joint chance-constrained formulation is more rational capturing the correlation between different call types, as compared to separate chance-constrained versions considered in previous studies. We show that, in general, the probability functions in the joint-chance constraints display S-shaped curves, and the optimal solutions should belong to the concave …
Coordinated Delivery To Shopping Malls With Limited Docking Capacity, Ruidian Song, Hoong Chuin Lau, Xue Luo, Lei Zhao
Coordinated Delivery To Shopping Malls With Limited Docking Capacity, Ruidian Song, Hoong Chuin Lau, Xue Luo, Lei Zhao
Research Collection School Of Computing and Information Systems
Shopping malls are densely located in major cities such as Singapore and Hong Kong. Tenants in these shopping malls generate a large number of freight orders to their contracted logistics service providers, who independently plan their own delivery schedules. These uncoordinated deliveries and limited docking capacity jointly cause congestion at the shopping malls. A delivery coordination platform centrally plans the vehicle routes for the logistics service providers and simultaneously schedules the dock time slots at the shopping malls for the delivery orders. Vehicle routing and dock scheduling decisions need to be made jointly against the backdrop of travel time and …
Stochastic Knapsack Revisited: The Service Level Perspective, Guodong Lyu, Mabel C. Chou, Chung-Piaw Teo, Zhichao Zheng, Yuanguang Zhong
Stochastic Knapsack Revisited: The Service Level Perspective, Guodong Lyu, Mabel C. Chou, Chung-Piaw Teo, Zhichao Zheng, Yuanguang Zhong
Research Collection Lee Kong Chian School Of Business
A key challenge in the resource allocation problem is to find near-optimal policies to serve different customers with random demands/revenues, using a fixed pool of capacity (properly configured). In this paper, we study the properties of three classes of allocation policies-responsive (with perfect hindsight), adaptive (with information updates), and anticipative (with forecast information) policies. These policies differ in how the information on actual demand and revenue of each customer is being revealed and integrated into the allocation decisions. We show that the analysis of these policies can be unified through the notion of "persistency" (or service level) values-the probability that …
Managing Stochastic Bucket Brigades On Discrete Work Stations, Peng Wang, Kai Pan, Zhenzhen Yan, Yun Fong Lim
Managing Stochastic Bucket Brigades On Discrete Work Stations, Peng Wang, Kai Pan, Zhenzhen Yan, Yun Fong Lim
Research Collection Lee Kong Chian School Of Business
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 …