Sciweavers

1125 search results - page 63 / 225
» On the job rotation problem
Sort
View
AAAI
1997
13 years 11 months ago
Beyond Contention: Extending Texture-Based Scheduling Heuristics
In order to apply texture measurement based heuristic commitment techniques beyond the unary capacity resource constraints of job shop scheduling, we extend the contention texture...
J. Christopher Beck, Andrew J. Davenport, Edward M...
IOR
2008
82views more  IOR 2008»
13 years 10 months ago
Heavy-Traffic Optimality of a Stochastic Network Under Utility-Maximizing Resource Allocation
We study a stochastic network that consists of a set of servers processing multiple classes of jobs. Each class of jobs requires a concurrent occupancy of several servers while be...
Heng-Qing Ye, David D. Yao
ICPR
2008
IEEE
14 years 4 months ago
Improvement of feature matching in catadioptric images using gyroscope data
Most of vision-based algorithms for motion and localization estimation requires matching some interest points in a pair of images. After building feature correspondence, it is pos...
Jean Charles Bazin, Inso Kweon, Cédric Demo...
IMSCCS
2007
IEEE
14 years 4 months ago
TOPSAW Sawing Optimization Analysis Using Grid Computing
TOPSAW program was developed by Dr. S. Chang and his team and has been successfully used in the replication of sawmill cutting to determine the optimal cutting pattern for a log t...
Ashwin Bommathanahalli, Maoyuan Xie, Zhifeng Yun, ...
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 4 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang