Abstract
The paper discusses the challenge of organizing the execution of separate tasks on machines that are otherwise similar. The goal is a lower number of Makes. We create, examine, and evaluate several local search techniques, including the (BAB) , (GA) and (TS) algorithms. Based on past computational experience, we know that these local search algorithms can efficiently complete up to 2,000 tasks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have