Optimal Task Allocation Research Articles

Energy Aware Task Allocation for Semi-Asynchronous Mobile Edge Learning

This paper extends the paradigm of "mobile edge learning (MEL)" by designing an energy-aware optimal task allocation scheme for training a machine learning (ML) model in a semi-asynchronous manner across multiple learners connected via the resource-constrained wireless edge network. The tasks are allocated such that the local dataset size selected at each learner ensures completion within a given global delay constraint and a local maximum energy consumption limit. Hence, the designed method is heterogeneity aware (HA) because it offers a trade-off between resource consumption and MEL performance by directly relating the time and energy consumption to the heterogeneous communication/computational capabilities of learners. Because the resulting optimization is an NP-hard quadratically-constrained integer linear program (QCILP), a two-step suggest-and-improve (SAI) solution is proposed. The proposed HA semi-asynchronous (HA-Asyn) approach is compared against the HA synchronous (HA-Sync) scheme and the heterogeneity unaware (HU) synchronous/asynchronous (HU-Sync/Asyn) equal batch allocation schemes. Results from a system of 20 learners tested for various completion time and energy consumption constraints show that the proposed HA-Asyn method works better than the HU-Sync/Asyn approaches and can even provide gains of up-to 25% compared to the HA-Sync scheme.

Multi-Agent Task Allocation with Interagent Distance Constraints

In this paper, we consider the task allocation problem for autonomous agents where the distances between any two agents should always be less than a predetermined value. To easily tackle the problem, we introduce a novel concept referred to as a virtual task that helps to decouple the task allocation from the path planning in the joint task allocation and path planning problem. An overall task allocation procedure with two steps is proposed. After the virtual tasks are generated with preliminary clustering in the first step, tasks are clustered into groups and allocated to agents in the second step. To reduce the computational complexity of optimal clustering and task allocation, we propose a suboptimal method called the cluster-level traveling salesman problem (TSP). Numerical results show that the cluster-level TSP suffers only little performance degradation compared to the optimal method, even though its computational costs are dramatically reduced.

A Hybrid Particle Whale Optimization Algorithm with application to workflow scheduling in cloud–fog environment

Workflow scheduling aims to optimize task allocation and execution in cloud–fog​ computing environments. Finding an optimal algorithm for workflow scheduling poses a significant challenge due to the complexity and variability of tasks and resources involved. Although meta-heuristic algorithms have been proposed to address these challenges, they often suffer from being trapped in local optima, failing to achieve the global optimal solution. Our work used a hybrid approach “Particle Whale Optimization Algorithm” (PWOA) to overcome the above-mentioned problem by combining Particle Swarm Optimization (PSO) and Whale Optimization Algorithm (WOA).PSO’s limitation in high-dimensional search spaces, characterized by slow convergence toward the global optimum, and the population-based WOA algorithm’s limited exploration of search spaces are overcome by the proposed algorithm PWOA. The proposed algorithm PWOA overcomes the limitations of PSO and WOA.The objective of the PWOA algorithm is to minimize the Total Execution Time (TET) and Total Execution Cost (TEC) associated with dependent tasks in a cloud–fog computing environment. To evaluate the performance of the PWOA algorithm, extensive simulations are conducted using test cases (30, 50, 100 and 1000) from five different scientific workflows: Cybershake, Epigenomics, Inspiral, Montage and Sipht. These workflows encompassed varying numbers of assigned tasks. The simulation results demonstrated that the proposed PWOA algorithm outperformed the standard PSO and WOA algorithms to improve TET and TEC across all the diverse workflows. This study also provides a comparative view of the effectiveness of the PWOA algorithm in enhancing workflow scheduling performance.

Human-robot collaboration in assembly line balancing problems: Review and research gaps

Researchers have been working on assembly line optimization problems, especially assembly line balancing, for decades. Integration of Industry 4.0 technologies into assembly lines creates new challenges in optimal resource selection, task allocation, line balance, and scheduling decisions, to name a few. Over the last decade, researchers have developed novel frameworks for conventional assembly line optimization problems that comply with the recent industrial revolution and leading technologies. State-of-the-art Balancing problems in assembly lines with collaborative robots are the core of this study as a key decision in Assembly 4.0. The collaboration of humans and robots in a fenceless environment requires a more comprehensive approach than the traditional task-station assignment in a balancing model. Resource selection/allocation and scheduling are the most common decisions that researchers combine with balancing models. Thus, the studies on all these optimization challenges in the last ten years through the Web of Science and Engineering Village are present in the current review. We analyze the articles’ statistics (e.g., year and journals) and contents to find the research trends and gaps for future research direction in collaborative robotic assembly line optimization which incorporates occupational health and safety.

Optimising stochastic task allocation and scheduling plans for mission workers subject to learning-forgetting, fatigue-recovery, and stress-recovery effects

This study addresses the stochastic bi-objective task allocation and scheduling problems for mission workers subject to the complex (and joint) effect of learning-forgetting, fatigue-recovery, and stress-recovery processes. The mission consists of work-rest cycles with different types of tasks. Some task types are repetitive, not necessarily back-to-back, with some predecessors for other task types. The workers are multi-skilled, whose experience, learning, fatigue, and stress levels are updated, affecting their performance dynamically. A Markov Decision Process (MDP) is applied to formulate this stochastic problem, considering speed and accuracy as two measures of workforce performance. A decision could be “to repeat a task of a certain type” or “take a rest break till another worker becomes available”. The developed MDP model finds the optimal task allocation and work-break schedule for workers by minimising the sum of the tasks’ completion times and maximising their quality. Completion time is a continuous variable, and the quality index is a binary random variable, i.e., high or moderate, having a continuous probability of occurrence. The model is of a general form with a potential application in similar settings. The paper used the Sequential Greedy Assignment (SGA) and the Monte-Carlo Tree Search (MCTS) to solve the problem with their results compared. Numerical results with those from a sensitivity analysis are discussed.

A New Method for Improving the Fairness of Multi-Robot Task Allocation by Balancing the Distribution of Tasks

This paper presents an innovative task allocation method for multi-robot systems that aims to optimize task distribution while taking into account various performance metrics such as efficiency, speed, and cost. Contrary to conventional approaches, the proposed method takes a comprehensive approach to initialization by integrating the K-means clustering algorithm, the Hungarian method for solving the assignment problem, and a genetic algorithm specifically adapted for Open Loop Travel Sales Man Problem (OLTSP). This synergistic combination allows for a more robust initialization, effectively grouping similar tasks and robots, and laying a strong foundation for the subsequent optimization process. The suggested method is flexible enough to handle a variety of situations, including Multi-Robot System (MRS) with robots that have unique capabilities and tasks of varying difficulty. The method provides a more adaptable and flexible solution than traditional algorithms, which might not be able to adequately address these variations because of the heterogeneity of the robots and the complexity of the tasks. Additionally, ensuring optimal task allocation is a key component of the suggested method. The method efficiently determines the best task assignments for robots through the use of a systematic optimization approach, thereby reducing the overall cost and time needed to complete all tasks. This contrasts with some existing methods that might not ensure optimality or might have limitations in their ability to handle a variety of scenarios. Extensive simulation experiments and numerical evaluations are carried out to validate the method's efficiency. The extensive validation process verifies the suggested approach's dependability and efficiency, giving confidence in its practical applicability.

Coordinated Multi-UAV Reconnaissance Scheme for Multiple Targets

This study addresses dynamic task allocation challenges in coordinated surveillance involving multiple unmanned aerial vehicles (UAVs). A significant concern is the increased UAV flight distance resulting from the assignment of new missions, leading to decreased reconnaissance efficiency. To tackle this issue, we introduce a collaborative multi-target and multi-UAV reconnaissance scheme. Initially, the multitasking constrained multi-objective optimization framework (MTCOM) is employed to optimize task allocation and reconnaissance time in static scenarios. Subsequently, in case of emergency, we iteratively refine the outcomes of static task allocation through an enhanced auction-based distributed algorithm, effectively reducing UAV flight costs in response to new missions, UAV withdrawal, or damage. Simulation results demonstrate the efficacy of our proposed multi-UAV and multi-target cooperative reconnaissance scheme in resolving dynamic task allocation issues. Additionally, our approach achieves a 5.4% reduction in UAV flight distance compared to traditional allocation methods. The main contribution of this paper is to consider a dynamic scenario model involving UAV damage and the emergence of new reconnaissance areas. Then we propose an innovative collaborative multi-target and multi-UAV reconnaissance scheme to address this issue and, finally, conduct experimental simulations to verify the effectiveness of the algorithm.

Model of elemental data flow distribution in the internet of things supporting fog platform

The subject of the research is models and methods for optimizing resource and task management in the fog computing environment of the Internet of Things (IoT). The increasing number of connected devices and the volumes of data collected in IoT networks make it essential to improve management systems that ensure the optimal distribution of tasks and resources. Fog computing addresses this challenge by distributing computational tasks closer to data sources and end-users. The goal of this work is to enhance the efficiency of fog computing technologies to achieve optimal task and resource allocation in IoT networks. The main tasks of this work are as follows. Firstly, considering the diverse requirements of computational resources and tasks in IoT, reviewing existing methods and developments in the field is necessary. Secondly, it is essential to investigate and compare clustering methods, particularly DBSCAN and C-Means, for effective resource management. The DBSCAN clustering method enables efficient task distribution based on their location, while the C-Means method allows grouping resources based on their characteristics. The final task involves developing a mathematical model that considers input parameters such as system response, cluster resource requirements, data proximity to processing, etc. This model will enable the analysis of potential scenarios and decision-making regarding the optimal distribution of tasks and resources in the IoT environment. Conclusion. This research aims to solve the urgent problem of managing resources and tasks in the fog IoT environment. A review of existing methods and developments in resource and task management in IoT is conducted. DBSCAN and C-Means clustering methods are compared to determine their effectiveness in resource management. A set-theoretic model is developed that considers various parameters for making optimal decisions on the distribution of tasks and resources. It is established that the use of clustering methods and the developed model help to improve system performance and ensure more efficient use of fog computing resources in the IoT environment.

DTRL: Decision Tree-based Multi-Objective Reinforcement Learning for Runtime Task Scheduling in Domain-Specific System-on-Chips

Domain-specific systems-on-chip (DSSoCs) combine general-purpose processors and specialized hardware accelerators to improve performance and energy efficiency for a specific domain. The optimal allocation of tasks to processing elements (PEs) with minimal runtime overheads is crucial to achieving this potential. However, this problem remains challenging as prior approaches suffer from non-optimal scheduling decisions or significant runtime overheads. Moreover, existing techniques focus on a single optimization objective, such as maximizing performance. This work proposes DTRL, a decision-tree-based multi-objective reinforcement learning technique for runtime task scheduling in DSSoCs. DTRL trains a single global differentiable decision tree (DDT) policy that covers the entire objective space quantified by a preference vector. Our extensive experimental evaluations using our novel reinforcement learning environment demonstrate that DTRL captures the trade-off between execution time and power consumption, thereby generating a Pareto set of solutions using a single policy. Furthermore, comparison with state-of-the-art heuristic–, optimization–, and machine learning-based schedulers shows that DTRL achieves up to 9× higher performance and up to 3.08× reduction in energy consumption. The trained DDT policy achieves 120 ns inference latency on Xilinx Zynq ZCU102 FPGA at 1.2 GHz, resulting in negligible runtime overheads. Evaluation on the same hardware shows that DTRL achieves up to 16% higher performance than a state-of-the-art heuristic scheduler.

Optimization of Resource Allocation and Task Allocation with Project Management Information Systems in Information Technology Companies

This study proposes a novel approach to designing an integrated Resource Allocation and Task Allocation Optimization System (RATAOS) using Enterprise Architecture (EA) to improve project management efficiency. The proposed approach integrates Project Management Information System (PMIS) with an optimization system designed using a random forest model and Natural Language Programming (NLP). The integrated system optimizes resource and task allocation, reducing operational costs by 14% and planning phases by 88.7%. Project completion time increased by 50.80%, demonstrating the effectiveness of the integrated system. The purpose of this study is to find a solution for PMIS to be used as an automatic data-driven Resource and Task Allocation Optimization System. The technique used in this study is service integration between the existing PMIS with the Resource and Task Allocation Optimization System.

Overlapping Coalition Formation Game via Multi-Objective Optimization for Crowdsensing Task Allocation

With the rapid development of sensor technology and mobile services, the service model of mobile crowd sensing (MCS) has emerged. In this model, user groups perceive data through carried mobile terminal devices, thereby completing large-scale and distributed tasks. Task allocation is an important link in MCS, but the interests of task publishers, users, and platforms often conflict. Therefore, to improve the performance of MCS task allocation, this study proposes a repeated overlapping coalition formation game MCS task allocation scheme based on multiple-objective particle swarm optimization (ROCG-MOPSO). The overlapping coalition formation (OCF) game model is used to describe the resource allocation relationship between users and tasks, and design two game strategies, allowing users to form overlapping coalitions for different sensing tasks. Multi-objective optimization, on the other hand, is a strategy that considers multiple interests simultaneously in optimization problems. Therefore, we use the multi-objective particle swarm optimization algorithm to adjust the parameters of the OCF to better balance the interests of task publishers, users, and platforms and thus obtain a more optimal task allocation scheme. To verify the effectiveness of ROCG-MOPSO, we conduct experiments on a dataset and compare the results with the schemes in the related literature. The experimental results show that our ROCG-MOPSO performs superiorly on key performance indicators such as average user revenue, platform revenue, task completion rate, and user average surplus resources.

Joint Task Allocation and Resource Optimization Based on an Integrated Radar and Communication Multi-UAV System

This paper investigates the joint task allocation and resource optimization problem in an integrated radar and communication multi-UAV (IRCU) system. Specifically, we assign reconnaissance UAVs and communication UAVs to perform the detection, tracking and communication tasks under the resource, priority and timing constraints by optimizing task allocation, power as well as channel bandwidth. Due to complex coupling among task allocation and resource optimization, the considered problem is proved to be non-convex. To solve the considered problem, we present a loop iterative optimization (LIO) algorithm to obtain the optimal solution. In fact, the mentioned problem is decomposed into three sub-problems, such as task allocation, power optimization and channel bandwidth optimization. At the same time, these three problems are solved by the divide-and-conquer algorithm, the successive convex approximation (SCA) algorithm and the improved particle swarm optimization (PSO) algorithm, respectively. Finally, numerical simulations demonstrate that the proposed LIO algorithm consumes fewer iterations or achieves higher maximum joint performance than other baseline schemes for solving the considered problem.

Dynamic Mission Planning Algorithm for UAV Formation in Battlefield Environment

The limited time duration and spatial instability of TSTs increase the difficulty of mission planning for unmanned aerial vehicle (UAV) formations, which in turn affects the task execution abilities of UAVs. Aiming at this problem, a multi-UAV dynamic mission planning algorithm based on the time window mechanism is proposed under a distributed formation structure. The proposed algorithm comprehensively considers a variety of complex constraints involved in actual application scenarios and constructs a UAV formation mission planning model with minimum task execution cost and path planning cost as the optimization goal. In this work, particle swarm optimization algorithm is improved by introducing a specific particle coding method and a competitive co-evolutionary population updating strategy, to enhance the solution speed and accuracy of the mission planning model. In this way, the optimal task allocation strategy and task execution path are obtained to meet the mission requirements, and to achieve the multi-UAV cooperative reconnaissance, strike and evaluation of multiple TSTs. Furthermore, the effectiveness of the proposed algorithm is validated via simulations.

Task Scheduling Mechanism Based on Reinforcement Learning in Cloud Computing

The explosive growth of users and applications in IoT environments has promoted the development of cloud computing. In the cloud computing environment, task scheduling plays a crucial role in optimizing resource utilization and improving overall performance. However, effective task scheduling remains a key challenge. Traditional task scheduling algorithms often rely on static heuristics or manual configuration, limiting their adaptability and efficiency. To overcome these limitations, there is increasing interest in applying reinforcement learning techniques for dynamic and intelligent task scheduling in cloud computing. How can reinforcement learning be applied to task scheduling in cloud computing? What are the benefits of using reinforcement learning-based methods compared to traditional scheduling mechanisms? How does reinforcement learning optimize resource allocation and improve overall efficiency? Addressing these questions, in this paper, we propose a Q-learning-based Multi-Task Scheduling Framework (QMTSF). This framework consists of two stages: First, tasks are dynamically allocated to suitable servers in the cloud environment based on the type of servers. Second, an improved Q-learning algorithm called UCB-based Q-Reinforcement Learning (UQRL) is used on each server to assign tasks to a Virtual Machine (VM). The agent makes intelligent decisions based on past experiences and interactions with the environment. In addition, the agent learns from rewards and punishments to formulate the optimal task allocation strategy and schedule tasks on different VMs. The goal is to minimize the total makespan and average processing time of tasks while ensuring task deadlines. We conducted simulation experiments to evaluate the performance of the proposed mechanism compared to traditional scheduling methods such as Particle Swarm Optimization (PSO), random, and Round-Robin (RR). The experimental results demonstrate that the proposed QMTSF scheduling framework outperforms other scheduling mechanisms in terms of the makespan and average task processing time.

Task Allocation Methods and Optimization Techniques in Edge Computing: A Systematic Review of the Literature

Task allocation in edge computing refers to the process of distributing tasks among the various nodes in an edge computing network. The main challenges in task allocation include determining the optimal location for each task based on the requirements such as processing power, storage, and network bandwidth, and adapting to the dynamic nature of the network. Different approaches for task allocation include centralized, decentralized, hybrid, and machine learning algorithms. Each approach has its strengths and weaknesses and the choice of approach will depend on the specific requirements of the application. In more detail, the selection of the most optimal task allocation methods depends on the edge computing architecture and configuration type, like mobile edge computing (MEC), cloud-edge, fog computing, peer-to-peer edge computing, etc. Thus, task allocation in edge computing is a complex, diverse, and challenging problem that requires a balance of trade-offs between multiple conflicting objectives such as energy efficiency, data privacy, security, latency, and quality of service (QoS). Recently, an increased number of research studies have emerged regarding the performance evaluation and optimization of task allocation on edge devices. While several survey articles have described the current state-of-the-art task allocation methods, this work focuses on comparing and contrasting different task allocation methods, optimization algorithms, as well as the network types that are most frequently used in edge computing systems.

Metascheduling Using Discrete Particle Swarm Optimization for Fault Tolerance in Time-Triggered IoT-WSN

In time-triggered systems, adaptation is performed by using metascheduling approaches to ensure temporal predictability. Wireless sensor networks (WSNs) are growing to be used as a reliable, an energy-efficient, and a scalable network infrastructure for numerous Internet of Things (IoT) applications. Because of run-time changes because of failure events, a metascheduling system is required to address the changes by precomputing schedules for several context events at design time. Therefore, this paper proposes a metascheduler that solves a new scheduling problem for each adaptation scenario in IoT-WSN using our offline algorithm named discrete particle swarm optimization for reliable task allocation (DPSO-TA), resulting in a multi-schedule graph that combines the repeated schedules. In this work, a time-triggered IoT-WSN metascheduler is proposed that takes into considerations the node or link failures that are common in WSN. Single and two failure events are considered, where a graph for all feasible schedules is formed at the network design time. Such a large number of schedules causes a state space explosion problem, which is managed using a re-convergence method. Different application model sizes and network topologies are used to assess the proposed metascheduler under various failure event scenarios. The results show a reduction in the size of the multi-schedule graph by applying inputs with different deadline values and different number of tasks. Furthermore, the validity suggested by the proposed metascheduler, which is the ratio of valid to invalid schedules, is improved when compared to algorithms that schedule tasks to hosts with the shortest completion time or algorithms that select hosts for a set of sorted tasks based on energy consumed and task arrival time.

Multi-objective task allocation for collaborative robot systems with an Industry 5.0 human-centered perspective

The migration from Industry 4.0 to Industry 5.0 is becoming more relevant nowadays, with a consequent increase in interest in the operators’ wellness in their working environment. In modern industry, there are different activities that require the flexibility of human operators in performing different tasks, while some others can be performed by collaborative robots (cobots), which promote a fair division of the tasks among the resources in industrial applications. Initially, these robots were used to increase productivity, in particular in assembly systems; currently, new goals have been introduced, such as reducing operator’s fatigue, so that he/she can be more effective in the tasks that require his/her flexibility. For this purpose, a model that aims to realize a multi-objective optimization for task allocation is here proposed. It includes makespan minimization, but also the operator’s energy expenditure and average mental workload reduction. The first objective is to reach the required high productivity standards, while the latter is to realize a human-centered workplace, as required by the Industry 5.0 paradigms. A method for average mental workload evaluation in the entire assembly process and a new constraint, related to resources’ idleness, are here suggested, together with the evaluation of the methodology in a real case study. The results show that it is possible to combine all these elements finding a procedure to define the optimal task allocation that improves the performance of the systems, both for efficiency and for workers’ well-being.

DRL-Based V2V Computation Offloading for Blockchain-Enabled Vehicular Networks

Vehicular edge computing (VEC) is an effective method to increase the computing capability of vehicles, where vehicles share their idle computing resources with each other. However, due to the high mobility of vehicles, it is challenging to design an optimal task allocation policy that adapts to the dynamic vehicular environment. Further, vehicular computation offloading often occurs between unfamiliar vehicles, how to motivate vehicles to share their computing resources while guaranteeing the reliability of resource allocation in task offloading is one main challenge. In this paper, we propose a blockchain-enabled VEC framework to ensure the reliability and efficiency of vehicle-to-vehicle (V2V) task offloading. Specifically, we develop a deep reinforcement learning (DRL)-based computation offloading scheme for the smart contract of blockchain, where task vehicles can offload part of computation-intensive tasks to neighboring vehicles. To ensure the security and reliability in task offloading, we evaluate the reliability of vehicles in resource allocation by blockchain. Moreover, we propose an enhanced consensus algorithm based on practical Byzantine fault tolerance (PBFT), and design a consensus nodes selection algorithm to improve the efficiency of consensus and motivate base stations to improve reliability in task allocation. Simulation results validate the effectiveness of our proposed scheme for blockchain-enabled VEC.

Binary Integer Formulations for Task Allocation and Optimal Labor Cost in Small and Medium Apparel Manufacturing

In small apparel manufacturing, unit price determination is often based on production duration given by customers and design complexity rather than information relating to internal labor resources. However, labor expertise and skills are critical factors that outweigh the machinery and technology in small and medium apparel companies. The quality of the product greatly depends on the experience and delicacy of the tailors. Using data on labor skill and wage levels in the planning process will benefit human resource utilization, increasing productivity, and profits effectively. This paper proposes a general mathematical model for task allocation and cost optimization for small and medium apparel companies. The model handles task allocation and cost minimization problems that must ensure processing time requirements and balance workloads for operators. The developed model tests two case studies in a published paper. The results prove that although the proposed model is simple, it has high applicability and efficiency in solving allocation optimization problems. The authors then integrate the formulations into a Standalone desktop app in the MATLAB “App designer” module. With a standalone desktop app, end users can enjoy the application. This app has a user-friendly design. Users unfamiliar with computers or planners with no background in programming can use the app to tackle similar optimization problems. The proposed mathematical model can further expand to include more complex issues in apparel companies and can also be a good reference for other fields.

An Improved Approximation Algorithm for Wage Determination and Online Task Allocation in Crowd-Sourcing

Crowd-sourcing has attracted much attention due to its growing importance to society, and numerous studies have been conducted on task allocation and wage determination. Recent works have focused on optimizing task allocation and workers' wages, simultaneously. However, existing methods do not provide good solutions for real-world crowd-sourcing platforms due to the low approximation ratio or myopic problem settings. We tackle an optimization problem for wage determination and online task allocation in crowd-sourcing and propose a fast 1-1/(k+3)^(1/2)-approximation algorithm, where k is the minimum of tasks' budgets (numbers of possible assignments). This approximation ratio is greater than or equal to the existing method. The proposed method reduces the tackled problem to a non-convex multi-period continuous optimization problem by approximating the objective function. Then, the method transforms the reduced problem into a minimum convex cost flow problem, which is a well-known combinatorial optimization problem, and solves it by the capacity scaling algorithm. Synthetic experiments and simulation experiments using real crowd-sourcing data show that the proposed method solves the problem faster and outputs higher objective values than existing methods.