#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2001

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Júlíus Atlason, Marina A. Epelman, Shane G. Henderson
- Annals OR
- 2004

We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time periods. We assume that the service level cannot be easily computed, and instead is evaluated using simulation. The simulation uses the method of common random numbers, so that the same… (More)

- Júlíus Atlason, Marina A. Epelman, Shane G. Henderson
- Management Science
- 2008

We consider the problem of minimizing staffing costs in an inbound call center, while maintaining an acceptable level of service in multiple time periods. The problem is complicated by the fact that staffing level in one time period can affect the service levels in subsequent periods. Moreover, staff schedules typically take the form of shifts covering… (More)

We study the problem of approximating a subgradient of a convex (or concave) discrete function that is evaluated via simulation. This problem arises, for instance, in optimization problems such as finding the minimal cost staff schedule in a call center subject to a service level constraint. There, subgradient information can be used to significantly reduce… (More)

- Júlíus Atlason, Ulíus, Shane G. Henderson
- 2001

In this paper we describe a method that combines simulation and cutting plane methods to solve resource allocation and scheduling problems. We solve a relaxed linear (integer) program iteratively and pass the solution of each iteration to a simulation. The results of the simulation are used to generate constraints in the linear (integer) program. We provide… (More)

- Júlíus Atlason, Marina A. Epelman, Shane G. Henderson
- Winter Simulation Conference
- 2003

We study the problem of approximating a subgradient of a convex (or concave) discrete function that is evaluated via simulation. This problem arises, for instance, in optimization problems such as finding the minimal cost staff schedule in a call center subject to a service level constraint. There, subgradient information can be used to significantly reduce… (More)

- ‹
- 1
- ›