A modified hybrid whale optimization algorithm for the scheduling problem in multimedia data objects

Abstract

SummaryThe scheduling of the Multimedia Data Objects (MDO) is a difficult and extraordinary issue that faces us in the World Wide Web (WWW) to minimize the response time for clients to finish rapidly their tasks. MDO scheduling problem can be modeled as a Two‐Machine Flow Shop Scheduling Problem (T‐MFSSP) that minimizes the makespan. Notwithstanding another objective is to decrease the average lateness time of the clients' jobs. This paper proposes a Modified Hybrid Whale Algorithm (MHWA) to solve a standout among the most imperative applications of flow shop scheduling in the field of MDO. MHWA is hybridized with a local search strategy for solving the scheduling problem of MDO. To cope up with the combinatorial nature of the MDO scheduling, LRV maps the continuous search space into a sequence of jobs. To get better solutions, some operations are applied to the solutions such as swap mutation and reversed block insertion operations. Nawaz‐Enscore‐Ham (NEH) is added to MHWA to upgrade the performance of the algorithm. The solution of Johnson heuristic is added to the initial population of MHWA. It can be inferred that MHWA gives competitive outcomes appeared differently in relation to Johnson and Earliest Due Date (EDD) algorithms. MHWA can obtain the optimal makespan and can minimize the average lateness of the jobs.