Batch scheduling model for distributed systems

摘要

Scheduling of jobs in distributed environment is proven to be NP-complete and has been addressed by various heuristics and metaheuristic approaches. It is always desired from a scheduling policy to dispense the load evenly on the available resources so as to have maximum utilization of resources while meeting the scheduling objective(s). Metaheuristics for job scheduling have gained immense popularity due to their effectiveness in providing near optimal solution in a reasonable time. This paper presents the working of batch scheduling model based on bacterial foraging. The model generates the schedule minimizing the node idle time and the makespan while exhibiting a balanced load distribution.