New Heuristics for Scheduling and Distributing Jobs under Hybrid Dew Computing Environments.
Pablo SanabriaTomás Felipe TapiaAndrés NeyemJosé Ignacio BenedettoMatías HirschCristian MateosAlejandro ZuninoPublished in: Wirel. Commun. Mob. Comput. (2021)
Keyphrases
- computing environments
- computational grids
- list scheduling
- grid computing
- scheduling strategy
- scheduling problem
- parallel machines
- identical parallel machines
- identical machines
- job scheduling
- release dates
- release times
- processing times
- minimize total
- optimal scheduling
- unrelated parallel machines
- mobile computing
- scheduling jobs
- precedence constraints
- precedence relations
- single machine
- mobile environments
- mobile agents
- scheduling algorithm
- wafer fabrication
- service discovery
- batch processing
- maximum lateness
- deteriorating jobs
- batch processing machines
- scheduling policies
- setup times
- scheduling decisions
- search algorithm
- resource constrained project scheduling problem
- resource allocation
- simulated annealing and tabu search
- sequence dependent setup times
- lower bound
- branch and bound algorithm
- flowshop
- low bandwidth
- production scheduling
- completion times
- peer to peer
- np hard
- flexible manufacturing systems
- grid systems
- pervasive computing environments
- artificial intelligence
- shortest processing time