408 search results - page 28 / 82 » On a stochastic sequencing and scheduling problem |
164
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
Scheduling problems are generally NP-hard combinatorial problems, and a lot of research has been done to solve these problems heuristically. However, most of the previous approach...
140
click to vote
EOR
2006
15 years 5 months ago
2006
In this paper, a multi-period assignment problem is studied that arises as part of a weekly planning problem at mail processing and distribution centers. These facilities contain ...
158
click to vote
PATAT
2000
Springer
15 years 9 months ago
2000
Springer
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
125
click to vote
STACS
2000
Springer
15 years 9 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
146
click to vote
FMSD
2007
15 years 5 months ago
2007
Real-time embedded systems are often specified as a collection of independent tasks, each generating a sequence of event-triggered code blocks, and the scheduling in this domain ...