Sciweavers

114 search results - page 16 / 23
» On the Robust Single Machine Scheduling Problem
Sort
View
CPAIOR
2007
Springer
14 years 1 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck
SCHEDULING
2008
89views more  SCHEDULING 2008»
13 years 6 months ago
Batch scheduling of step deteriorating jobs
In this paper we consider the problem of scheduling n jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a step function depe...
M. S. Barketau, T. C. Edwin Cheng, C. T. Ng, Vladi...
CVPR
2007
IEEE
14 years 9 months ago
Robust Click-Point Linking: Matching Visually Dissimilar Local Regions
This paper presents robust click-point linking: a novel localized registration framework that allows users to interactively prescribe where the accuracy has to be high. By emphasi...
Kazunori Okada, Xiaolei Huang
HPCA
2011
IEEE
12 years 11 months ago
ACCESS: Smart scheduling for asymmetric cache CMPs
In current Chip-multiprocessors (CMPs), a significant portion of the die is consumed by the last-level cache. Until recently, the balance of cache and core space has been primari...
Xiaowei Jiang, Asit K. Mishra, Li Zhao, Ravishanka...
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 7 months ago
Randomised Variable Neighbourhood Search for Multi Objective Optimisation
Various local search approaches have recently been applied to machine scheduling problems under multiple objectives. Their foremost consideration is the identification of the set ...
Martin Josef Geiger