Results 61 to 70 of about 14,397 (225)
Task Scheduling Approach in Cloud Computing Environment Using Hybrid Differential Evolution
Mathematics, 2022 Task scheduling is one of the most significant challenges in the cloud computing environment and has attracted the attention of various researchers over the last decades, in order to achieve cost-effective execution and improve resource utilization.
Mohamed Abdel-Basset +4 more
doaj +1 more source
Journal of Field Robotics, Volume 43, Issue 7, Page 4382-4401, October 2026.ABSTRACT This paper presents the first end‐to‐end framework that combines guidance, navigation, and centralized task allocation for multiple UAVs performing autonomous search‐and‐rescue (SAR) in GNSS‐denied indoor environments. A twin delayed deep deterministic policy gradient controller is trained with an artificial potential field (APF) reward that ...
Thomas Hickling +3 more
wiley +1 more source
Online Makespan Minimization: The Power of Restart
CoRR, 2018 We consider the online makespan minimization problem on identical machines. Chen and Vestjens (ORL 1997) show that the largest processing time first (LPT) algorithm is 1.5-competitive. For the special case of two machines, Noga and Seiden (TCS 2001) introduce the SLEEPY algorithm that achieves a competitive ratio of $(5 - \sqrt{5})/2 \approx 1.382 ...
Zhiyi Huang 0002 +4 more
openaire +6 more sources
MINIMIZING THE MAKESPAN FOR UNRELATED PARALLEL MACHINES [PDF]
International Journal on Artificial Intelligence Tools, 2007 In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborhood Search (NS) based on the structure of the problem. We also used a modified SA algorithm, which gives better results than the traditional SA and developed an effective ...
Yunsong Guo +3 more
openaire +3 more sources
Journal of Engineering and Management in Industrial System, 2015 In this study done on leather shoe company that uses flow shop scheduling strategies. Where the purpose of this study is to minimize makespan is the total time needed to complete the entire job.
Hasan Bashori +2 more
doaj +1 more source
Concurrency and Computation: Practice and Experience, Volume 38, Issue 15, August 2026.ABSTRACT OpenMP, a leading tool for loop‐based parallel programming on shared memory platforms, is becoming a more powerful environment for exploiting task‐based parallelism. Recent specification versions have added support for new task clauses, while the OMPT interface provides a standard API for performance monitoring. In this paper, we present a new
Vinícius Garcia Pinto +1 more
wiley +1 more source
IEEE AccessIn healthcare, real-time decision making is crucial for ensuring timely and accurate patient care. However, traditional computing infrastructures, with their wide ranging capabilities, suffer from inherent latency, which compromises the efficiency of ...
Prashanth Choppara, Bommareddy Lokesh
doaj +1 more source
Health Science Reports, Volume 9, Issue 8, August 2026.ABSTRACT Background and Aims With increasing health awareness among Chinese residents, the demand for health examinations has continued to grow, placing mounting pressure on hospitals and health examination centers. This problem is particularly evident in group batch health examinations, where a large instantaneous flow of examinees and numerous ...
Mengdi Lv +4 more
wiley +1 more source
Makespan - Uniform Distributed Dataset.
, 2016 Makespan - Uniform Distributed Dataset.
Mohammed Abdullahi (846140) +1 more
core +1 more source