Results 31 to 40 of about 11,921 (298)
Pacific Journal of Mathematics for Industry, 2017 When a massive disaster occurs, to repair the damaged part of lifeline networks, planning is needed to appropriately allocate tasks to two or more restoration teams and optimize their traveling routes.
Akifumi Kira +4 more
doaj +1 more source
Performability Analysis of a Redundant Parallel Task in Network Systems
IEEE Access, 2021 Recently, application of network systems (e.g., cloud computing systems) is increasingly prevalent for achieving integration, sharing and efficient utilization of various resources.
Min Tao, Xiwei Qiu, Peng Sun
doaj +1 more source
Budget Minimization with Precedence Constraints
CoRR, 2019 Budget Minimization is a scheduling problem with precedence constraints, i.e., a scheduling problem on a partially ordered set of jobs $(N, \unlhd)$. A job $j \in N$ is available for scheduling, if all jobs $i \in N$ with $i \unlhd j$ are completed. Further, each job $j \in N$ is assigned real valued costs $c_{j}$, which can be negative or positive.
Marinus Gottschau +3 more
openaire +2 more sources
Approximation algorithms for scheduling malleable tasks under precedence constraints [PDF]
, 2001 This work presents approximation algorithms for scheduling the tasks of a parallel application that are subject to precedence constraints. The considered tasks are malleable which means that they may be executed on a varying number of processors in ...
Woeginger, G.J. +7 more
core +2 more sources
Algorithms, 2023 The minimum-cost arborescence problem is a well-studied problem. Polynomial-time algorithms for solving it exist. Recently, a new variation of the problem called the Precedence-Constrained Minimum-Cost Arborescence Problem with Waiting Times was ...
Mauro Dell’Amico +2 more
doaj +1 more source
Approximate Deadline-Scheduling with Precedence Constraints [PDF]
, 2015 We consider the classic problem of scheduling a set of n jobs non-preemptively on a single machine. Each job j has non-negative processing time, weight, and deadline, and a feasible schedule needs to be consistent with chain-like precedence constraints. The goal is to compute a feasible schedule that minimizes the sum of penalties of late jobs. Lenstra
Efsandiari, Hossein +5 more
openaire +2 more sources
Alexandria Engineering Journal, 2018 The vehicle routing problem is the basic problem of distribution planning which seeks to find the best route with minimum displacement cost considering the number of customers, their constraints, and number and capacity of the available vehicles. In this
Davoud Sedighizadeh, Houman Mazaheripour
doaj +1 more source
Handling linear precedence constraints by unification [PDF]
Proceedings of the 30th annual meeting on Association for Computational Linguistics -, 1992 Linear precedence (LP) rules are widley used for stating word order principles. They have been adopted as constraints by HPSG but no encoding in the formalism has been provided. Since they only order siblings, they are not quite adequate, at least not for German.
Judith Engelkamp +2 more
openaire +1 more source
Minimizing waiting time under precedence constraints in health examinations
Journal of Advanced Mechanical Design, Systems, and ManufacturingThe long waiting time between examinations is a serious issue in hospitals. This study explores how precedence constraints affect waiting times for examinees in health examination scheduling.
Mari ITO +3 more
doaj +1 more source
A hybrid approach for haptics-based intelligent assembly planning
Advances in Mechanical Engineering, 2016 Assembly planning is normally realized by automatic approach or interactive approach. Both of these methods have promising advantages, but they also have inevitable shortcomings.
Pingjun Xia
doaj +1 more source