Results 21 to 30 of about 8,389 (162)
Online List Access with Precedence Constraints
CoRR, 2021 This paper considers a natural generalization of the online list access problem in the paid exchange model, where additionally there can be precedence constraints ("dependencies") among the nodes in the list. For example, this generalization is motivated by applications in the context of packet classification.
Maciej Pacut +5 more
openaire +2 more sources
Single machine scheduling problems with sequence-dependent setup times and precedence delays
Scientific Reports, 2022 Sequence-dependent setup times and precedence delays occur frequently in various production environments. This study investigates the single machine scheduling problem with setup times and precedence delays that occur in an amplifier assembly company ...
Shih-Wei Lin, Kuo-Ching Ying
doaj +1 more source
Solving Location Assignment and Order Picker-Routing Problems in Warehouse Management
Axioms, 2023 One of the critical warehousing processes is the order-picking process. This activity consists of retrieving items from their storage locations to fulfill the demand specified in the pick lists.
Johanna Bolaños-Zuñiga +2 more
doaj +1 more source
Zhejiang Daxue xuebao. Lixue ban, 2008 The single machine scheduling problem to minimize makespan with fixed jobs and precedence constraints is considered. There are some fixed jobs which are already fixed in the schedule.
YANGAi-feng(杨爱峰) +1 more
doaj +1 more source
IEEE Access, 2023 This paper studied a novel parallel machine rescheduling problem with controllable processing times under machine breakdown and precedence constraints.
De Meng +3 more
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
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
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