Author(s): Mustafa Talal Kadhim

Abstract: The challenge of parallel machine scheduling is to allocate each job to a single machine only in order to minimize the maximum completion time of a task because there are a number of tasks with related processing durations and a number of identical machines that can only process one task at a time. The subject has been thoroughly investigated since the 1960s and is extremely challenging (NP-hard). We introduce both an exact and a metaheuristic algorithm and examine how they perform on a wide range of test scenarios from the literature. Based on a scattered search model, the metaheuristic algorithm has demonstrated remarkable efficacy, solving a high proportion of test instances that are available to the public in an optimal manner. The remaining cases have all been swiftly and optimally resolved by the precise algorithm, which is founded on price, subsystems, and specialized binary research.

Pages: 51-57 | Views: 684 | Downloads: 4

Download Full Article: Click Here