Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...

In project scheduling, the durations of activities are often uncertain. Delays may cause a massive disorganization if large number must be rescheduled. “The Anchor-Robust Project Scheduling Problem,” Bendotti, Chrétienne, Fouilhoux, and Pass-Lanneau propose novel criterion for solution stability in scheduling under processing times uncertainty. They define anchored jobs as whose starting can gu...

In last decades, mobile factories have been used due to their high production capability, carrying their equipment and covering rough and uneven routes. Nowadays, more companies use mobile factories with the aim of reducing the transportation and manufacturing costs. The mobile factory must travel between the suppliers, visit all of them in each time period and return to the initial location of...

in this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. scheduling algorithms play an important role in grid computing, parallel tasks scheduling and sending them to appr...

Abstract The Production Scheduling (PS) problem is a challenging task that involves assigning manufacturing resources to jobs while ensuring all constraints are satisfied. key difficulty in PS determining the appropriate order of operations. In this study, we propose novel optimization algorithm called Quantum-inspired African Vultures Optimization Algorithm with an Elite Mutation Strategy (QEM...