Wasit Journal for Pure Sciences (Jun 2023)
Some Algorithms Used in Parallel Machine Scheduling
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.