Consider a generalized processing system with several queues, where the available service rate combinations are fluctuating over time due to reliability and availability variations, and the scheduler must respond dynamically to the workload and service availability. We establish that cone schedules, which leverage the geometry of the queueing dynamics, maximize the system throughput for a broad class of processing systems, even under adversarial arrival processes.