Sciweavers

294 search results - page 29 / 59
» Bayesian Heuristic Approach to Scheduling
Sort
View
IEAAIE
2001
Springer
14 years 2 months ago
A Mixed Closure-CSP Method to Solve Scheduling Problems
Scheduling problems can be seen as a set of temporal metric and disjunctive constraints. So, they can be formulated in terms of CSPs techniques. In the literature, there are CSP-b...
María Isabel Alfonso Galipienso, Federico B...
COR
2006
96views more  COR 2006»
13 years 10 months ago
Scheduling two parallel machines with a single server: the general case
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan
CLOUDCOM
2010
Springer
13 years 8 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Di-Wei Huang, Jimmy Lin
IPPS
2006
IEEE
14 years 4 months ago
An optimal approach to the task allocation problem on hierarchical architectures
We present a SAT-based approach to the task and message allocation problem of distributed real-time systems with hierarchical architectures. In contrast to the heuristic approache...
Alexander Metzner, Martin Fränzle, Christian ...
ECRTS
2003
IEEE
14 years 3 months ago
Schedulability Analysis for Distributed Heterogeneous Time/Event Triggered Real-Time Systems
This paper deals with specific issues related to the design of distributed embedded systems implemented with mixed, event-triggered and time-triggered task sets, which communicate...
Traian Pop, Petru Eles, Zebo Peng