A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines.
Ilan Reuven CohenIzack CohenIyar ZaksPublished in: Ann. Oper. Res. (2024)
Keyphrases
- computing environments
- job scheduling
- parallel machines
- minimize total
- theoretical and empirical study
- lot sizing
- scheduling problem
- flowshop
- identical machines
- single machine
- grid computing
- grid environment
- processing times
- np hard
- swarm intelligence
- precedence constraints
- release dates
- cloud computing
- setup times
- multi item
- mobile agents
- load balancing
- objective function
- single server
- high performance computing
- resource allocation
- parallel computing
- special case
- shared memory
- total cost
- virtual machine
- lead time