614 search results - page 58 / 123 » Resource Minimization Job Scheduling |
137
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
112
click to vote
ATS
2003
IEEE
15 years 9 months ago
2003
IEEE
1 In this paper, we show that the scheduling of tests on the test access mechanism (TAM) is equivalent to independent job scheduling on identical machines and we make use of an exi...
133
click to vote
RTSS
1999
IEEE
15 years 8 months ago
1999
IEEE
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
155
click to vote
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
125
click to vote
EOR
2006
15 years 3 months ago
2006
In this paper, we develop an acyclic network of queues for the design of a dynamic flow shop, where each service station represents a machine. The orders arrive at the input stati...