Listar por tema 

Listar por tema "makespan"

Mostrando ítems 1-2 de 2

    • GLOA: A New Job Scheduling Algorithm for Grid Computing 

      Pooranian, Zahra; Shojafar, Mohammad; Abawajy, Jemal H.; Singhal, Mukesh (International Journal of Interactive Multimedia and Artificial Intelligence (IJIMAI), 03/2013)
      The purpose of grid computing is to produce a virtual supercomputer by using free resources available through widespread networks such as the Internet. This resource distribution, changes in resource availability, and an ...

    • Golden Ball Algorithm for solving Flow Shop Scheduling Problem 

      Sayoti, Fatima; Essaid Riffi, Mohammed (International Journal of Interactive Multimedia and Artificial Intelligence (IJIMAI), 09/2016)
      The Flow Shop Scheduling Problem (FSSP) is notoriously NP-hard combinatorial optimization problem. The goal is to find a schedule that minimizes the makespan. This paper proposes an adaptation of a new approach called ...