The necessity of job scheduling or sharing has occurred within many real life situations [6]. The most common examples include: process scheduling on distributed computing systems, product scheduling on manufacturing systems or scheduling the available resources to many users. The issue of scheduling has generally asked the following question: "Which will the best method of organizing the workloads, so that it can be ended as fastest as possible?"[1] Within a distributed computing system, requests of processing are randomly received from the system's users. A good planning of these requests assumes their assigning towards available processors, so that all requests have to be solved as soon as possible.
展开▼
