Scheduling with Testing
We study a new class of scheduling problems that capture common settings in service environments, in which one has to serve a collection of jobs that have a priori uncertain attributes (e.g., processing times and priorities) and the service provider has to decide how to dynamically allocate resource...
Main Authors: | Levi, Retsef, Magnanti, Thomas L, Shaposhnik, Yaron |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2020
|
Online Access: | https://hdl.handle.net/1721.1/128492 |
Similar Items
-
Exploration vs. exploitation : reducing uncertainty in operational problems
by: Shaposhnik, Yaron
Published: (2017) -
A Strong Cutting Plane Algorithm for Production Scheduling with Changeover Costs
by: Magnanti, Thomas L., et al.
Published: (2004) -
Routing and Scheduling on a Shoreline with Release Times
by: Psaraftis, Harilaos N., et al.
Published: (2004) -
Approximation Algorithms for the Stochastic Lot-Sizing Problem with Order Lead Times
by: Levi, Retsef, et al.
Published: (2014) -
Provably Near-Optimal LP-Based Policies for Revenue Management in Systems with Reusable Resources
by: Levi, Retsef, et al.
Published: (2011)