More sophisticated scheduling algorithms also exist, for which we refer the reader to the Ray-Tune Trial Schedulers documentation. These types of scheduling algorithms can be applied to any combination of offline/online and computational/experimental tasks, especially when there are multi- ple "workers" (e.g., CPUs, robots, experimentalists); however, the most straightforward and perhaps most ubiquitous application of scheduler algorithms is for online computational optimization tasks (e.g., simulations). Likewise, readers may be interested in the many state-of-the-art search algorithms supported via the RayTune interface.