Results 41 to 50 of about 4,494 (215)

Portable PGAS‐Based GPU‐Accelerated Branch‐And‐Bound Algorithms at Scale

open access: yesConcurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.
ABSTRACT The Branch‐and‐Bound (B&B) technique plays a key role in solving many combinatorial optimization problems, enabling efficient problem‐solving and decision‐making in a wide range of applications. It incrementally constructs a tree by building candidates to the solutions and abandoning a candidate as soon as it determines that it cannot lead to ...
Guillaume Helbecque   +4 more
wiley   +1 more source

Efficient Task Scheduling and Load Balancing in Fog Computing for Crucial Healthcare Through Deep Reinforcement Learning

open access: yesIEEE Access
In 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

Mixed graph colouring as scheduling multi-processor tasks with equal processing times

open access: yesЖурнал Белорусского государственного университета: Математика, информатика, 2021
A problem of scheduling partially ordered unit-time tasks processed on dedicated machines is formulated as a mixed graph colouring problem, i. e., as an assignment of integers (colours) {1, 2, …, t} to the vertices (tasks) V {ν1, ν2, …, νn}, of the mixed
Yuri N. Sotskov
doaj   +1 more source

On Minimizing Generalized Makespan on Unrelated Machines

open access: yes, 2023
We consider the Generalized Makespan Problem (GMP) on unrelated machines, where we are given $n$ jobs and $m$ machines and each job $j$ has arbitrary processing time $p_{ij}$ on machine $i$. Additionally, there is a general symmetric monotone norm $ψ_i$ for each machine $i$, that determines the load on machine $i$ as a function of the sizes of jobs ...
Ayyadevara, Nikhil   +2 more
openaire   +4 more sources

A Comprehensive Survey on LLM‐Based Network Management and Operations

open access: yesInternational Journal of Network Management, Volume 35, Issue 6, November/December 2025.
ABSTRACT The growing demands for network capacity and the increasing complexities of modern network environments pose significant challenges for effective network management and operations. In response, network operators and administrators are moving beyond traditional manual and rule‐based methods, adopting advanced artificial intelligence (AI)‐driven
Jibum Hong   +2 more
wiley   +1 more source

Task Scheduling in Cloud Environment–Techniques, Applications, and Tools: A Systematic Literature Review

open access: yesIEEE Access
Cloud computing has become a revolutionary model for providing computational resources and services via the internet. As the volume of tasks and the dynamic nature of cloud resources increase, several critical challenges emerge, including load balancing,
Olanrewaju L. Abraham   +3 more
doaj   +1 more source

Minimizing makespan in flowshop with time lags

open access: yes, 2005
2 pages.
Fondrevelle, Julien   +2 more
openaire   +3 more sources

Traveling salesman problem with drone and bicycle: multimodal last‐mile e‐mobility

open access: yesInternational Transactions in Operational Research, Volume 32, Issue 6, Page 3232-3258, November 2025.
Abstract Recently, the multimodal last‐mile e‐mobility concept has been at the center of attention for cleaner, greener, and more accessible urban deliveries. As part of sustainable transportation systems, multimodal e‐mobility is proper for a variety of logistics operations as well as medical applications.
Erfan Babaee Tirkolaee   +2 more
wiley   +1 more source

Minimum Makespan Multi-Vehicle Dial-a-Ride [PDF]

open access: yesACM Transactions on Algorithms, 2009
Dial-a-Ride problems consist of a setVofnvertices in a metric space (denoting travel time between vertices) and a set ofmobjects represented as source-destination pairs {(si,ti)}mi=1, where each object requires to be moved from its source to destination vertex.
Gørtz, Inge Li   +2 more
openaire   +5 more sources

A New Formulation for the Traveling Salesman Problem With Drone and Lockers

open access: yesNetworks, Volume 86, Issue 2, Page 112-143, September 2025.
ABSTRACT Nowadays, driven by factors such as the rapid growth of online sales, different delivery methods are being explored to improve last‐mile logistics processes. Among these, the combined use of trucks and drones and the option of utilizing parcel lockers as an alternative to home delivery have led to the definition of new optimization problems ...
Danilo Amitrano   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy