Sciweavers

199 search results - page 15 / 40
» Complexity of two dual criteria scheduling problems
Sort
View
ECRTS
2005
IEEE
14 years 1 months ago
Scheduling Tasks with Markov-Chain Based Constraints
Markov-Chain (MC) based constraints have been shown to be an effective QoS measure for a class of real-time systems, particularly those arising from control applications. Scheduli...
Donglin Liu, Xiaobo Sharon Hu, Michael D. Lemmon, ...
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 2 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
WSC
2007
13 years 10 months ago
A simulation-based algorithm for supply chain optimization
In a supply chain, there are wide variety of problems, such as transportation scheduling problems and warehouse location problems. These problems are independently defined as opt...
Takayuki Yoshizumi, Hiroyuki Okano
HPCN
1995
Springer
13 years 11 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
14 years 1 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz