Sciweavers

AUSAI
2003
Springer
13 years 8 months ago
Guided Operators for a Hyper-Heuristic Genetic Algorithm
We have recently introduced a hyper-heuristic genetic algorithm (hyper-GA) with an adaptive length chromosome which aims to evolve an ordering of low-level heuristics so as to find...
Limin Han, Graham Kendall
ISCAS
2003
IEEE
76views Hardware» more  ISCAS 2003»
13 years 9 months ago
Loop scheduling for minimizing schedule length and switching activities
Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activitie...
Zili Shao, Qingfeng Zhuge, Edwin Hsing-Mean Sha, C...
IPPS
2003
IEEE
13 years 9 months ago
Task Graph Scheduling Using Timed Automata
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
Yasmina Abdeddaïm, Abdelkarim Kerbaa, Oded Ma...
ECAI
2004
Springer
13 years 9 months ago
Assessing the Bias of Classical Planning Strategies on Makespan-Optimizing Scheduling
This paper investigates a loosely coupled approach to planning and scheduling integration, which consists of cascading a planner and a scheduler. While other implementations of thi...
Federico Pecora, Riccardo Rasconi, Amedeo Cesta
CP
2004
Springer
13 years 9 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
WEA
2005
Springer
119views Algorithms» more  WEA 2005»
13 years 9 months ago
On Symbolic Scheduling Independent Tasks with Restricted Execution Times
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
Daniel Sawitzki
IPPS
2005
IEEE
13 years 9 months ago
Production Scheduling by Reachability Analysis - A Case Study
— Schedule synthesis based on reachability analysis of timed automata has received attention in the last few years. The main strength of this approach is that the expressiveness ...
Gerd Behrmann, Ed Brinksma, Martijn Hendriks, Ange...
IJCNN
2006
IEEE
13 years 9 months ago
Job-Shop Scheduling with an Adaptive Neural Network and Local Search Hybrid Approach
— Job-shop scheduling is one of the most difficult production scheduling problems in industry. This paper proposes an adaptive neural network and local search hybrid approach fo...
Shengxiang Yang
GLOBECOM
2006
IEEE
13 years 9 months ago
On the Optimal Scheduling for Media Streaming in Data-driven Overlay Networks
—The Internet has witnessed a rapid growth in deployment of data-driven overlay network (DON) based streaming applications during recent years. In these applications, each nodes ...
Meng Zhang, Yongqiang Xiong, Qian Zhang, Shiqiang ...
AAIM
2007
Springer
126views Algorithms» more  AAIM 2007»
13 years 9 months ago
Mixed Criteria Packet Scheduling
Packet scheduling in networks with quality of service constraints has been extensively studied as a single criterion scheduling problem. The assumption underlying single criterion ...
Chad R. Meiners, Eric Torng