Multiprocessor Scheduling Using Nature Inspired Optimization

Abstract

Scheduling is a standout amongst the most essential issues in computational systems. By reason of the growing of end user demand for different types of issues, changing markets with worldwide challenge and quick improvement of new techniques and technologies; the significance of scheduling has grown in a huge scale. There are two cases of the scheduling are there in literature, viz. static and dynamic. Static scheduling needs background knowledge of the tasks to be scheduled to find its execution time. Dynamic task scheduling project does not require any background knowledge of the tasks to be scheduled. The minimization of the make span is the intent of the multiprocessor scheduling problem. Scheduling of tasks in multiprocessor system is an NP-Hard problem. Because of this, a large part of relevant work is based on meta-heuristic approaches with the objective of getting good solutions within a reasonable duration. newline