Search

Your search keyword '"Cai, Xiaoqiang"' showing total 38 results
Start Over Author "Cai, Xiaoqiang" Publication Type Books
38 results on '"Cai, Xiaoqiang"'

33. BackMatter.

Author

Cai, Xiaoqiang Q., Wu, Xianyi, and Zhou, Xian

Published
2014

34. FrontMatter.

Author

Cai, Xiaoqiang Q., Wu, Xianyi, and Zhou, Xian

Published
2014

35. BackMatter.

Author

Xu, Zeshui and Cai, Xiaoqiang

Published
2012

36. FrontMatter.

Author

Xu, Zeshui and Cai, Xiaoqiang

Published
2012

37. Optimal Commodity Distribution for a Vehicle with Fixed Capacity Under Vendor Managed Inventory.

Author

Hutchison, David, Kanade, Takeo, Kittler, Josef, Kleinberg, Jon M., Mattern, Friedemann, Mitchell, John C., Naor, Moni, Nierstrasz, Oscar, Pandu Rangan, C., Steffen, Bernhard, Sudan, Madhu, Terzopoulos, Demetri, Tygar, Doug, Vardi, Moshe Y., Weikum, Gerhard, Chen, Bo, Paterson, Mike, Zhang, Guochuan, Xu, Xiaolin, and Cai, Xiaoqiang

Abstract

Under vendor managed inventory (VMI), vendors have the obligation to maintain the retail stores they serve with sufficient inventory levels. In this paper, specifically, we consider an oil tanker which visits and replenishes multiple retail stations daily. However, due to the fixed capacity of vehicle, at each station the vendor faces such a tradeoff, replenishing the current station to a higher level or reserving more capacity for the left stations that may take more profits in future. We address this problem by two mathematical models, corresponding to situations with deterministic and stochastic station demand respectively. A greedy algorithm is developed and proved optimal for the case with deterministic demand. For the case with stochastic demand, we find the optimal replenishment policy by dynamic programming, which selects the median among three critical numbers. Numerical examples are also presented, which shed light on managerial insights partially. [ABSTRACT FROM AUTHOR]

Published
2007
Full Text
View/download PDF

38. Optimal Manpower Planning with Temporal Labor and Contract Period Constraints.

Author

Megiddo, Nimrod, Xu, Yinfeng, Zhu, Binhai, Li, Yongjian, Chen, Jian, Cai, Xiaoqiang, and Tu, Fengsheng

Abstract

In this paper, we investigate a manpower planning problem with single job type over a long planning horizon. Dynamic demands of jobs must be fulfilled by allocating enough number of regular and temporal workers and each regular worker has a minimal employment contract period. A cost objective is concerned where costs for workforce include salaries of regular and temporal workers, and recruitment and dismissal costs of regular workers. We first formulate the problem as a multi-period decision model. Then we derive several properties of the optimal solution and develop an improved dynamic programming algorithm with polynomial computational complexity. Finally, numerical results are presented to illustrate several managerial insights. Keywords: Manpower planning, dynamic program, minimal contract period, temporal labor. [ABSTRACT FROM AUTHOR]

Published
2005
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results