Sciweavers

388 search results - page 18 / 78
» A Mixed Closure-CSP Method to Solve Scheduling Problems
Sort
View
CCE
2006
13 years 8 months ago
State-of-the-art review of optimization methods for short-term scheduling of batch processes
There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main go...
Carlos A. Méndez, Jaime Cerdá, Ignac...
INFOCOM
2005
IEEE
14 years 2 months ago
Power controlled minimum frame length scheduling in TDMA wireless networks with sectored antennas
Abstract— We consider the problem of power controlled minimum frame length scheduling for TDMA wireless networks. Given a set of one-hop transmission requests, our objective is t...
Arindam Kumar Das, Robert J. Marks II, Payman Arab...
EOR
2008
97views more  EOR 2008»
13 years 8 months ago
Optimization models for the single delay management problem in public transportation
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
Géraldine Heilporn, Luigi De Giovanni, Mart...
CODES
2003
IEEE
14 years 2 months ago
Design optimization of mixed time/event-triggered distributed embedded systems
Distributed embedded systems implemented with mixed, eventtriggered and time-triggered task sets, which communicate over bus protocols consisting of both static and dynamic phases...
Traian Pop, Petru Eles, Zebo Peng
CF
2008
ACM
13 years 10 months ago
A distributed evolutionary method to design scheduling policies for volunteer computing
Volunteer Computing (VC) is a paradigm that takes advantage of idle cycles from computing resources donated by volunteers and connected through the Internet to compute large-scale...
Trilce Estrada, Olac Fuentes, Michela Taufer