Susan H. Xu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Susan H. Xu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Haijun Li
Department of Mathematics and Statistics Washington State University 99164 Pullman WA U.S.A
2 shared publications - Yalçın Akçay
Melbourne Business School, University of Melbourne, Carlton, Victoria 3053, Australia
2 shared publications - Anantaram Balakrishnan
University of Texas at Austin
1 shared publication - Haijun Li
Washington State University
1 shared publication - Way Kuo
Hong Kong Institute for Advanced Study, City University of Hong Kong, Hong Kong
1 shared publication
Latest Publications
- 29 May 2013
- Published by Springer Nature in Annals of Operations Research
- Vol. 212 (1) , 139-154
Asymptotic analysis of simultaneous damages in spatial Boolean models
- 29 May 2013
- Published by Springer Nature in Annals of Operations Research
- Vol. 212 (1) , 139-154
Asymptotic analysis of simultaneous damages in spatial Boolean models
- 1 May 2010
- Published by SAGE Publications in Production and Operations Management
- Vol. 19 (3) , 279-304
Dynamic Assignment of Flexible Service Resources
Resource flexibility is an important tool for firms to better match capacity with demand so as to increase revenues and improve service levels. However, in service contexts that require dynamically deciding whether to accept incoming jobs and what resource to assign to each accepted job, harnessing the benefits of flexibility requires using effective methods for making these operational decisions. Motivated by the resource deployment decisions facing a professional service firm in the workplace training industry, we address the dynamic job acceptance and resource assignment problem for systems with general resource flexibility structure, i.e., with multiple resource types that can each perform different overlapping subsets of job types. We first show that, for systems containing specialized resources for individual job types and a versatile resource type that can perform all job types, the exact policy uses a threshold rule. With more general flexibility structures, since the associated stochastic dynamic program is intractable, we develop and test three optimization‐based approximate policies. Our extensive computational tests show that one of the methods, which we call the Bottleneck Capacity Reservation policy, is remarkably effective in generating near‐optimal solutions over a wide range of problem scenarios. We also consider a model variant that requires dynamic job acceptance decisions but permits deferring resource assignment decisions until the end of the horizon. For this model, we discuss an adaptation of our approximate policy, establish the effectiveness of this policy, and assess the value of postponing assignment decisions.
- 1 May 2010
- Published by SAGE Publications in Production and Operations Management
- Vol. 19 (3) , 279-304
Dynamic Assignment of Flexible Service Resources
Resource flexibility is an important tool for firms to better match capacity with demand so as to increase revenues and improve service levels. However, in service contexts that require dynamically deciding whether to accept incoming jobs and what resource to assign to each accepted job, harnessing the benefits of flexibility requires using effective methods for making these operational decisions. Motivated by the resource deployment decisions facing a professional service firm in the workplace training industry, we address the dynamic job acceptance and resource assignment problem for systems with general resource flexibility structure, i.e., with multiple resource types that can each perform different overlapping subsets of job types. We first show that, for systems containing specialized resources for individual job types and a versatile resource type that can perform all job types, the exact policy uses a threshold rule. With more general flexibility structures, since the associated stochastic dynamic program is intractable, we develop and test three optimization‐based approximate policies. Our extensive computational tests show that one of the methods, which we call the Bottleneck Capacity Reservation policy, is remarkably effective in generating near‐optimal solutions over a wide range of problem scenarios. We also consider a model variant that requires dynamic job acceptance decisions but permits deferring resource assignment decisions until the end of the horizon. For this model, we discuss an adaptation of our approximate policy, establish the effectiveness of this policy, and assess the value of postponing assignment decisions.
- 21 December 2006
- Published by Springer Nature in Annals of Operations Research
- Vol. 150 (1) , 17-29
Greedy algorithm for the general multidimensional knapsack problem
- 21 December 2006
- Published by Springer Nature in Annals of Operations Research
- Vol. 150 (1) , 17-29
Greedy algorithm for the general multidimensional knapsack problem
- 1 September 2000
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 37 (04) , 1020-1043
On the dependence structure and bounds of correlated parallel queues and their applications to synchronized stochastic systems
This paper studies the dependence structure and bounds of several basic prototypical parallel queueing systems with correlated arrival processes to different queues. The marked feature of our systems is that each queue viewed alone is a standard single-server queuing system extensively studied in the literature, but those queues are statistically dependent due to correlated arrival streams. The major difficulty in analysing those systems is that the presence of correlation makes the explicit computation of a joint performance measure either intractable or computationally intensive. In addition, it is not well understood how and in what sense arrival correlation will improve or deteriorate a system performance measure. The objective of this paper is to provide a better understanding of the dependence structure of correlated queueing systems and to derive computable bounds for the statistics of a joint performance measure. In this paper, we obtain conditions on arrival processes under which a performance measure in two systems can be compared, in the sense of orthant and supermodular orders, among different queues and over different arrival times. Such strong comparison results enable us to study both spatial dependence (dependence among different queues) and temporal dependence (dependence over different time instances) for a joint performance measure. Further, we derive a variety of upper and lower bounds for the statistics of a stationary joint performance measure. Finally, we apply our results to synchronized queueing systems, using the ideas combined from the theory of orthant and supermodular dependence orders and majorization with respect to weighted trees (Xu and Li (2000)). Our results reveal how a performance measure can be affected, favourably or adversely, by different types of dependencies.
- 1 September 2000
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 37 (04) , 1020-1043
On the dependence structure and bounds of correlated parallel queues and their applications to synchronized stochastic systems
This paper studies the dependence structure and bounds of several basic prototypical parallel queueing systems with correlated arrival processes to different queues. The marked feature of our systems is that each queue viewed alone is a standard single-server queuing system extensively studied in the literature, but those queues are statistically dependent due to correlated arrival streams. The major difficulty in analysing those systems is that the presence of correlation makes the explicit computation of a joint performance measure either intractable or computationally intensive. In addition, it is not well understood how and in what sense arrival correlation will improve or deteriorate a system performance measure. The objective of this paper is to provide a better understanding of the dependence structure of correlated queueing systems and to derive computable bounds for the statistics of a joint performance measure. In this paper, we obtain conditions on arrival processes under which a performance measure in two systems can be compared, in the sense of orthant and supermodular orders, among different queues and over different arrival times. Such strong comparison results enable us to study both spatial dependence (dependence among different queues) and temporal dependence (dependence over different time instances) for a joint performance measure. Further, we derive a variety of upper and lower bounds for the statistics of a stationary joint performance measure. Finally, we apply our results to synchronized queueing systems, using the ideas combined from the theory of orthant and supermodular dependence orders and majorization with respect to weighted trees (Xu and Li (2000)). Our results reveal how a performance measure can be affected, favourably or adversely, by different types of dependencies.