408 search results - page 46 / 82 » On a stochastic sequencing and scheduling problem |
102
click to vote
AAIM
2006
Springer
15 years 5 months ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
Developing dispatching rules for manufacturing systems is a tedious process, which is time- and cost-consuming. Since there is no good general rule for different scenarios and ob...
103
click to vote
SCHEDULING
2008
14 years 11 months ago
2008
This paper considers the scheduling problems arising in two- and three-machine manufacturing cells configured in a flowshop which repeatedly produces one type of product and where ...
134
click to vote
ISPAN
2002
IEEE
15 years 4 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
COMPSAC
2009
IEEE
15 years 6 months ago
2009
IEEE
—This paper deals with the problem of scheduling workflow applications with Quality of Service (QoS) constraints, comprising real-time and interactivity constraints, over a servi...