103 search results - page 19 / 21 » Online weighted flow time and deadline scheduling |
100
click to vote
WOA
2007
15 years 27 days ago
2007
—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup ti...
89
Voted
GCC
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
101
click to vote
CAMAD
2006
IEEE
15 years 3 months ago
2006
IEEE
Switched Processing Systems (SPS) capture the essence of a fundamental resource allocation problem in many modern communication, computer and manufacturing systems involving hetero...
123
click to vote
ICVS
2001
Springer
15 years 4 months ago
2001
Springer
An increasing number of computer vision applications require on-line processing of data streams, preferably in real-time. This trend is fueled by the mainstream availability of low...
107
click to vote
MOR
2008
14 years 11 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...