164 search results - page 16 / 33 » New Heuristics for Rotation Scheduling |
117
click to vote
ECRTS
2003
IEEE
15 years 7 months ago
2003
IEEE
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...
COR
2010
15 years 2 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
106
click to vote
IEAAIE
2001
Springer
15 years 6 months ago
2001
Springer
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...
115
click to vote
IPPS
1996
IEEE
15 years 6 months ago
1996
IEEE
In a shared-memory multiprocessor system, it is possible that certain synchronization operations are redundant -that is, their corresponding sequencing requirements are enforced c...
CCGRID
2009
IEEE
15 years 8 months ago
2009
IEEE
— To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solut...