Results 41 to 50 of about 22,096 (146)
Engineering Reports, Volume 8, Issue 4, April 2026.Rat swarm position update mechanism in HRSA‐RSO, illustrating the collective exploration behavior around the prey target (A*, B*). ABSTRACT The permutation flow shop scheduling problem (PFSSP) is a classical NP‐hard problem that aims to determine an optimal job sequence across machines to minimize makespan.
Mourad Mzili +5 more
wiley +1 more source
Dynamic sharing of a multiple access channel [PDF]
, 2010 In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing.
Bienkowski, Marcin +3 more
core +3 more sources
Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation
Journal of Multi-Criteria Decision Analysis, Volume 33, Issue 1, April 2026.ABSTRACT Multi‐objective combinatorial optimisation problems are widespread in real‐world scenarios, including resource allocation, scheduling and logistics, where multiple competing objectives need to be optimised simultaneously. In industrial contexts, lexicographic optimisation is often used to solve these problems, requiring the decision‐maker (DM)
Marco Foschini +3 more
wiley +1 more source
Abandoned project restoration model (APRM) for residential construction projects [PDF]
, 2017 Incompletion of construction projects is a common phenomenon in Malaysia. Project abandonment has given an adverse consequences to the economy, society and environment. In the best interest of the end users and other parties involved in the contract, the
Doraisamy, Sanitha V.
core
Efficient Algorithms for Scheduling Moldable Tasks
, 2021 We study the problem of scheduling $n$ independent moldable tasks on $m$ processors that arises in large-scale parallel computations. When tasks are monotonic, the best known result is a $(\frac{3}{2}+\epsilon)$-approximation algorithm for makespan ...
Loiseau, Patrick, Wu, Xiaohu
core
Precedence-constrained scheduling problems parameterized by partial order width [PDF]
, 2016 Negatively answering a question posed by Mnich and Wiese (Math. Program. 154(1-2):533-562), we show that P2|prec,$p_j{\in}\{1,2\}$|$C_{\max}$, the problem of finding a non-preemptive minimum-makespan schedule for precedence-constrained jobs of lengths 1 ...
HL Bodlaender +12 more
core +2 more sources
International Transactions in Operational Research, Volume 33, Issue 2, Page 860-891, March 2026.Abstract Sustainability has become one of the main objectives in all human activities and, in particular, in manufacturing environments. In this paper, we consider the flexible job shop scheduling problem with the objective of minimizing energy consumption.
Ernesto G. Birgin +2 more
wiley +1 more source
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
H-word: Supporting job scheduling in Hadoop with workload-driven data redistribution [PDF]
, 2016 The final publication is available at http://link.springer.com/chapter/10.1007/978-3-319-44039-2_21Today’s distributed data processing systems typically follow a query shipping approach and exploit data locality for reducing network traffic.
Abelló Gamazo, Alberto +3 more
core +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