Results 61 to 70 of about 2,111 (188)
Stall‐Free Asynchronous State Repartitioning With a Proactive Workload Tracking Window
Concurrency and Computation: Practice and Experience, Volume 38, Issue 3, February 2026.ABSTRACT High‐throughput stateful applications rely on dynamic data repartitioning to adapt to changing workloads, but this process presents significant challenges. This paper provides a detailed analysis of such challenges, drilling down into the tradeoffs between adaptation, computational overhead, and service availability. We identify that a primary
Douglas Pereira Luiz +1 more
wiley +1 more source
Journal of Engineering and Management in Industrial System, 2014 In the flow shop scheduling each job will go through every machine in the same order. The goal of this research is to complete a series of jobs in order to obtain the optimal makespan for stick skewers rounding machine.
Dian Setiya Widodo +2 more
doaj +1 more source
Concurrency and Computation: Practice and Experience, Volume 38, Issue 3, February 2026.ABSTRACT Task‐based programming interfaces introduce a paradigm in which computations are decomposed into fine‐grained units of work known as “tasks”. StarPU is a runtime system originally developed to support task‐based parallelism on on‐premise heterogeneous architectures by abstracting low‐level hardware details and efficiently managing resource ...
Vanderlei Munhoz +5 more
wiley +1 more source
The complexity of makespan minimization for pipeline transportation
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruy Luiz Milidiú +2 more
openaire +2 more sources
Engineering Reports, Volume 8, Issue 2, February 2026.Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source
Dynamic flexible job shop scheduling using greedy actor–neural critic PPO reinforcement learning algorithm [PDF]
Journal of Project ManagementDynamic Flexible Job Shop Scheduling (DFJSS) is a critical challenge in smart manufacturing due to dynamic job arrivals, machine breakdowns, routing flexibility, and multi-objective performance requirements.
Selva Kumar Chandrasekar +3 more
doaj +1 more source
Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation
Applied Sciences, 2020 Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy.
Xuelian Pang +4 more
doaj +1 more source
Genetic Algorithm Based Multipath Optimization for Multimobile Robot Navigations
Engineering Reports, Volume 8, Issue 2, February 2026.Multimobile Robot Flow Network Problem (MMRNP) is to find optimum navigation paths in a network without robot collisions. In this paper, we present a heuristic approach using Genetic Algorithm (GA) to achieve the near‐optimal solution. We propose a new population initialization for our GA with different operators.
K. Somasundaram, Juha Plosila
wiley +1 more source
Mixed-Criticality Scheduling to Minimize Makespan.
, 2016 In the mixed-criticality job model, each job is characterized by two execution time parameters, representing a smaller (less conservative) estimate and a larger (more conservative) estimate on its actual, unknown, execution time. Each job is further classified as being either less critical or more critical.
Sanjoy K. Baruah +2 more
openaire +4 more sources
Scheduling parallel jobs to minimize the makespan [PDF]
Journal of Scheduling, 2006 ISSN:1094 ...
openaire +2 more sources