Publication at Faculty of Mathematics and Physics |
2009
Abstract
We consider a problem of repeatedly scheduling n jobs on m parallel machines. Each job is associated with a profit that is gained each time the job is completed, and the goal is to maximize the average profit per time unit.
Once the processing of a job is completed, it goes on vacation and returns to the system, ready to be processed again, only after its vacation is over.