A survey and comparative study of hard and soft real-time dynamic resource allocation strategies for multi-/many-core systems
Multi-/many-core systems are envisioned to satisfy the ever-increasing performance
requirements of complex applications in various domains such as embedded and high …
requirements of complex applications in various domains such as embedded and high …
A taxonomy for task allocation problems with temporal and ordering constraints
Previous work on assigning tasks to robots has proposed extensive categorizations of
allocation of tasks with and without constraints. The main contribution of this paper is a …
allocation of tasks with and without constraints. The main contribution of this paper is a …
Review of real-time vehicle schedule recovery methods in transportation services
This paper presents a comprehensive review on methods for real-time schedule recovery in
transportation services. The survey concentrates on published research on recovery of …
transportation services. The survey concentrates on published research on recovery of …
Decomposition methods for the parallel machine scheduling problem with setups
We study the unrelated parallel machine scheduling problem with sequence and machine-
dependent setup times and the objective of makespan minimization. Two exact …
dependent setup times and the objective of makespan minimization. Two exact …
[HTML][HTML] Logic-based Benders decomposition with a partial assignment acceleration technique for avionics scheduling
E Karlsson, E Rönnberg - Computers & Operations Research, 2022 - Elsevier
Pre-runtime scheduling of large-scale electronic systems, as those in modern aircraft, can be
computationally challenging. In this paper, we study a distributed integrated modular avionic …
computationally challenging. In this paper, we study a distributed integrated modular avionic …
Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
In this study, we propose constraint programming (CP) model and logic-based Benders
algorithms in order to make the best decisions for scheduling non-identical jobs with …
algorithms in order to make the best decisions for scheduling non-identical jobs with …
Resource allocation with dependencies in business process management systems
Abstract Business Process Management Systems (BPMS) facilitate the execution of
business processes by coordinating all involved resources. Traditional BPMS assume that …
business processes by coordinating all involved resources. Traditional BPMS assume that …
A constraint programming approach for the team orienteering problem with time windows
The team orienteering problem with time windows (TOPTW) is a NP-hard combinatorial
optimization problem. It has many real-world applications, for example, routing technicians …
optimization problem. It has many real-world applications, for example, routing technicians …
Stochastic customer order scheduling on heterogeneous parallel machines with resource allocation consideration
This study considers a stochastic customer order scheduling and resource allocation
problem in an unrelated parallel machine environment. Customer orders dynamically arrive …
problem in an unrelated parallel machine environment. Customer orders dynamically arrive …
Combinatorial register allocation and instruction scheduling
This article introduces a combinatorial optimization approach to register allocation and
instruction scheduling, two central compiler problems. Combinatorial optimization has the …
instruction scheduling, two central compiler problems. Combinatorial optimization has the …