Sciweavers

289 search results - page 25 / 58
» Production Scheduling by Reachability Analysis - A Case Stud...
Sort
View
ICTCS
2003
Springer
14 years 1 months ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd
IPCO
1998
152views Optimization» more  IPCO 1998»
13 years 9 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
ELPUB
2007
ACM
13 years 12 months ago
Towards a Semantic Turn in Rich-Media Analysis
Typical application scenarios in the area of rich-media management, such as the continuous digitisation of the media production processes, the search and retrieval tasks in a grow...
Tobias Bürger, Georg Güntner
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
IJSEKE
2000
111views more  IJSEKE 2000»
13 years 7 months ago
An Approach to Quantitative Software Architecture Sensitivity Analysis
Software architectures are often claimed to be robust. However, there is no explicit and concrete definition of software architecture robustness. This paper gives a definition of ...
Chung-Horng Lung, Kalai Kalaichelvan