300 search results - page 22 / 60 » Machine Scheduling with Availability Constraints |
IPCO
1998
13 years 8 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
CIA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we investigate methods for analyzing the expected value of adding information in distributed task scheduling problems. As scheduling problems are NP-complet...
WSC
1997
13 years 8 months ago
1997
Today's business climate for manufacturers requires low inventory, quick response systems that turn out a wide variety of products. Since many companies are reaching physical...
INFOCOM
2010
IEEE
13 years 6 months ago
2010
IEEE
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
JSSPP
2009
Springer
14 years 2 months ago
2009
Springer
It is important to identify scalability constraints in existing job scheduling software as they are applied to next generation parallel systems. In this paper, we analyze the scala...