Let's say I have to do n jobs, and each job can be done at or after a time T(i) (1<=i<=n). And we have 1 machine and the machine takes a time M to do any job whatsoever. The machine once started can be used again only after it's job is done. What's the optimal way to schedule these jobs on the machines?
How to schedule n jobs that come at different times on 1 machine (each taking a different time to complete the task)?
optimization;scheduling;process scheduling