An Optimal Control Framework for Online Job Scheduling with General Cost Functions: Algorithm 2 Is 2K-Speed 2-Competitive for Monotone Substitute Cost FunctionsResearch Paper
A single machine receives jobs over time. Each job arrives at its release time with a length and a cost function , and all three become known only at arrival. The machine may interrupt a job and resume it later (preemption). The objective is the total delay cost , where is the completion time of job . Weighted flow time (…