A survey on multiprocessor scheduling using evolutionary technique

Abstract

In this paper, various conventional approaches are studied for the task scheduling, precedence–resource constrained, load balancing, and multiprocessor scheduling problems. In parallel machines the sequence of dependent execution setup time for the minimization of makespan in scheduling problems and prepared a concise review. Multiprocessor scheduling is an NP-hard problem, whereas scheduling algorithm schedules the tasks which may or may not be dependent on each other. There are several traditional approaches existing for processor scheduling such as modified critical path (MCP), dominant sequence clustering (DSC), and priority-based multichromosome (PMC). While using these approaches, we achieve partial solutions in less than the minimum computing time. In this paper, an innovative multiprocessor scheduling technique that is inspired by evolutionary techniques has been embodied.