Robust Appointment Scheduling with Waiting Time Guarantees
By Carolin Bauerhenne, Rainer Kolisch, Andreas S. Schulz
Rating
1377
Battle Count: 18
Relevance
2/10
Limited direct relevance to quantitative trading, but optimization techniques may be adaptable to some trading scenarios
Implementation Complexity
7/10
Requires implementation of complex mixed-integer linear programming models and custom algorithms
Reproducibility
4/5
Detailed mathematical formulations and algorithms provided, along with computational study using real-world data
About this paper
Methodology: Robust Optimization. Problem types: Optimization, Scheduling.
The interactive Everscope explorer (charts, battles, favorites) loads below.