A scheduling method in a robotic network cloud system with minimal makespan is beneficiary in the sense that the system can complete all of its assigned tasks in the fastest way. Robotic network cloud systems can be translated into graphs, with nodes representing hardware with independent computational processing power and edges as data transmissions between nodes. Tasks time windows constraints are a natural way of ordering the tasks. The makespan is the maximum time duration from the time that a node starts to perform its first scheduled task to the time that all the nodes complete their final scheduled tasks . The load balancing scheduling ensures that the time windows from the time that the first node completes its final scheduled tasks to the time that all the other nodes complete their final scheduled tasks are as narrow as possible. We propose a new load balancing algorithm for task scheduling such that the makespan is minimal . We prove the correctness of the proposed algorithm and present simulations illustrating the obtained results.
A scheduling method in a robotic network cloud system with minimal makespan is beneficial because the system can complete all tasks assigned to it in the fastest way. Robotic network cloud systems can be translated into graphs, where nodes represent hardware with independent computing power and edges represent data transmissions between nodes. Time-window constraints on tasks are a natural way to order tasks. The makespan is the maximum amount of time between when a node starts executing its first scheduled task and when all nodes have completed their last scheduled task . The load balancing scheduling ensures that the time between when the first node completes its scheduled tasks and when all other nodes complete their scheduled tasks is as short as possible. We propose a new load balancing algorithm for task scheduling with minimal makespan . We prove the correctness of the proposed algorithm and present simulations illustrating the obtained results.
R
beneficiary in the sense that the
beneficial because the
R
of its assigned tasks
tasks assigned to it
R
with nodes representing
where nodes represent
R
computational processing
computing
R
as
represent
R
Tasks time windows constraints
Time-window constraints on tasks
R
of ordering the
to order
R
time duration from the time that
amount of time between when
R
to perform
executing
R
to the time that all the nodes complete their final scheduled tasks
and when all nodes have completed their last scheduled task
R
windows from the time that the
between when the
R
final scheduled tasks to the time that all the
scheduled tasks and when all
R
final scheduled tasks are as narrow
scheduled tasks is as short
R
such that the makespan is minimal
with minimal makespan