408 search results - page 36 / 82 » On a stochastic sequencing and scheduling problem |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true d...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
SPAA
2003
ACM
14 years 29 days ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
COCOA
2009
Springer
14 years 2 months ago
2009
Springer
This work presents a simple graph based heuristic that employs a roulette wheel selection mechanism for solving examination timetabling problems. We arrange exams in non-increasing...
COR
2010
13 years 7 months ago
2010
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...